OOIR: Observatory of International Research

Papers

(The TQCC of Random Structures & Algorithms is 2. 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 2020-05-01 to 2024-05-01.)

Article	Citations
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu	20
Fast algorithms at low temperatures via Markov chains†	16
Combinatorial and stochastic properties of ranked tree‐child networks	15
Seeded graph matching via large neighborhood statistics	14
Dynamic concentration of the triangle‐free process	13
Invertibility via distance for noncentered random matrices with continuous distributions	10
Community detection in the sparse hypergraph stochastic block model	9
Coloring triangle‐free graphs with local list sizes	9
Outliers in spectrum of sparse Wigner matrices	9
Rapid mixing of the switch Markov chain for strongly stable degree sequences	9
Characterization of quasirandom permutations by a pattern sum	9
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs	8
Colorings, transversals, and local sparsity	8
On‐line balancing of random inputs	7
Phase transition for the volume of high‐dimensional random polytopes	7
Quasirandom Latin squares	6
Approximating the distance to monotonicity of Boolean functions	6
On the upper tail problem for random hypergraphs	6
Existence thresholds and Ramsey properties of random posets	6
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	6
A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph	6
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels	6
Vertex Ramsey properties of randomly perturbed graphs	6
Fractional cycle decompositions in hypergraphs	5
Superconcentration in surface growth	5

Random triangles in random graphs	5
Mixing time of PageRank surfers on sparse random digraphs	5
A branching process approach to level‐k phylogenetic networks	5
The size‐Ramsey number of short subdivisions	5
Site percolation and isoperimetric inequalities for plane graphs	5
Fast uniform generation of random graphs with given degree sequences	5
Graphon convergence of random cographs	4
The discrepancy of random rectangular matrices	4
Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes	4
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	4
Clustering and percolation on superpositions of Bernoulli random graphs	4
The number of satisfying assignments of random 2‐SAT formulas	4
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon	4
Embedding spanning subgraphs in uniformly dense and inseparable graphs	4
Permutations avoiding a pattern of length three under Mallows distributions	4
Finitary codings for gradient models and a new graphical representation for the six‐vertex model	4
Cycle lengths in sparse random graphs	4
Random Čech complexes on manifolds with boundary	4
Weighted distances in scale‐free preferential attachment models	4
Color‐biased Hamilton cycles in random graphs	4
Sharpness of the phase transition for parking on random trees	4
Projections of the Aldous chain on binary trees: Intertwining and consistency	4
Holes and islands in random point sets	3
Short proofs of some extremal results III	3
Epidemics on networks with preventive rewiring	3
The real tau‐conjecture is true on average	3
On the discrepancy of random low degree set systems	3
Information percolation and cutoff for the random‐cluster model	3
Upper tail for homomorphism counts in constrained sparse random graphs	3
Self‐avoiding walk on the hypercube	3
On the modularity of 3‐regular random graphs and random graphs with given degree sequences	3
Factors in randomly perturbed hypergraphs	3
Sampling from the low temperature Potts model through a Markov chain on flows	3
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2	3
Four‐term progression free sets with three‐term progressions in all large subsets	3
Node profiles of symmetric digital search trees: Concentration properties	3
The largest hole in sparse random graphs	3
Rainbow trees in uniformly edge‐colored graphs	3
Tight bounds for popping algorithms	3
On a rainbow extremal problem for color‐critical graphs	3
Perfect sampling from spatial mixing	3
Sets without k‐term progressions can have many shorter progressions	3
Random cographs: Brownian graphon limit and asymptotic degree distribution	2
Ranking graphs through hitting times of Markov chains	2
Correlation decay and the absence of zeros property of partition functions	2
Diameter of P.A. random graphs with edge‐step functions	2
Rainbow subdivisions of cliques	2
Stretched exponential decay for subcritical parking times on	2
Voter models on subcritical scale‐free random graphs	2
Sharp threshold for the Erdős–Ko–Rado theorem	2

Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process	2
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees	2
A probabilistic approach to the leader problem in random graphs	2
Phase transition in random intersection graphs with communities	2
A unified view of graph regularity via matrix decompositions	2
Erasures versus errors in local decoding and property testing	2
Vector balancing in Lebesgue spaces	2
Toward characterizing locally common graphs	2
Subcritical monotone cellular automata	2
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	2
Approximating sparse graphs: The random overlapping communities model	2
Every planar graph with the Liouville property is amenable	2
The Kőnig graph process	2
Shotgun reconstruction in the hypercube	2
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2
Constrained percolation, Ising model, and XOR Ising model on planar lattices	2
Limit theorems for patterns in ranked tree‐child networks	2
Gaussian approximation for rooted edges in a random minimal directed spanning tree	2
Random perfect matchings in regular graphs	2
On a problem of M. Talagrand	2
Long paths and connectivity in 1‐independent random graphs	2
On Bollobás‐Riordan random pairing model of preferential attachment graph	2
On edge‐ordered Ramsey numbers	2
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis	2
A scaling limit for the length of the longest cycle in a sparse random digraph	2
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	2