Advances in the analysis of random structures and their applications: relationships among models

Search results

• 2021

  Full rainbow matchings in graphs and hypergraphs

  Gao, P., Ramadurai, R., Wanless, I. M. & Wormald, N., Sept 2021, In: Combinatorics, Probability and Computing. 30, 5, p. 762-780 19 p.

  Research output: Contribution to journal › Article › Research › peer-review

  Open Access

  8   Link opens in a new tab Citations (Scopus)

• 2020

  The height of depth-weighted random recursive trees

  Leckey, K., Mitsche, D. & Wormald, N., May 2020, In: Random Structures and Algorithms. 56, 3, p. 851-866 16 p.

  Research output: Contribution to journal › Article › Research › peer-review

  2   Link opens in a new tab Citations (Scopus)

• 2018

  Asymptotic enumeration of graphs with given degree sequence

  Wormald, N., 1 Jan 2018, Proceedings of the International Congress of Mathematicians, ICM 2018: 2018 International Congress of Mathematicians, ICM 2018; Rio de Janeiro; Brazil; 1 August 2018 through 9 August 2018. Sirakov, B., de Souza, P. N. & Viana, M. (eds.). Singapore: World Scientific Publishing, Vol. 4. p. 3263-3284 22 p. (Proceedings of the International Congress of Mathematicians, ICM 2018; vol. 4).

  Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

  1   Link opens in a new tab Citation (Scopus)

• The Number of Satisfying Assignments of Random Regular k-SAT Formulas

  Coja-Oghlan, A. & Wormald, N., 1 Jul 2018, In: Combinatorics, Probability and Computing. 27, 4, p. 496-530 35 p.

  Research output: Contribution to journal › Article › Research › peer-review

  Open Access

  File

  14   Link opens in a new tab Citations (Scopus)

• The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

  Stark, D. & Wormald, N., 1 Jul 2018, In: Combinatorics, Probability and Computing. 27, 4, p. 672-715 44 p.

  Research output: Contribution to journal › Article › Research › peer-review

  Open Access

  File

  6   Link opens in a new tab Citations (Scopus)

• 2017

  Uniform generation of random regular graphs

  Gao, P. & Wormald, N., 2017, In: SIAM Journal on Computing. 46, 4, p. 1395-1427 33 p.

  Research output: Contribution to journal › Article › Research › peer-review

  25   Link opens in a new tab Citations (Scopus)

• 2016

  It’s a small world for random surfers

  Mehrabian, A. & Wormald, N., 1 Oct 2016, In: Algorithmica. 76, 2, p. 344-380 37 p.

  Research output: Contribution to journal › Article › Research › peer-review

  2   Link opens in a new tab Citations (Scopus)

• Longest paths in random apollonian networks and largest r-ary subtrees of random d-ary recursive trees

  Collevecchio, A., Mehrabian, A. & Wormald, N. C., 1 Sept 2016, In: Journal of Applied Probability. 53, 3, p. 846-856 11 p.

  Research output: Contribution to journal › Article › Research › peer-review

  2   Link opens in a new tab Citations (Scopus)

• Meyniel's conjecture holds for random graphs

  Pralat, P. & Wormald, N., 1 Mar 2016, In: Random Structures and Algorithms. 48, 2, p. 396-421 26 p.

  Research output: Contribution to journal › Article › Research › peer-review

  13   Link opens in a new tab Citations (Scopus)

• 2015

  On the push&pull protocol for rumour spreading

  Acan, H., Collevecchio, A., Mehrabian, A. & Wormald, N., 2015, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC'15). Spirakis, P. G. (ed.). New York NY USA: Association for Computing Machinery (ACM), p. 405-412 8 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

  13   Link opens in a new tab Citations (Scopus)