default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 66
Volume 66, Number 1, January 2025
Research Article
- Geoffrey R. Grimmett
, Zhongyang Li:
Hyperbolic Site Percolation. - Itai Benjamini, Yotam Dikstein, Renan Gross, Maksim Zhukovskii:
Randomly Twisted Hypercubes: Between Structure and Randomness. - Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou:
Dispersion on the Complete Graph. - Alberto Espuny Díaz, António Girão, Bertille Granet, Gal Kronenberg:
Seymour's second neighbourhood conjecture: random graphs and reductions. - Ben Green, Freddie Manners, Terence Tao:
Sumsets and entropy revisited. - Pedro Araújo, Matías Pavez-Signé, Nicolás Sanhueza-Matamala:
Ramsey numbers of cycles in random graphs. - Angus Southwell, Nick Wormald:
Large induced subgraphs of random graphs with given degree sequences. - Viktor Kiss, Lionel Levine, Lilla Tóthmérész:
The devil's staircase for chip-firing on random graphs and on graphons. - Wai-Kit Lam, Arnab Sen:
Central limit theorem in disordered Monomer-Dimer model. - Shu Kanazawa, Khanh Duy Trinh:
Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes. - Remco van der Hofstad, Noëla Müller, Haodong Zhu:
The rank of sparse symmetric matrices over arbitrary fields. - József Balogh, Robert A. Krueger:
A Sharp Threshold for a Random Version of Sperner's Theorem. - BaoLinh Tran, Van Vu:
The "Power of Few" Phenomenon: The Sparse Case. - Leonardo Nagami Coregliano, Maryanthe Malliaris:
Weak Randomness in Graphons and Theons. - Leo Versteegen:
Upper Bounds for Linear Graph Codes. - Marta Milewska, Remco van der Hofstad, Bert Zwart:
Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure. - Christoph Aistleitner, Manuel Hauke, Agamemnon Zafeiropoulos:
On Sequences With Exponentially Distributed Gaps. - Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on High-Dimensional Product Graphs. - António Girão, Robert Hancock:
Immersions of Directed Graphs in Tournaments.
Volume 66, Number 2, March 2025
Research Article
- Yahav Alon, Michael Anastos:
The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs. - Michael Molloy, Pawel Pralat, Gregory B. Sorkin:
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model. - Zongchen Chen, Elchanan Mossel, Ilias Zadik:
Almost-Linear Planted Cliques Elude the Metropolis Process. - Anton Bernshteyn, Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock:
DP-Coloring of Graphs From Random Covers.
Volume 66, Number 3, 2025
- Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala:
Separating Path Systems in Complete Graphs. - Chun-Hung Liu, Bruce Reed:
Asymptotically Optimal Proper Conflict-Free Coloring. - Daniel Vial, Vijay G. Subramanian:
Restart Perturbations for Reversible Markov Chains: Trichotomy and Pre-Cutoff Equivalence. - Alan M. Frieze, Wesley Pegden:
The Moran Process on a Random Graph. - Timothy Sudijono:
Fluctuation Bounds for the Restricted Solid-On-Solid Model of Surface Growth. - Seonghyuk Im, Jaehoon Kim, Hyunwoo Lee, Haesong Seo:
On Rainbow Turán Densities of Trees. - Ella Hiesmayr, Theo McKenzie:
The Spectral Edge of Constant Degree Erdős-Rényi Graphs. - Dmitry Gavinsky:
Unambiguous Parity-Query Complexity.
Volume 66, Number 4, 2025
- Paul Bastide, Carla Groenland:
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles. - Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson:
Fringe Trees for Random Trees With Given Vertex Degrees. - Ratul Biswas, Wei-Kuo Chen, Arnab Sen:
On the Replica Symmetric Solution in General Diluted Spin Glasses. - James Anderson, Anton Bernshteyn, Abhishek Dhawan:
Coloring Graphs With Forbidden Almost Bipartite Subgraphs. - Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting With Local Edge Differential Privacy. - Michael C. H. Choi, Max Hird, Youjia Wang:
Improving the Convergence of Markov Chains via Permutations and Projections. - Michael J. Gill, Adam Mammoliti, Ian M. Wanless:
Canonical Labeling of Latin Squares in Average-Case Polynomial Time. - Colin Cooper, Martin E. Dyer, Catherine S. Greenhill:
Triangle Processes on Graphs With Given Degree Sequence. - Ahmed El Alaoui, David Gamarnik:
Hardness of Sampling Solutions From the Symmetric Binary Perceptron. - Ferenc Bencs, Pjotr Buys:
Optimal Zero-Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs. - Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik:
A Bayesian Proof of the Spread Lemma. - Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii:
A Jump of the Saturation Number in Random Graphs?
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-18 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
