1. A branching process approach to level‐k phylogenetic networks. Issue 2 (26th November 2021) Authors: Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 61:Issue 2(2022) Page Start: 397 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Geometry of large Boltzmann outerplanar maps. Issue 3 (11th December 2018) Authors: Stefánsson, Sigurdur Örn; Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 55:Issue 3(2019) Page Start: 742 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Gibbs partitions: The convergent case. Issue 3 (27th February 2018) Authors: Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 53:Issue 3(2018) Page Start: 537 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Graph limits of random graphs from a subset of connected k‐trees. Issue 1 (11th September 2018) Authors: Drmota, Michael; Jin, Emma Yu; Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 55:Issue 1(2019) Page Start: 125 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Graphon convergence of random cographs. Issue 3 (28th February 2021) Authors: Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 59:Issue 3(2021) Page Start: 464 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. The continuum random tree is the scaling limit of unlabeled unrooted trees. Issue 2 (11th December 2018) Authors: Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 496 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗