机构:
Univ Calif Berkeley, Berkeley, CA 94720 USA
Univ Penn, Philadelphia, PA 19104 USAUniv Calif Berkeley, Berkeley, CA 94720 USA
Mossel, Elchanan
[1
,2
]
Ross, Nathan
论文数: 0引用数: 0
h-index: 0
机构:
Univ Melbourne, Sch Math & Stat, Parkville, Vic 3010, AustraliaUniv Calif Berkeley, Berkeley, CA 94720 USA
Ross, Nathan
[3
]
机构:
[1] Univ Calif Berkeley, Berkeley, CA 94720 USA
[2] Univ Penn, Philadelphia, PA 19104 USA
[3] Univ Melbourne, Sch Math & Stat, Parkville, Vic 3010, Australia
来源:
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
|
2019年
/
6卷
/
02期
基金:
美国国家科学基金会;
关键词:
Random graphs;
statistical identifiability;
probabilistic algorithms;
shotgun assembly;
random jigsaw puzzles;
DIAMETER;
D O I:
10.1109/TNSE.2017.2776913
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include the well-known: DNA shotgun assembly; the lesser-known: neural network reconstruction; and a new problem: assembling random jigsaw puzzles. We provide some necessary and some sufficient conditions for correct recovery both in combinatorial terms and for some generative models including random labelings of lattices, Erdos-Renyi random graphs, and a random jigsaw puzzle model. Many open problems and conjectures are provided.
机构:
Tel Aviv Univ, Sackler Sch Math, IL-69978 Tel Aviv, Israel
Tel Aviv Univ, Blavatnik Sch Comp Sci, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Sackler Sch Math, IL-69978 Tel Aviv, Israel
Alon, Noga
Mehrabian, Abbas
论文数: 0引用数: 0
h-index: 0
机构:
Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, CanadaTel Aviv Univ, Sackler Sch Math, IL-69978 Tel Aviv, Israel
机构:
Lomonosov Moscow State Univ, Moscow, Russia
Moscow Inst Phys & Technol, Dolgoprudnyi, Russia
Yandex, Moscow, Russia
Buryat State Univ, Inst Math & Comp Sci, Ulan Ude, RussiaLomonosov Moscow State Univ, Moscow, Russia
Raigorodskii, Andrei
INFORMATION RETRIEVAL, (RUSSIR 2015),
2016,
573
: 101
-
118