Fetching the paper…
Reading the bibliography…
This paper is concerned with jointly recovering $n$ node-variables $\left\{ x_{i}\right\}_{1\leq i\leq n}$ from a collection of pairwise difference measurements.
On measures of entropy and information
A. Rényi · 1961
Earlier work this paper cites.
Sanov property, generalized I-projection and a conditional limit theorem
Imre Csiszár · 1984
Earlier work this paper cites.
Large deviations techniques and applications
A. Dembo and O. Zeitouni · 1998
Earlier work this paper cites.
Some inequalities for information divergence and related measures of discrimination
F. Topsoe · 2000
Earlier work this paper cites.
Upper and lower bounds for Csiszar f f -divergence in terms of Hellinger discrimination and applications
SS Dragomir · 2002
Earlier work this paper cites.
Random geometric graphs
M. Penrose · 2003
Earlier work this paper cites.
Estimating mutual information
Alexander Kraskov, Harald Stögbauer, and Peter Grassberger · 2004
Earlier work this paper cites.
Probability and computing: Randomized algorithms and probabilistic analysis
M. Mitzenmacher and E. Upfal · 2005
Earlier work this paper cites.
Elements of information theory
Thomas M Cover and Joy A Thomas · 2006
Earlier work this paper cites.
On divergences and informations in statistics and information theory
F. Liese and I. Vajda · 2006
Earlier work this paper cites.
Random graph dynamics
R. Durrett · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candes and B. Recht · 2009
Earlier work this paper cites.
Introduction to nonparametric estimation
Alexandre B Tsybakov and Vladimir Zaiats · 2009
Earlier work this paper cites.
Community detection in graphs
S. Fortunato · 2010
Earlier work this paper cites.
Optimal algorithms for haplotype assembly from whole-genome sequence data
D. He, A. Choi, K. Pipatsrisawat, A. Darwiche, and E. Eskin · 2010
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Disambiguating visual relations using loop constraints
C. Zach, M. Klopschitz, and M. Pollefeys · 2010
Earlier work this paper cites.
Clustering partially observed graphs via convex optimization
A. Jalali, Y. Chen, S. Sanghavi, and H. Xu · 2011
Earlier work this paper cites.
Haplotype phasing: existing methods and new developments
S. Browning and B. Browning · 2011
Earlier work this paper cites.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Earlier work this paper cites.
Rank-sparsity incoherence for matrix decomposition
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A Parrilo, and Alan S Willsky · 2011
Cited alongside, same era.
SfM with MRFs: discrete-continuous optimization for large-scale structure from motion
David Crandall, Andrew Owens, Noah Snavely, and Dan Huttenlocher · 2011
Cited alongside, same era.
Hapsembler: an assembler for highly polymorphic genomes
N. Donmez and M. Brudno · 2011
Cited alongside, same era.
Lower bounds for the minimax risk using-divergences, and applications
A. Guntuboyina · 2011
Cited alongside, same era.
Eigenvector synchronization, graph rigidity and the molecule problem
M. Cucuringu, A. Singer, and D. Cowburn · 2012
Cited alongside, same era.
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2014
Later among the works it cites.
Minimax estimation of functionals of discrete distributions
J. Jiao, K. Venkat, Y. Han, and T. Weissman · 2014
Later among the works it cites.
A generic sample splitting approach for refined community recovery in stochastic block models
J. Lei and L. Zhu · 2014
Later among the works it cites.
Consistency thresholds for binary symmetric block models
E. Mossel, J. Neeman, and A. Sly · 2014
Later among the works it cites.
Haplotype assembly: An information theoretic view
H. Si, H. Vikalo, and S. Vishwanath · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Mossel, J. Neeman, and A. Sly · 2012
Cited alongside, same era.
Exact and stable recovery of rotations for robust synchronization
L. Wang and A. Singer · 2012
Cited alongside, same era.
Conditional random fields, planted constraint satisfaction and entropy concentration
E. Abbe and A. Montanari · 2013
Cited alongside, same era.
The mutual information of a class of graphical channels
E. Abbe and A. Montanari · 2013
Cited alongside, same era.
Consistent shape maps via semidefinite programming
Q. Huang and L. Guibas · 2013
Cited alongside, same era.
Solving the multi-way matching problem by permutation synchronization
D. Pachauri, R. Kondor, and V. Singh · 2013
Cited alongside, same era.
Discrete signal processing on graphs
Aliaksei Sandryhaila and José MF Moura · 2013
Cited alongside, same era.
Rényi divergence and Kullback-Leibler divergence
T. Van Erven and P Harremos · 2014
Later among the works it cites.
Graduated consistency-regularized optimization for multi-graph matching
J. Yan, Y. Li, W. Liu, H. Zha, X. Yang, and S. M. Chu · 2014
Later among the works it cites.
Accurate community detection in the stochastic block model via spectral algorithms
Se-Young Yun and Alexandre Proutiere · 2014
Later among the works it cites.
E. Abbe and C. Sandon · 2015
Closest in time.
Random Laplacian matrices and convex relaxations
A. S. Bandeira · 2015
Closest in time.
Discrete signal processing on graphs: Sampling theory
Siheng Chen, Rohan Varma, Aliaksei Sandryhaila, and Jelena Kovacevic · 2015
Closest in time.
Information recovery from pairwise measurements: A Shannon-theoretic approach
Yuxin Chen, Changho Suh, and Andrea J Goldsmith · 2015
Closest in time.
P. Chin, A. Rao, and V. Vu · 2015
Closest in time.
Achieving optimal misclassification proportion in stochastic block model
C. Gao, Z. Ma, A. Y. Zhang, and H. H. Zhou · 2015
Closest in time.
How hard is inference for structured prediction?
A. Globerson, T. Roughgarden, D. Sontag, and C. Yildirim · 2015
Closest in time.
Optimal haplotype assembly from high-throughput mate-pair reads
G. Kamath, E. Sasoglu, and D. Tse · 2015
Closest in time.
Semidefinite programs on sparse random graphs
A. Montanari and S. Sen · 2015
Closest in time.
Igal Sason and Sergio Verdú · 2015
Closest in time.
Community recovery in graphs with locality
Yuxin Chen, Govinda Kamath, Changho Suh, and David Tse · 2016
Closest in time.
Recovering structured probability matrices
Qingqing Huang, Sham M Kakade, Weihao Kong, and Gregory Valiant · 2016
Closest in time.