Random Structures & Algorithms

Article	Citations
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu	19
Modularity of Erdős‐Rényi random graphs	15
Fast algorithms at low temperatures via Markov chains†	15
Combinatorial and stochastic properties of ranked tree‐child networks	13
Dynamic concentration of the triangle‐free process	11
Seeded graph matching via large neighborhood statistics	11
Coloring triangle‐free graphs with local list sizes	9
Invertibility via distance for noncentered random matrices with continuous distributions	9
Characterization of quasirandom permutations by a pattern sum	9
Rapid mixing of the switch Markov chain for strongly stable degree sequences	9
Colorings, transversals, and local sparsity	8
Outliers in spectrum of sparse Wigner matrices	8
Minimalist designs	8
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs	8
Phase transition for the volume of high‐dimensional random polytopes	7
Community detection in the sparse hypergraph stochastic block model	7
Quasirandom Latin squares	6
New bounds for the Moser‐Tardos distribution	6
Approximating the distance to monotonicity of Boolean functions	6
Vertex Ramsey properties of randomly perturbed graphs	6
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels	6
Fractional cycle decompositions in hypergraphs	5
On‐line balancing of random inputs	5
Hyperuniform and rigid stable matchings	5
The size‐Ramsey number of short subdivisions	5

Mixing time of PageRank surfers on sparse random digraphs	5
Existence thresholds and Ramsey properties of random posets	5
Superconcentration in surface growth	5
On the upper tail problem for random hypergraphs	5
A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph	5
Site percolation and isoperimetric inequalities for plane graphs	5
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	5
Sharpness of the phase transition for parking on random trees	4
Finitary codings for gradient models and a new graphical representation for the six‐vertex model	4
Random triangles in random graphs	4
The number of satisfying assignments of random 2‐SAT formulas	4
The discrepancy of random rectangular matrices	4
Color‐biased Hamilton cycles in random graphs	4
Permutations avoiding a pattern of length three under Mallows distributions	4
Projections of the Aldous chain on binary trees: Intertwining and consistency	4
Random Čech complexes on manifolds with boundary	4
Embedding spanning subgraphs in uniformly dense and inseparable graphs	4
Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes	4
Fast uniform generation of random graphs with given degree sequences	4
Eigenvector delocalization for non‐Hermitian random matrices and applications	4
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon	4
A branching process approach to level‐k phylogenetic networks	4
Holes and islands in random point sets	3
Finding a Hamilton cycle fast on average using rotations and extensions	3
Graphon convergence of random cographs	3
The real tau‐conjecture is true on average	3
On a rainbow extremal problem for color‐critical graphs	3
Learning random points from geometric graphs or orderings	3
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2	3
Sets without k‐term progressions can have many shorter progressions	3
Self‐avoiding walk on the hypercube	3
Recursive functions on conditional Galton‐Watson trees	3
Epidemics on networks with preventive rewiring	3
Tight bounds for popping algorithms	3
On the discrepancy of random low degree set systems	3
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	3
Four‐term progression free sets with three‐term progressions in all large subsets	3
On the discrepancy of random matrices with many columns	3
Node profiles of symmetric digital search trees: Concentration properties	3
On the modularity of 3‐regular random graphs and random graphs with given degree sequences	3
Weighted distances in scale‐free preferential attachment models	3
Factors in randomly perturbed hypergraphs	3
Size of nodal domains of the eigenvectors of a graph	3
Sampling from the low temperature Potts model through a Markov chain on flows	3
Perfect sampling from spatial mixing	3
Information percolation and cutoff for the random‐cluster model	3
Cycle lengths in sparse random graphs	3
Stretched exponential decay for subcritical parking times on	2
Short proofs of some extremal results III	2
On Bollobás‐Riordan random pairing model of preferential attachment graph	2

On edge‐ordered Ramsey numbers	2
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees	2
Shotgun reconstruction in the hypercube	2
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	2
A unified view of graph regularity via matrix decompositions	2
Correlation decay and the absence of zeros property of partition functions	2
Ranking graphs through hitting times of Markov chains	2
Toward characterizing locally common graphs	2
On a problem of M. Talagrand	2
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	2
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process	2
A scaling limit for the length of the longest cycle in a sparse random digraph	2
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis	2
A probabilistic approach to the leader problem in random graphs	2
Clustering and percolation on superpositions of Bernoulli random graphs	2
Constrained percolation, Ising model, and XOR Ising model on planar lattices	2
Erasures versus errors in local decoding and property testing	2
Upper tail for homomorphism counts in constrained sparse random graphs	2
Rainbow trees in uniformly edge‐colored graphs	2
Tree decompositions of graphs without large bipartite holes	2
The Kőnig graph process	2
Phase transition in random intersection graphs with communities	2
Every planar graph with the Liouville property is amenable	2
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2
Vector balancing in Lebesgue spaces	2
Diameter of P.A. random graphs with edge‐step functions	2
Gaussian approximation for rooted edges in a random minimal directed spanning tree	2
The range of once‐reinforced random walk in one dimension	1
Large deviations of the greedy independent set algorithm on sparse random graphs	1
Covering random graphs with monochromatic trees	1
Normal approximation and fourth moment theorems for monochromatic triangles	1
The largest hole in sparse random graphs	1
The component structure of dense random subgraphs of the hypercube	1
Ramsey, Paper, Scissors	1
A lower bound for set‐coloring Ramsey numbers	1
On some graph densities in locally dense graphs	1
Greedy maximal independent sets via local limits	1
Biased random k‐SAT	1
Random perfect matchings in regular graphs	1
Independent sets in hypergraphs omitting an intersection	1
Root estimation in Galton–Watson trees	1
Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process	1
The GHP scaling limit of uniform spanning trees of dense graphs	1
Deviation probabilities for arithmetic progressions and other regular discrete structures	1
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices	1
Approximately counting independent sets in bipartite graphs via graph containers	1
Sharp bounds for the variance of linear statistics on random permutations	1
Random cographs: Brownian graphon limit and asymptotic degree distribution	1
The oriented swap process and last passage percolation	1
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions	1
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence	1
Longest and shortest cycles in random planar graphs	1
Optimal stopping for many connected components in a graph	1
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	1
Hamiltonicity of graphs perturbed by a random regular graph	1
Galton–Watson games	1
A randomized construction of high girth regular graphs	1
Sharp threshold for the Erdős–Ko–Rado theorem	1
Rainbow subdivisions of cliques	1
On subgraphs with degrees of prescribed residues in the random graph	1
The spectral gap of random regular graphs	1
The Swendsen–Wang dynamics on trees	1
Local decoding and testing of polynomials over grids	1
Limit theorems for patterns in ranked tree‐child networks	1
Long paths and connectivity in 1‐independent random graphs	1
Down‐set thresholds	1
Square percolation and the threshold for quadratic divergence in random right‐angled Coxeter groups	1
Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm	1
Uniform chain decompositions and applications	1
The Glauber dynamics for edge‐colorings of trees	1
On the Littlewood‐Offord problem for arbitrary distributions	1
Hypergraph Ramsey numbers of cliques versus stars	1
Subcritical monotone cellular automata	1
Approximating sparse graphs: The random overlapping communities model	1
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes	1
Topological embeddings into random 2‐complexes	1
Doubly random polytopes	1
Compaction for two models of logarithmic‐depth trees: Analysis and experiments	1
Broadcasting‐induced colorings of preferential attachment trees	1
Hypergraph regularity and random sampling	1

Note on down‐set thresholds	0
Iterated tour partitioning for Euclidean capacitated vehicle routing	0
Issue Information	0
Majority dynamics on sparse random graphs	0
Issue Information	0
	0
	0
Issue Information	0
Absence of percolation in graphs based on stationary point processes with degrees bounded by two	0
Moderate deviations in cycle count	0
Issue Information	0
The infinite limit of separable permutations	0
	0
On the probabilistic degree of OR over the reals	0
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs	0
	0
	0
	0
	0
Covering cycles in sparse graphs	0
Tight bounds on the expected number of holes in random point sets	0
The number of perfect matchings, and the nesting properties, of random regular graphs	0
On pattern‐avoiding permutons	0
Site percolation on pseudo‐random graphs	0
Small cycle structure for words in conjugation invariant random permutations	0
Sharp thresholds in adaptive random graph processes	0
A simple algorithm for graph reconstruction	0
Asymptotic behavior of some factorizations of random words	0
Ramsey games near the critical threshold	0
Natural quasirandomness properties	0
	0
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow	0
Issue Information	0
Smoothed counting of 0–1 points in polyhedra	0
A greedy chip‐firing game	0
The jump of the clique chromatic number of random graphs	0
Limiting probabilities of first order properties of random sparse graphs and hypergraphs	0
Efficiently list‐edge coloring multigraphs asymptotically optimally	0
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel	0
Mixing times of Markov chains for self‐organizing lists and biased permutations	0
Reversible random walks on dynamic graphs	0
Issue Information	0
Successive minimum spanning trees	0
Algebraic and combinatorial expansion in random simplicial complexes	0
Issue information	0
Avoidance couplings on non‐complete graphs	0
The height of record‐biased trees	0
Successive shortest paths in complete graphs with random edge weights	0
Dixon's asymptotic without the classification of finite simple groups	0
	0
Community modulated recursive trees and population dependent branching processes	0
Issue Information	0
Heilbronn triangle‐type problems in the unit square [0,1]2	0
	0
	0
Hamilton transversals in random Latin squares	0
	0
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	0
Counting orientations of random graphs with no directed k‐cycles	0
	0
Growing uniform planar maps face by face	0
Issue information	0
Long cycle of random permutations with polynomially growing cycle weights	0
Issue Information	0
	0
Issue Information	0
	0
	0
1‐independent percolation on ℤ2×Kn	0
Issue Information	0
The rank of sparse random matrices	0
Matchings on trees and the adjacency matrix: A determinantal viewpoint	0
On the minimax spherical designs	0
The Erlang weighted tree, a new branching process	0
Issue information	0
	0
	0
	0
Issue Information	0
Multirange percolation on oriented trees: Critical curve and limit behavior	0
	0
	0
Corrigendum to “Online purchasing under uncertainty”	0
	0
Packing list‐colorings	0
Issue Information	0
Independence number of hypergraphs under degree conditions	0
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures	0
	0
	0
Extremal results on feedback arc sets in digraphs	0
Universality of superconcentration in the Sherrington–Kirkpatrick model	0
	0
Concentration estimates for functions of finite high‐dimensional random arrays	0
	0