- Pawel Pralat, Nicholas C. Wormald. Meyniel's conjecture holds for random d-regular graphs. Random Struct. Algorithms, 55(3):719-741, 2019.
- Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda. Spatial mixing and nonlocal Markov chains. Random Struct. Algorithms, 55(3):584-614, 2019.
- Benedikt Stufler. The continuum random tree is the scaling limit of unlabeled unrooted trees. Random Struct. Algorithms, 55(2):496-528, 2019.
- Jacob D. Baron, Jeff Kahn. On the cycle space of a random graph. Random Struct. Algorithms, 54(1):39-68, 2019.
- Richard Montgomery 0001. Fractional clique decompositions of dense graphs. Random Struct. Algorithms, 54(4):779-796, 2019.
- Asaf Ferber, Daniel Montealegre, Van Vu. Law of the iterated logarithm for random graphs. Random Struct. Algorithms, 54(1):3-38, 2019.
- Remco van der Hofstad, Svante Janson, Malwina J. Luczak. Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms, 55(1):3-55, 2019.
- Rajko Nenadov, Angelika Steger, Milos Trujic. Resilience of perfect matchings and Hamiltonicity in random graph processes. Random Struct. Algorithms, 54(4):797-819, 2019.
- Olle Häggström, Timo Hirscher. Water transport on infinite graphs. Random Struct. Algorithms, 54(3):515-527, 2019.
- Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed. Notes on growing a tree in a graph. Random Struct. Algorithms, 55(2):290-312, 2019.