Journal: Random Struct. Algorithms

Volume 63, Issue 4

867 -- 884Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich. Cycle lengths in randomly perturbed graphs
885 -- 941Thomas Bläsius, Tobias Friedrich 0001, Andreas Göbel 0001, Jordi Levy, Ralf Rothenberger. The impact of heterogeneity and geometry on the proof complexity of random satisfiability
942 -- 967Alessandra Caraceni, Alexandre Stauffer. Growing uniform planar maps face by face
968 -- 996Sayan Das, Zoe M. Himwich, Nitya Mani. A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs
997 -- 1053Pandelis Dodos, Konstantinos Tyros, Petros Valettas. Concentration estimates for functions of finite high-dimensional random arrays
1054 -- 1099Jimmy He, Tobias Müller, Teun W. Verstraaten. Cycles in Mallows random permutations
1100 -- 1136Nobutaka Shimizu, Takeharu Shiraga. Reversible random walks on dynamic graphs

Volume 63, Issue 3

591 -- 609Yulin Chang, Jie Han, Lubos Thoma. On powers of tight Hamilton cycles in randomly perturbed hypergraphs
610 -- 623David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte. Hypergraph Ramsey numbers of cliques versus stars
624 -- 688Leonardo Nagami Coregliano, Alexander A. Razborov. Natural quasirandomness properties
689 -- 715Ahmed El Alaoui, Andrea Montanari, Mark Sellke. Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
716 -- 752David G. Harris 0001. Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
753 -- 778András Mészáros. Matchings on trees and the adjacency matrix: A determinantal viewpoint
779 -- 820Joe Neeman, Charles Radin, Lorenzo Sadun. Moderate deviations in cycle count
821 -- 863Vojtech Rödl, Marcelo Tadeu Sales, Yi Zhao. Independence number of hypergraphs under degree conditions

Volume 63, Issue 2

283 -- 342Mindaugas Bloznelis, Lasse Leskelä. Clustering and percolation on superpositions of Bernoulli random graphs
343 -- 363Jane Breen, Nolan Faught, Cory Glover, Mark Kempton, Adam Knudson, Alice Oveson. Kemeny's constant for nonbacktracking random walks
364 -- 405Colin Desmarais, Cecilia Holmgren, Stephan Wagner. Broadcasting-induced colorings of preferential attachment trees
406 -- 441Sahar Diskin, Michael Krivelevich. Site percolation on pseudo-random graphs
442 -- 456Benjamin Gunby, Xiaoyu He, Bhargav Narayanan. Down-set thresholds
457 -- 511Günter Last, Giovanni Peccati, D. Yogeshwaran. Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees
512 -- 532Claire Mathieu, Hang Zhou 0001. A simple algorithm for graph reconstruction
533 -- 556Gennady Samorodnitsky, Takashi Owada. Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes
557 -- 587Amir Sarid. The spectral gap of random regular graphs

Volume 63, Issue 1

3 -- 26Richard Arratia, Stephen Desalvo. On the largest part size of low-rank combinatorial assemblies
27 -- 60Alexander I. Barvinok. Smoothed counting of 0-1 points in polyhedra
61 -- 101Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi. Expansion and flooding in dynamic random networks with node churn
102 -- 129Miklós Bóna, Boris G. Pittel. Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
130 -- 170Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins 0001, Prasad Tetali. d at all temperatures
171 -- 191Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran. Majority dynamics on sparse random graphs
192 -- 214Asaf Ferber, Liam Hardiman, Michael Krivelevich. On subgraphs with degrees of prescribed residues in the random graph
215 -- 241Matthew Jenssen, Will Perkins 0001, Aditya Potukuchi. Approximately counting independent sets in bipartite graphs via graph containers
242 -- 279Matthew Kahle, Minghao Tian, Yusu Wang 0001. On the clique number of noisy random geometric graphs