Journal: Random Struct. Algorithms

Volume 49, Issue 4

635 -- 668Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira. Finding Hamilton cycles in random graphs with few queries
669 -- 693József Balogh, Theodore Molla, Maryam Sharifzadeh. Triangle factors of graphs without large independent sets and of weighted graphs
694 -- 741Victor Bapst, Amin Coja-Oghlan. Harnessing the Bethe free energy
742 -- 765Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell. Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
766 -- 794Jonas Groschwitz, Tibor Szabó. Sharp thresholds for half-random games I
795 -- 818Amanda Lohss. The asymptotic distribution of symbols on diagonals of random weighted staircase tableaux
819 -- 844Olaf Parczyk, Yury Person. Spanning structures and universality in sparse hypergraphs
845 -- 872József Balogh, Andrew Treglown, Zsolt Adam Wagner. Applications of graph containers in the Boolean lattice

Volume 49, Issue 3

409 -- 428Robin Pemantle, Yuval Peres, Igor Rivin. n with high probability
429 -- 478Paul Balister, Béla Bollobás, Amites Sarkar. Barrier Coverage
479 -- 502Patrick Bennett, Tom Bohman. A note on the random greedy independent set algorithm
503 -- 532Sébastien Bubeck, Jian Ding, Ronen Eldan, Miklós Z. Rácz. Testing for high-dimensional geometry in random graphs
533 -- 557Michael Krivelevich, Choongbum Lee, Benny Sudakov. Compatible Hamilton cycles in random graphs
558 -- 578Rajko Nenadov, Angelika Steger, Milos Stojakovic. H-game
579 -- 598Kenta Oono, Yuichi Yoshida. Testing properties of functions on finite groups
599 -- 631Neal Madras, Lerna Pehlivan. Structure of random 312-avoiding permutations

Volume 49, Issue 2

213 -- 234Omer Angel, Asaf Nachmias, Gourab Ray. Random walks on stochastic hyperbolic half planar triangulations
235 -- 252Alessandro Arlotto, Elchanan Mossel, J. Michael Steele. Quickest online selection of an increasing subsequence of specified size
253 -- 279Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen. 1-grid and Lipschitz maps between discrete tori
280 -- 307Eli Ben-Sasson, Michael Viderman. A combinatorial characterization of smooth LTCs and applications
308 -- 321Maurício Collares Neto, Robert Morris. Maximum-size antichains in random set-systems
322 -- 344David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson 0002, Aravind Srinivasan. Efficient computation of sparse structures
345 -- 362Dan Hefetz, Angelika Steger, Benny Sudakov. Random directed graphs are robustly Hamiltonian
363 -- 378John Lenz, Dhruv Mubayi, Richard Mycroft. Hamilton cycles in quasirandom hypergraphs
379 -- 405Sayan Mukherjee, John Steenbergen. Random walks on simplicial complexes and harmonics

Volume 49, Issue 1

3 -- 64Boris Pittel, Daniel Poole. Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
65 -- 94Michel Bode, Nikolaos Fountoulakis, Tobias Müller. The probability of connectivity in a hyperbolic model of complex networks
95 -- 136Nicolas Broutin, Olivier Devillers, Ross Hemsley. Efficiently navigating a random Delaunay triangulation
137 -- 159Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna. Absorption time of the Moran process
160 -- 184Nathanaël Enriquez, Laurent Ménard. Spectra of large diluted but bushy random graphs
185 -- 208Abbas Mehrabian, Ali Pourmiri. Randomized rumor spreading in poorly connected small-world networks