An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability
We design a randomized algorithm that finds a Hamilton cycle in đť’Ş(n) time with high probability in a random graph G_{n,p} with edge probability p â‰Ą C log n / n. This closes a gap left open in a seminal paper by Angluin and Valiant from 1979.
Random Graphs
Hamilton Cycle
Perfect Matching
Linear Time
Sublinear Algorithm
Random Walk
Coupon Collector
Theory of computation~Graph algorithms analysis
Mathematics of computing~Random graphs
Mathematics of computing~Graph algorithms
Mathematics of computing~Matchings and factors
Theory of computation~Random walks and Markov chains
60:1-60:17
Regular Paper
Rajko
Nenadov
Rajko Nenadov
ETH ZĂĽrich, Switzerland
Angelika
Steger
Angelika Steger
ETH ZĂĽrich, Switzerland
Pascal
Su
Pascal Su
ETH ZĂĽrich, Switzerland
This author was supported by grant no. 200021 169242 of the Swiss National Science Foundation.
10.4230/LIPIcs.ITCS.2021.60
MiklĂłs Ajtai, JĂˇnos KomlĂłs, and Endre SzemerĂ©di. First occurrence of Hamilton cycles in random graphs. North-Holland Mathematics Studies, 115(C):173-178, 1985.
Peter Allen, Julia BĂ¶ttcher, Yoshiharu Kohayakawa, and Yury Person. Tight hamilton cycles in random hypergraphs. Random Structures & Algorithms, 46(3):446-465, 2015.
Yahav Alon and Michael Krivelevich. Finding a Hamilton cycle fast on average using rotations and extensions. Random Structures & Algorithms, 57(1):32-46, 2020.
Dana Angluin and Leslie G Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences, 18(2):155-193, 1979.
Richard Arratia, Andrew D Barbour, and Simon TavarĂ©. Logarithmic combinatorial structures: a probabilistic approach, volume 1. European Mathematical Society, 2003.
Richard Arratia and Simon TavarĂ©. The cycle structure of random permutations. The Annals of Probability, pages 1567-1591, 1992.
Tom Bohman and Alan Frieze. Hamilton cycles in 3-out. Random Structures & Algorithms, 35(4):393-417, 2009.
Bela Bollobas, Trevor I. Fenner, and Alan M. Frieze. An algorithm for finding Hamilton paths and cycles in random graphs. Combinatorica, 7(4):327-341, 1987.
Bela BollobĂˇs, Trevor I. Fenner, and Alan M. Frieze. Hamilton cycles in random graphs with minimal degree at least k. A tribute to Paul Erdos, edited by A. Baker, B. BollobĂˇs and A. Hajnal, pages 59-96, 1990.
C.A. Crane. Linear Lists and Priority Queues as Balanced Binary Trees. Computer Science Department. Department of Computer Science, Stanford University., 1972.
Trevor I Fenner and Alan M Frieze. Hamiltonian cycles in random regular graphs. Journal of Combinatorial Theory, Series B, 37(2):103-112, 1984.
Asaf Ferber, Michael Krivelevich, Benny Sudakov, and Pedro Vieira. Finding hamilton cycles in random graphs with few queries. Random Structures & Algorithms, 49(4):635-668, 2016.
Alan Frieze. Hamilton cycles in random graphs: a bibliography. arXiv preprint, 2019. URL: http://arxiv.org/abs/1901.07139.
http://arxiv.org/abs/1901.07139
Alan Frieze, Mark Jerrum, Michael Molloy, Robert Robinson, and Nicholas Wormald. Generating and counting hamilton cycles in random regular graphs. Journal of Algorithms, 21(1):176-198, 1996.
Alan M Frieze. Finding hamilton cycles in sparse random graphs. Journal of Combinatorial Theory, Series B, 44(2):230-250, 1988.
Yuri Gurevich and Saharon Shelah. Expected computation time for Hamiltonian path problem. SIAM Journal on Computing, 16(3):486-502, 1987.
Svante Janson, Tomasz Luczak, and Andrzej Rucinski. Random graphs, volume 45. John Wiley & Sons, 2011.
Donald E Knuth. The art of computer programming: Volume 3: Sorting and Searching. Addison-Wesley Professional, 1998.
JĂˇnos KomlĂłs and Endre SzemerĂ©di. Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete mathematics, 43(1):55-63, 1983.
Aleksei Dmitrievich Korshunov. Solution of a problem of erdĹ‘s and renyi on Hamiltonian cycles in nonoriented graphs. Doklady Akademii Nauk, 228(3):529-532, 1976.
Kenneth Maples, Ashkan Nikeghbali, and Dirk Zeindler. On the number of cycles in a random permutation. Electron. Commun. Probab., 17:13 pp., 2012.
Richard Montgomery. Hamiltonicity in random graphs is born resilient. Journal of Combinatorial Theory, Series B, 139:316-341, 2019.
Rajko Nenadov, Angelika Steger, and MiloĹˇ TrujiÄ‡. Resilience of perfect matchings and hamiltonicity in random graph processes. Random Structures & Algorithms, 54(4):797-819, 2019.
Anna Pagh, Rasmus Pagh, and Milan Ruzic. Linear probing with constant independence. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 318-327, 2007.
Ben Pfaff. An introduction to binary search trees and balanced trees. Libavl Binary Search Tree Library, 1:19-20, 1998.
Robert W. Robinson and Nicholas C. Wormald. Almost all regular graphs are Hamiltonian. Random Structures & Algorithms, 5(2):363-374, 1994.
Ronitt Rubinfeld and Asaf Shapira. Sublinear time algorithms. SIAM Journal on Discrete Mathematics, 25(4):1562-1588, 2011.
Eli Shamir. How many random edges make a graph Hamiltonian? Combinatorica, 3(1):123-131, 1983.
Benny Sudakov and Van H Vu. Local resilience of graphs. Random Structures & Algorithms, 33(4):409-433, 2008.
Andrew Thomason. A simple linear expected time algorithm for finding a hamilton path. Discrete Mathematics, 75(1-3):373-379, 1989.
Mikkel Thorup and Yin Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA, volume 4, pages 615-624, 2004.
Rajko Nenadov, Angelika Steger, and Pascal Su
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode