OOIR: Observatory of International Research

Papers

(The TQCC of Random Structures & Algorithms is 1. 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-03-01 to 2025-03-01.)

Article	Citations
	15
	10
Vector balancing in Lebesgue spaces	8
Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm	8
The height of record‐biased trees	7
Multirange percolation on oriented trees: Critical curve and limit behavior	7
Issue Information	7
Reconstructing Random Pictures	6
On Rainbow Thresholds	6
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions	6
Large induced subgraphs of random graphs with given degree sequences	6
Detection of Dense Subhypergraphs by Low‐Degree Polynomials	6
Randomly Twisted Hypercubes: Between Structure and Randomness	6
Ramsey numbers of cycles in random graphs	5
	5
Gaussian approximation for rooted edges in a random minimal directed spanning tree	5
Algebraic and combinatorial expansion in random simplicial complexes	5
Upper Bounds for Linear Graph Codes	5
Down‐set thresholds	5
	5
Natural quasirandomness properties	5
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs	5
Random cographs: Brownian graphon limit and asymptotic degree distribution	5
Extremal results on feedback arc sets in digraphs	4
Hypergraph regularity and random sampling	4

A simple algorithm for graph reconstruction	4
Large deviations of the greedy independent set algorithm on sparse random graphs	4
	4
Cycle lengths in sparse random graphs	4
The Erlang weighted tree, a new branching process	4
Issue Information	4
Small cycle structure for words in conjugation invariant random permutations	4
Four‐term progression free sets with three‐term progressions in all large subsets	4
Absence of percolation in graphs based on stationary point processes with degrees bounded by two	4
Note on down‐set thresholds	3
Limit theorems for patterns in ranked tree‐child networks	3
Correlation decay and the absence of zeros property of partition functions	3
The rank of sparse random matrices	3
Normal approximation and fourth moment theorems for monochromatic triangles	3
Erasures versus errors in local decoding and property testing	3
Approximately counting independent sets in bipartite graphs via graph containers	3
	3
The infinite limit of separable permutations	3
A unified view of graph regularity via matrix decompositions	3
Random triangles in random graphs	3
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	3
Combinatorial and stochastic properties of ranked tree‐child networks	3
Issue Information	2
Deviation probabilities for arithmetic progressions and other regular discrete structures	2
The number of perfect matchings, and the nesting properties, of random regular graphs	2
Efficiently list‐edge coloring multigraphs asymptotically optimally	2
Issue Information	2
The Swendsen–Wang dynamics on trees	2
Limiting probabilities of first order properties of random sparse graphs and hypergraphs	2
Packing list‐colorings	2
Efficient sampling and counting algorithms for the Potts model on ℤ^d at all temperatures	2
Phase transition in random intersection graphs with communities	2
	2
Reversible random walks on dynamic graphs	2
Shotgun reconstruction in the hypercube	2
On the minimax spherical designs	2
Spanning cycles in random directed graphs	2
	2
The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2	2
On the typical structure of graphs not containing a fixed vertex‐critical subgraph	2
Corrigendum to “Online purchasing under uncertainty”	2
Colorings, transversals, and local sparsity	2
	1
Community modulated recursive trees and population dependent branching processes	1
A branching process approach to level‐k phylogenetic networks	1
Fast uniform generation of random graphs with given degree sequences	1
	1
Successive minimum spanning trees	1
On Sequences With Exponentially Distributed Gaps	1
Partitioning graphs with linear minimum degree	1

Issue Information	1
The rank of sparse symmetric matrices over arbitrary fields	1
Issue Information	1
Perfect sampling from spatial mixing	1
Weight distribution of random linear codes and Krawtchouk polynomials	1
Superconcentration in surface growth	1
The hitting time of clique factors	1
Independence number of hypergraphs under degree conditions	1
	1
	1
Covering cycles in sparse graphs	1
A scaling limit for the length of the longest cycle in a sparse random digraph	1
Independent sets in hypergraphs omitting an intersection	1
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	1
1‐independent percolation on ℤ2×Kn	1
On subgraphs with degrees of prescribed residues in the random graph	1
Galton–Watson games	1
Issue Information	1
Issue Information	1
Improved Bounds for the Erdős–Rogers (s,s+2)‐Problem	1
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	1
Issue Information	1
Issue Information	1
Site percolation on pseudo‐random graphs	1
Issue Information	1
	1
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow	1
Issue Information	1
Issue Information	1
	1
Sharpness of the phase transition for parking on random trees	1
Compaction for two models of logarithmic‐depth trees: Analysis and experiments	1
Universality of superconcentration in the Sherrington–Kirkpatrick model	1
Finitary codings for gradient models and a new graphical representation for the six‐vertex model	1
Hypergraph Ramsey numbers of cliques versus stars	1
Quasi‐majority functional voting on expander graphs	1
Mixing times of Markov chains for self‐organizing lists and biased permutations	1
Clustering and percolation on superpositions of Bernoulli random graphs	1
	1
The “Power of Few” Phenomenon: The Sparse Case	1
Increasing subsequences of linear size in random permutations and the Robinson–Schensted tableaux of permutons	1
Dixon's asymptotic without the classification of finite simple groups	1
	1
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	1
	1
Issue Information	1
A greedy chip‐firing game	1