default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 51
Volume 51, Number 1, August 2017
- Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. 3-13 - Omer Bobrowski
, Shmuel Weinberger:
On the vanishing of homology in random Čech complexes. 14-51 - Christian Borgs, Jennifer T. Chayes, David Gamarnik:
Convergent sequences of sparse graphs: A large deviations approach. 52-89 - Pierre-Antoine Corre:
Oscillations in the height of the Yule tree and application to the binary search tree. 90-120 - Chaim Even-Zohar:
The writhe of permutations and random framed knots. 121-142 - Karen Gunderson, Sebastian Koch, Michal Przykucki:
The time of graph bootstrap percolation. 143-168 - Dániel Korándi, Benny Sudakov:
Saturation in random graphs. 169-181
Volume 51, Number 2, September 2017
- Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in dense random graphs. 185-214 - Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris:
Chromatic thresholds in sparse random graphs. 215-236 - Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto:
Generalized PageRank on directed configuration networks. 237-274 - Martin Dolezal, Jan Hladký, András Máthé:
Cliques in dense inhomogeneous random graphs. 275-314 - Yasuaki Hiraoka, Tomoyuki Shirai:
Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process. 315-340 - Tuan-Minh Nguyen, Stanislav Volkov:
A universal result for consecutive random subdivision of polygons. 341-371
Volume 51, Number 3, October 2017
- Alan M. Frieze, Wesley Pegden:
Separating subadditive euclidean functionals. 375-403 - Gabriel Berzunza Ojeda:
The cut-tree of large trees with small heights. 404-427 - Xing Shi Cai, Luc Devroye:
The graph structure of a deterministic automaton chosen at random. 428-458 - Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? 459-482 - Maurits de Graaf, Bodo Manthey:
Probabilistic analysis of power assignments. 483-505 - Antti Knowles, Ron Rosenthal:
Eigenvalue confinement and spectral gap for random simplicial complexes. 506-537 - Can M. Le, Elizaveta Levina, Roman Vershynin:
Concentration and regularization of random graphs. 538-561
Volume 51, Number 4, December 2017
- Graham R. Brightwell, Svante Janson, Malwina J. Luczak:
The Greedy Independent Set in a Random Graph with Given Degrees. 565-586 - Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat:
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. 587-606 - Roee David, Elazar Goldenberg, Robert Krauthgamer:
Local reconstruction of low-rank matrices and subspaces. 607-630 - Michael Drmota, Lander Ramos, Juanjo Rué:
Subgraph statistics in subcritical graph classes. 631-673 - Jaroslav Nesetril, Patrice Ossona de Mendez:
Cluster analysis of local convergent sequences of structures. 674-728 - Yuting Wen:
The Brownian plane with minimal neck baby universe. 729-752
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-11-20 00:17 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:
