default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 59
Volume 59, Number 1, August 2021
- Colin McDiarmid, Alex Scott, Paul Withers:
The component structure of dense random subgraphs of the hypercube. 3-24 - Erik Bates
, Moumanti Podder:
Avoidance couplings on non-complete graphs. 25-52 - Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the probabilistic degree of OR over the reals. 53-67 - Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
The size-Ramsey number of short subdivisions. 68-78 - Jiaxi Nie, Jacques Verstraëte:
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth. 79-95 - Nobutaka Shimizu, Takeharu Shiraga:
Phase transitions of Best-of-two and Best-of-three on stochastic block models. 96-140
Volume 59, Number 2, September 2021
- Michael Damron, Hanbaek Lyu, David Sivakoff:
Stretched exponential decay for subcritical parking times on. 143-154 - François Bienvenu, Jean-Jil Duchamps, Félix Foutel-Rodier:
The Moran forest. 155-188 - Emilio De Santis:
Ranking graphs through hitting times of Markov chains. 189-203 - Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting independent sets in graphs with bounded bipartite pathwidth. 204-237 - Joel Larsson, Klas Markström:
Biased random k-SAT. 238-266 - Michal Lason:
Optimal stopping for many connected components in a graph. 267-287
- Corrigendum to "Online purchasing under uncertainty". 288
Volume 59, Number 3, October 2021
- Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast uniform generation of random graphs with given degree sequences. 291-314 - Sohom Bhattacharya, Amir Dembo:
Upper tail for homomorphism counts in constrained sparse random graphs. 315-338 - Jacopo Borga:
Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one-dimensional labels. 339-375 - Pietro Caputo, Matteo Quattropani:
Mixing time of PageRank surfers on sparse random digraphs. 376-406 - Soumik Pal, Yizhe Zhu:
Community detection in the sparse hypergraph stochastic block model. 407-463 - Benedikt Stufler:
Graphon convergence of random cographs. 464-491
Volume 59, Number 4, December 2021
- Alexander E. Holroyd, James B. Martin:
Galton-Watson games. 495-521 - Luisa Andreis, Wolfgang König, Robert I. A. Patterson:
A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph. 522-553 - Jacob Fox, Lisa Sauermann, Fan Wei:
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. 554-615 - Annika Heckel:
Random triangles in random graphs. 616-621 - Ross G. Pinsky:
The infinite limit of separable permutations. 622-639 - Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma:
Erasures versus errors in local decoding and property testing. 640-670
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-12-09 23:27 CET 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:
