Random Structures & Algorithms

Papers
(The median citation count of Random Structures & Algorithms is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-07-01 to 2025-07-01.)
ArticleCitations
Large deviations of the greedy independent set algorithm on sparse random graphs19
A simple algorithm for graph reconstruction9
Down‐set thresholds9
The Erlang weighted tree, a new branching process8
Note on down‐set thresholds7
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs7
7
Small cycle structure for words in conjugation invariant random permutations7
The hitting time of clique factors6
6
Issue Information6
Deviation probabilities for arithmetic progressions and other regular discrete structures6
6
6
Issue Information6
On subgraphs with degrees of prescribed residues in the random graph6
Majority dynamics on sparse random graphs5
Packing list‐colorings5
Color‐biased Hamilton cycles in random graphs5
Issue Information5
A branching process approach to level‐k phylogenetic networks5
Independent sets in hypergraphs omitting an intersection5
Weight distribution of random linear codes and Krawtchouk polynomials5
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity5
5
Dispersion on the Complete Graph5
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs4
Three‐wise independent random walks can be slightly unbounded4
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree4
Issue Information4
4
On Sidorenko's conjecture for determinants and Gaussian Markov random fields4
4
Issue Information4
Greedy maximal independent sets via local limits3
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT3
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture3
Almost‐Linear Planted Cliques Elude the Metropolis Process3
The devil's staircase for chip‐firing on random graphs and on graphons3
Equivalent regular partitions of three‐uniform hypergraphs3
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs3
Fractional cycle decompositions in hypergraphs3
Random Algebraic Graphs and Their Convergence to ErdőS–Rényi3
Issue Information3
The discrepancy of random rectangular matrices3
3
Epidemics on networks with preventive rewiring3
Optimal bisections of directed graphs3
The birth of the strong components3
Rainbow subdivisions of cliques3
A Ramsey–Turán theory for tilings in graphs3
Testing versus estimation of graph properties, revisited3
The square of a Hamilton cycle in randomly perturbed graphs3
Asymptotically Optimal Proper Conflict‐Free Coloring2
The number of descendants in a random directed acyclic graph2
Mixing times of Markov chains for self‐organizing lists and biased permutations2
A lower bound for set‐coloring Ramsey numbers2
Uniform chain decompositions and applications2
Counting orientations of random graphs with no directed k‐cycles2
2
The asynchronous DeGroot dynamics2
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow2
2
Combinatorial and stochastic properties of ranked tree‐child networks2
The rank of sparse random matrices2
Spanning cycles in random directed graphs2
2
Longest and shortest cycles in random planar graphs2
Expansion in supercritical random subgraphs of expanders and its consequences2
The impact of heterogeneity and geometry on the proof complexity of random satisfiability2
Iterated tour partitioning for Euclidean capacitated vehicle routing2
Covering cycles in sparse graphs2
2
Hypergraph regularity and random sampling2
Separating Path Systems in Complete Graphs2
Issue Information2
On the Replica Symmetric Solution in General Diluted Spin Glasses2
2
Issue Information2
Partitioning graphs with linear minimum degree2
Coloring Graphs With Forbidden Almost Bipartite Subgraphs2
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs2
2
Issue Information2
On the minimax spherical designs1
Natural quasirandomness properties1
Random Čech complexes on manifolds with boundary1
Issue Information1
Cover and hitting times of hyperbolic random graphs1
Covering random graphs with monochromatic trees1
1
Randomly Twisted Hypercubes: Between Structure and Randomness1
Asymptotic behavior of some factorizations of random words1
Reconstructing Random Pictures1
Matchings on trees and the adjacency matrix: A determinantal viewpoint1
The Swendsen–Wang dynamics on trees1
Quasi‐majority functional voting on expander graphs1
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model1
A combinatorial proof of Aldous–Broder theorem for general Markov chains1
Expansion and flooding in dynamic random networks with node churn1
A full characterization of invariant embeddability of unimodular planar graphs1
Rainbow trees in uniformly edge‐colored graphs1
Erasures versus errors in local decoding and property testing1
Limit theorems for patterns in ranked tree‐child networks1
Upper Bounds for Linear Graph Codes1
Gaussian approximation for rooted edges in a random minimal directed spanning tree1
The “Power of Few” Phenomenon: The Sparse Case1
Colorings, transversals, and local sparsity1
Issue Information1
On the rank, Kernel, and core of sparse random graphs1
Improved Bounds for the Erdős–Rogers (s,s+2)‐Problem1
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors1
Cycle lengths in sparse random graphs1
Frozen 1‐RSB structure of the symmetric Ising perceptron1
Square percolation and the threshold for quadratic divergence in random right‐angled Coxeter groups1
1
On the clique number of noisy random geometric graphs1
A robust Corrádi–Hajnal theorem1
Ramsey numbers of cycles in random graphs1
1
1
The rank of sparse symmetric matrices over arbitrary fields1
Improving the Convergence of Markov Chains via Permutations and Projections1
Perfect sampling from spatial mixing1
Issue Information1
Broadcasting‐induced colorings of preferential attachment trees0
Four‐term progression free sets with three‐term progressions in all large subsets0
Vector balancing in Lebesgue spaces0
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions0
Connectivity graph‐codes0
Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure0
Correlation decay and the absence of zeros property of partition functions0
Subcritical monotone cellular automata0
On the largest part size of low‐rank combinatorial assemblies0
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves0
On pattern‐avoiding permutons0
Issue Information0
The Spectral Edge of Constant Degree Erdős–Rényi Graphs0
Weakly saturated random graphs0
Hyperbolic Site Percolation0
Ramsey goodness of trees in random graphs0
The largest hole in sparse random graphs0
Coloring lines and Delaunay graphs with respect to boxes0
Issue Information0
A Sharp Threshold for a Random Version of Sperner's Theorem0
Coloring Graphs From Random Lists0
Coupling Bertoin's and Aldous–Pitman's representations of the additive coalescent0
What is the satisfiability threshold of random balanced Boolean expressions?0
Haystack hunting hints and locker room communication0
Wireless random‐access networks with bipartite interference graphs0
Issue Information0
Issue Information0
Voter models on subcritical scale‐free random graphs0
Rainbow Hamilton cycles in random geometric graphs0
Independence number of hypergraphs under degree conditions0
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs0
Sharpness of the phase transition for parking on random trees0
Percolation critical probabilities of matching lattice‐pairs0
Algebraic and combinatorial expansion in random simplicial complexes0
On Sequences With Exponentially Distributed Gaps0
An asymmetric random Rado theorem for single equations: The 0‐statement0
0
Limiting probabilities of first order properties of random sparse graphs and hypergraphs0
Issue Information0
The oriented swap process and last passage percolation0
0
Unambiguous Parity‐Query Complexity0
On the typical structure of graphs not containing a fixed vertex‐critical subgraph0
DP‐Coloring of Graphs From Random Covers0
Approximately counting independent sets in bipartite graphs via graph containers0
Issue Information0
Efficiently list‐edge coloring multigraphs asymptotically optimally0
Issue Information0
Issue Information0
Typical Structure of Hereditary Graph Families. II. Exotic Examples0
Self‐avoiding walk on the hypercube0
Finitary codings for gradient models and a new graphical representation for the six‐vertex model0
On random irregular subgraphs0
Tight bounds on the expected number of holes in random point sets0
Twin‐width of random graphs0
On a problem of M. Talagrand0
On powers of tight Hamilton cycles in randomly perturbed hypergraphs0
Weak Randomness in Graphons and Theons0
Cycle lengths in randomly perturbed graphs0
Issue Information0
Issue Information0
Issue Information0
Factors in randomly perturbed hypergraphs0
The Moran Process on a Random Graph0
Doubly random polytopes0
Defective coloring of hypergraphs0
The number of bounded‐degree spanning trees0
On breadth‐first constructions of scaling limits of random graphs and random unicellular maps0
Issue Information0
Tuza's conjecture for random graphs0
0
Sharp threshold for the Erdős–Ko–Rado theorem0
Detection of Dense Subhypergraphs by Low‐Degree Polynomials0
Increasing subsequences of linear size in random permutations and the Robinson–Schensted tableaux of permutons0
Approximating sparse graphs: The random overlapping communities model0
On a rainbow extremal problem for color‐critical graphs0
A Bayesian Proof of the Spread Lemma0
Phase transition in random intersection graphs with communities0
Reversible random walks on dynamic graphs0
The height of record‐biased trees0
0
0
Holes and islands in random point sets0
On Rainbow Thresholds0
Issue Information0
Multirange percolation on oriented trees: Critical curve and limit behavior0
Toward characterizing locally common graphs0
Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes0
0
Reinforced Galton–Watson processes I: Malthusian exponents0
Random cographs: Brownian graphon limit and asymptotic degree distribution0
The number of perfect matchings, and the nesting properties, of random regular graphs0
Counting extensions revisited0
Hamilton transversals in random Latin squares0
Percolation on High‐Dimensional Product Graphs0
Restart Perturbations for Reversible Markov Chains: Trichotomy and Pre‐Cutoff Equivalence0
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs0
Asymmetric Ramsey properties of random graphs involving cliques and cycles0
The spectral gap of random regular graphs0
A Jump of the Saturation Number in Random Graphs?0
Existence of stationary ballistic deposition on the infinite lattice0
Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes0
Fluctuation Bounds for the Restricted Solid‐On‐Solid Model of Surface Growth0
Central limit theorem in disordered Monomer‐Dimer model0
Random graphs embeddable in order‐dependent surfaces0
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees0
0
0
Extremal results on feedback arc sets in digraphs0
Quasirandom Latin squares0
0
0
0
Superconcentration in surface growth0
Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel0
Absence of percolation in graphs based on stationary point processes with degrees bounded by two0
Issue Information0
1‐independent percolation on ℤ2×Kn0
A down‐up chain with persistent labels on multifurcating trees0
A unified view of graph regularity via matrix decompositions0
Isoperimetric inequalities for real‐valued functions with applications to monotonicity testing0
0
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs0
Efficient sampling and counting algorithms for the Potts model on d at all temperatures0
Large induced subgraphs of random graphs with given degree sequences0
0.092895984649658