Random Structures & Algorithms

Article	Citations
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu	21
Dynamic concentration of the triangle‐free process	16
Combinatorial and stochastic properties of ranked tree‐child networks	15
Outliers in spectrum of sparse Wigner matrices	11
Community detection in the sparse hypergraph stochastic block model	10
Approximating the distance to monotonicity of Boolean functions	8
Colorings, transversals, and local sparsity	8
A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph	7
Fast uniform generation of random graphs with given degree sequences	7
Phase transition for the volume of high‐dimensional random polytopes	7
On the upper tail problem for random hypergraphs	7
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	7
Mixing time of PageRank surfers on sparse random digraphs	6
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels	6
Quasirandom Latin squares	6
Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes	6
Fractional cycle decompositions in hypergraphs	6
A branching process approach to level‐k phylogenetic networks	6
Clustering and percolation on superpositions of Bernoulli random graphs	5
Random triangles in random graphs	5
The size‐Ramsey number of short subdivisions	5
Permutations avoiding a pattern of length three under Mallows distributions	5
Finitary codings for gradient models and a new graphical representation for the six‐vertex model	5
Vector balancing in Lebesgue spaces	5
Holes and islands in random point sets	5

Epidemics on networks with preventive rewiring	5
Superconcentration in surface growth	5
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	5
The number of satisfying assignments of random 2‐SAT formulas	5
Color‐biased Hamilton cycles in random graphs	5
Upper tail for homomorphism counts in constrained sparse random graphs	4
Rainbow trees in uniformly edge‐colored graphs	4
The discrepancy of random rectangular matrices	4
Sharp threshold for the Erdős–Ko–Rado theorem	4
Cycle lengths in sparse random graphs	4
Random Čech complexes on manifolds with boundary	4
Graphon convergence of random cographs	4
On a rainbow extremal problem for color‐critical graphs	4
Sharpness of the phase transition for parking on random trees	4
The largest hole in sparse random graphs	4
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	4
Sampling from the low temperature Potts model through a Markov chain on flows	4
Perfect sampling from spatial mixing	4
Self‐avoiding walk on the hypercube	3
Factors in randomly perturbed hypergraphs	3
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2	3
Erasures versus errors in local decoding and property testing	3
Subcritical monotone cellular automata	3
On the modularity of 3‐regular random graphs and random graphs with given degree sequences	3
Approximating sparse graphs: The random overlapping communities model	3
A unified view of graph regularity via matrix decompositions	3
Sets without k‐term progressions can have many shorter progressions	3
Node profiles of symmetric digital search trees: Concentration properties	3
Voter models on subcritical scale‐free random graphs	3
The Swendsen–Wang dynamics on trees	3
Approximately counting independent sets in bipartite graphs via graph containers	3
Four‐term progression free sets with three‐term progressions in all large subsets	3
Toward characterizing locally common graphs	3
The upper tail problem for induced 4‐cycles in sparse random graphs	2
Random perfect matchings in regular graphs	2
On Bollobás‐Riordan random pairing model of preferential attachment graph	2
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees	2
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2
Normal approximation and fourth moment theorems for monochromatic triangles	2
The infinite limit of separable permutations	2
Gaussian approximation for rooted edges in a random minimal directed spanning tree	2
On a problem of M. Talagrand	2
Stretched exponential decay for subcritical parking times on	2
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices	2
On some graph densities in locally dense graphs	2
A scaling limit for the length of the longest cycle in a sparse random digraph	2
Phase transition in random intersection graphs with communities	2
The component structure of dense random subgraphs of the hypercube	2
Limit theorems for patterns in ranked tree‐child networks	2
Ranking graphs through hitting times of Markov chains	2

Rainbow subdivisions of cliques	2
Root estimation in Galton–Watson trees	2
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence	2
Tight bounds on the expected number of holes in random point sets	2
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	2
Shotgun reconstruction in the hypercube	2
Correlation decay and the absence of zeros property of partition functions	2
Random cographs: Brownian graphon limit and asymptotic degree distribution	2
Compaction for two models of logarithmic‐depth trees: Analysis and experiments	1
Down‐set thresholds	1
A randomized construction of high girth regular graphs	1
Site percolation on pseudo‐random graphs	1
Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm	1
Tuza's conjecture for random graphs	1
Deviation probabilities for arithmetic progressions and other regular discrete structures	1
The oriented swap process and last passage percolation	1
On random irregular subgraphs	1
The rank of sparse random matrices	1
Uniform chain decompositions and applications	1
Absence of percolation in graphs based on stationary point processes with degrees bounded by two	1
A Ramsey–Turán theory for tilings in graphs	1
On breadth‐first constructions of scaling limits of random graphs and random unicellular maps	1
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	1
Hamiltonicity of graphs perturbed by a random regular graph	1
Sharp thresholds in adaptive random graph processes	1
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes	1
Hypergraph Ramsey numbers of cliques versus stars	1
Biased random k‐SAT	1
Clique minors in graphs with a forbidden subgraph	1
Increasing subsequences of linear size in random permutations and the Robinson–Schensted tableaux of permutons	1
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions	1
Doubly random polytopes	1
Topological embeddings into random 2‐complexes	1
Covering random graphs with monochromatic trees	1
Packing list‐colorings	1
Expansion of random 0/1 polytopes	1
Issue Information	1
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	1
Cycles with many chords	1
A lower bound for set‐coloring Ramsey numbers	1
Longest and shortest cycles in random planar graphs	1
Kemeny's constant for nonbacktracking random walks	1
Heilbronn triangle‐type problems in the unit square [0,1]2	1
Reinforced Galton–Watson processes I: Malthusian exponents	1
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel	1
1‐independent percolation on ℤ2×Kn	1
The spectral gap of random regular graphs	1
Independent sets in hypergraphs omitting an intersection	1
Hypergraph regularity and random sampling	1
Greedy maximal independent sets via local limits	1
Limiting probabilities of first order properties of random sparse graphs and hypergraphs	1
The height of record‐biased trees	1
Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models	1
On subgraphs with degrees of prescribed residues in the random graph	1
Square percolation and the threshold for quadratic divergence in random right‐angled Coxeter groups	1
Algebraic and combinatorial expansion in random simplicial complexes	1
A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs	1
Weakly saturated random graphs	1
Large deviations of the greedy independent set algorithm on sparse random graphs	1
A robust Corrádi–Hajnal theorem	1
Optimal stopping for many connected components in a graph	1
On the Littlewood‐Offord problem for arbitrary distributions	1
Counting extensions revisited	1
Majority dynamics on sparse random graphs	1
The GHP scaling limit of uniform spanning trees of dense graphs	1
Galton–Watson games	1
Hamilton transversals in random Latin squares	1
Broadcasting‐induced colorings of preferential attachment trees	1
Prominent examples of flip processes	0
Efficiently list‐edge coloring multigraphs asymptotically optimally	0
The jump of the clique chromatic number of random graphs	0
Issue Information	0
The Moran forest	0
On the typical structure of graphs not containing a fixed vertex‐critical subgraph	0
Growing uniform planar maps face by face	0
Avoidance couplings on non‐complete graphs	0
Issue Information	0
Small cycle structure for words in conjugation invariant random permutations	0
Issue Information	0
Successive minimum spanning trees	0

Haystack hunting hints and locker room communication	0
Note on down‐set thresholds	0
Issue Information	0
	0
Issue Information	0
	0
An asymmetric random Rado theorem for single equations: The 0‐statement	0
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs	0
Mixing times of Markov chains for self‐organizing lists and biased permutations	0
The “Power of Few” Phenomenon: The Sparse Case	0
Multirange percolation on oriented trees: Critical curve and limit behavior	0
Spanning cycles in random directed graphs	0
	0
The hitting time of clique factors	0
Issue Information	0
The asynchronous DeGroot dynamics	0
	0
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures	0
Iterated tour partitioning for Euclidean capacitated vehicle routing	0
Issue Information	0
Issue Information	0
Universality of superconcentration in the Sherrington–Kirkpatrick model	0
Issue Information	0
A down‐up chain with persistent labels on multifurcating trees	0
Upper Bounds for Linear Graph Codes	0
	0
Testing linear inequalities of subgraph statistics	0
Reversible random walks on dynamic graphs	0
	0
	0
Issue Information	0
Long cycle of random permutations with polynomially growing cycle weights	0
Concentration estimates for functions of finite high‐dimensional random arrays	0
Issue Information	0
	0
	0
	0
The impact of heterogeneity and geometry on the proof complexity of random satisfiability	0
The Erlang weighted tree, a new branching process	0
Matchings on trees and the adjacency matrix: A determinantal viewpoint	0
Coboundary expansion for the union of determinantal hypertrees	0
Corrigendum to “Online purchasing under uncertainty”	0
On Sequences With Exponentially Distributed Gaps	0
The number of bounded‐degree spanning trees	0
	0
Issue Information	0
Issue Information	0
	0
The rank of sparse symmetric matrices over arbitrary fields	0
Weight distribution of random linear codes and Krawtchouk polynomials	0
The number of perfect matchings, and the nesting properties, of random regular graphs	0
Counting orientations of random graphs with no directed k‐cycles	0
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow	0
	0
	0
A greedy chip‐firing game	0
Ramsey numbers of cycles in random graphs	0
	0
Issue Information	0
Spatial mixing and the random‐cluster dynamics on lattices	0
	0
	0
Counting independent sets in graphs with bounded bipartite pathwidth	0
Issue Information	0
	0
On the probabilistic degree of OR over the reals	0
	0
	0
Community modulated recursive trees and population dependent branching processes	0
	0
Issue Information	0
Extremal results on feedback arc sets in digraphs	0
	0
Cycle lengths in randomly perturbed graphs	0
A simple algorithm for graph reconstruction	0
Moderate deviations in cycle count	0
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees	0
	0
Quasi‐majority functional voting on expander graphs	0
Issue Information	0
Natural quasirandomness properties	0
On the minimax spherical designs	0
	0
Dixon's asymptotic without the classification of finite simple groups	0
Asymptotic behavior of some factorizations of random words	0
Independence number of hypergraphs under degree conditions	0
	0
Smoothed counting of 0–1 points in polyhedra	0
	0
Covering cycles in sparse graphs	0
Partitioning graphs with linear minimum degree	0
	0
Three‐wise independent random walks can be slightly unbounded	0
Large induced subgraphs of random graphs with given degree sequences	0
On pattern‐avoiding permutons	0