Fetching the paper…
Reading the bibliography…
We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements.
A method for chronologically ordering archaeological deposits
William S Robinson · 1951
Earlier work this paper cites.
Solution of a large-scale traveling-salesman problem
George Dantzig, Ray Fulkerson, and Selmer Johnson · 1954
Earlier work this paper cites.
Non-null ranking models. i
Colin L Mallows · 1957
Earlier work this paper cites.
On measures of entropy and information
Alfréd Rényi · 1961
Earlier work this paper cites.
Integer programming: methods, uses, computations
Michel Louis Balinski · 1965
Earlier work this paper cites.
Maximum matching and a polyhedron with 0, 1-vertices
Jack Edmonds · 1965
Earlier work this paper cites.
Paths, trees, and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
Moves without forbidden transitions in a graph
Anton Kotzig · 1968
Earlier work this paper cites.
The traveling-salesman problem and minimum spanning trees
Michael Held and Richard M Karp · 1970
Earlier work this paper cites.
Abundance matrices and seriation in archaeology
David G Kendall · 1971
Earlier work this paper cites.
A cutting plane algorithm for minimum perfect 2-matchings
Martin Grötschel and Olaf Holland · 1987
Earlier work this paper cites.
Large cliques elude the Metropolis process
Mark Jerrum · 1992
Earlier work this paper cites.
Finding hidden hamiltonian cycles
Andrei Z Broder, Alan M Frieze, and Eli Shamir · 1994
Earlier work this paper cites.
Dna physical mapping and alternating eulerian cycles in colored graphs
Pavel A Pevzner · 1995
Earlier work this paper cites.
A spectral algorithm for seriation and the consecutive ones problem
Jonathan E. Atkins, Erik G. Boman, and Bruce Hendrickson · 1998
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’ networks
Duncan J Watts and Steven H Strogatz · 1998
Earlier work this paper cites.
Semidefinite programming relaxations for the quadratic assignment problem
Qing Zhao, Stefan E Karisch, Franz Rendl, and Henry Wolkowicz · 1998
Earlier work this paper cites.
A new bound for the ratio between the 2-matching problem and its linear programming relaxation
Sylvia Boyd and Robert Carr · 1999
Earlier work this paper cites.
Semidefinite programming methods for the symmetric traveling salesman problem
Dragoš Cvetković, Mirjana Čangalović, and Vera Kovačević-Vujčić · 1999
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
Combinatorial optimization: polyhedra and efficiency
Alexander Schrijver · 2003
Cited alongside, same era.
Allpaths: de novo assembly of whole-genome shotgun microreads
Jonathan Butler, Iain MacCallum, Michael Kleber, Ilya A Shlyakhter, Matthew K Belmonte, Eric S Lander, Chad Nusbaum, and David B Jaffe · 2008
Cited alongside, same era.
On semidefinite programming relaxations of the traveling salesman problem
Etienne De Klerk, Dmitrii V Pasechnik, and Renata Sotirov · 2008
Cited alongside, same era.
Odd minimum cut sets and b-matchings revisited
Adam N Letchford, Gerhard Reinelt, and Dirk Oliver Theis · 2008
Cited alongside, same era.
Multisection in the stochastic block model using semidefinite programming
N. Agarwal, A. S. Bandeira, K. Koiliaris, and A. Kolla · 2015
Later among the works it cites.
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms
Emmanuel Abbe and Colin Sandon · 2015
Later among the works it cites.
Random Laplacian matrices and convex relaxations
A.S. Bandeira · 2015
Later among the works it cites.
Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs
C. Bordenave, M. Lelarge, and L. Massoulié · 2015
Later among the works it cites.
Improved sum-of-squares lower bounds for hidden clique and hidden submatrix problems
Y. Deshpande and A. Montanari · 2015
Later among the works it cites.
Information-theoretic bounds for exact recovery in weighted stochastic block models using the renyi divergence
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Comprehensive mapping of long-range interactions reveals folding principles of the human genome
Erez Lieberman-Aiden, Nynke L Van Berkum, Louise Williams, Maxim Imakaev, Tobias Ragoczy, Agnes Telling, Ido Amit, Bryan R Lajoie, Peter J Sabo, Michael O Dorschner, et al · 2009
Cited alongside, same era.
Belief propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions
Mohsen Bayati, Christian Borgs, Jennifer Chayes, and Riccardo Zecchina · 2011
Cited alongside, same era.
Stringing high-dimensional data for functional analysis
Kun Chen, Kehui Chen, Hans-Georg Muller, and Jane-Ling Wang · 2011
Cited alongside, same era.
Meraculous: de novo genome assembly with short paired-end reads
Jarrod A Chapman, Isaac Ho, Sirisha Sunkara, Shujun Luo, Gary P Schroth, and Daniel S Rokhsar · 2011
Cited alongside, same era.
Convex relaxations and integrality gaps
Eden Chlamtac and Madhur Tulsiani · 2012
Cited alongside, same era.
Iterative correction of hi-c data reveals hallmarks of chromosome organization
Maxim Imakaev, Geoffrey Fudenberg, Rachel Patton McCord, Natalia Naumova, Anton Goloborodko, Bryan R Lajoie, Job Dekker, and Leonid A Mirny · 2012
Cited alongside, same era.
V. Jog and P.-L. Loh · 2015
Later among the works it cites.
Consistency thresholds for the planted bisection model
Elchanan Mossel, Joe Neeman, and Allan Sly · 2015
Later among the works it cites.
Sum-of-squares lower bounds for planted clique
R. Meka, A. Potechin, and A. Wigderson · 2015
Later among the works it cites.
A semidefinite program for unbalanced multisection in the stochastic block model
W. Perry and A.S. Wein · 2015
Later among the works it cites.
Hic-pro: an optimized and flexible pipeline for hi-c data processing
Nicolas Servant, Nelle Varoquaux, Bryan R Lajoie, Eric Viara, Chong-Jian Chen, Jean-Philippe Vert, Edith Heard, Job Dekker, and Emmanuel Barillot · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
E. Abbe, A. S. Bandeira, and G. Hall · 2016
Later among the works it cites.
A nearly tight sum-of-squares lower bound for the planted clique problem
Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, and Aaron Potechin · 2016
Later among the works it cites.
Achieving exact cluster recovery threshold via semidefinite programming: Extensions
B. Hajek, Y. Wu, and J. Xu · 2016
Later among the works it cites.
Semidefinite programs for exact recovery of a hidden community
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2016
Later among the works it cites.
Chromosome-scale shotgun assembly using an in vitro method for long-range linkage
Nicholas H Putnam, Brendan L O’Connell, Jonathan C Stites, Brandon J Rice, Marco Blanchette, Robert Calef, Christopher J Troll, Andrew Fields, Paul D Hartley, and Charles W Sugnet · 2016
Later among the works it cites.
Improvement of the threespine stickleback (gasterosteus aculeatus) genome using a hi-c-based proximity-guided assembly method
Catherine L Peichel, Shawn T Sullivan, Ivan Liachko, and Michael A White · 2016
Later among the works it cites.
Minimax rates of community detection in stochastic block models
Anderson Y Zhang and Harrison H Zhou · 2016
Later among the works it cites.
On detection and structural reconstruction of small-world random networks
Tony Cai, Tengyuan Liang, and Alexander Rakhlin · 2017
Later among the works it cites.
De novo assembly of the aedes aegypti genome using hi-c yields chromosome-length scaffolds
Olga Dudchenko, Sanjit S Batra, Arina D Omer, Sarah K Nyquist, Marie Hoeger, Neva C Durand, Muhammad S Shamim, Ido Machol, Eric S Lander, Aviva Presser Aiden, et al · 2017
Later among the works it cites.
Scaffolding of long read assemblies using long range contact information
Jay Ghurye, Mihai Pop, Sergey Koren, Derek Bickhart, and Chen-Shan Chin · 2017
Later among the works it cites.