1. Modularity of Erdős‐Rényi random graphs. Issue 1 (20th March 2020) Authors: McDiarmid, Colin; Skerman, Fiona Journal: Random structures & algorithms Issue: Volume 57:Issue 1(2020) Page Start: 211 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Modularity of regular and treelike graphs. (7th October 2017) Authors: McDiarmid, Colin; Skerman, Fiona Journal: Journal of complex networks Issue: Volume 6:Number 4(2018) Page Start: 596 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. No additional tournaments are quasirandom-forcing. (February 2023) Authors: Hancock, Robert; Kabela, Adam; Král', Daniel; Martins, Taísa; Parente, Roberto; Skerman, Fiona; Volec, Jan Journal: European journal of combinatorics Issue: Volume 108(2023) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Random tree recursions: Which fixed points correspond to tangible sets of trees?. Issue 3 (14th November 2019) Authors: Johnson, Tobias; Podder, Moumanti; Skerman, Fiona Journal: Random structures & algorithms Issue: Volume 56:Issue 3(2020) Page Start: 796 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. The modularity of random graphs on the hyperbolic plane. (30th December 2021) Authors: Chellig, Jordan; Fountoulakis, Nikolaos; Skerman, Fiona Editors: Van Mieghem, Piet Journal: Journal of complex networks Issue: Volume 10:Number 1(2022) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗