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-11-01 to 2024-11-01.)

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
Colorings, transversals, and local sparsity	8
Approximating the distance to monotonicity of Boolean functions	8
On the upper tail problem for random hypergraphs	7
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	7
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
Fractional cycle decompositions in hypergraphs	6
A branching process approach to level‐k phylogenetic networks	6
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
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
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
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
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
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
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
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
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