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

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
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
Coloring triangle‐free graphs with local list sizes	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
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
Fractional cycle decompositions in hypergraphs	5
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
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
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
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 edge‐ordered Ramsey numbers	2
Toward characterizing locally common graphs	2
Shotgun reconstruction in the hypercube	2

On a problem of M. Talagrand	2
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	2
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	2
A unified view of graph regularity via matrix decompositions	2
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process	2
Correlation decay and the absence of zeros property of partition functions	2
Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis	2
Ranking graphs through hitting times of Markov chains	2
A scaling limit for the length of the longest cycle in a sparse random digraph	2
Upper tail for homomorphism counts in constrained sparse random graphs	2
A probabilistic approach to the leader problem in random graphs	2
Rainbow trees in uniformly edge‐colored graphs	2
Clustering and percolation on superpositions of Bernoulli random graphs	2
Tree decompositions of graphs without large bipartite holes	2
Constrained percolation, Ising model, and XOR Ising model on planar lattices	2
The Kőnig graph process	2
Erasures versus errors in local decoding and property testing	2
Every planar graph with the Liouville property is amenable	2
Phase transition in random intersection graphs with communities	2
Stretched exponential decay for subcritical parking times on	2
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth	2
Short proofs of some extremal results III	2
Vector balancing in Lebesgue spaces	2
On Bollobás‐Riordan random pairing model of preferential attachment graph	2
Diameter of P.A. random graphs with edge‐step functions	2
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees	2
Gaussian approximation for rooted edges in a random minimal directed spanning tree	2