Scholar
Fiona Skerman
Google Scholar ID: rUrxVlMAAAAJ
Uppsala University
Citations & Impact
Citations
289
H-index
9
i10-index
8
Publications
20
Co-authors
0
Publications
Resume (English only)
Academic Achievements
- Published several preprints on modularity and random graphs, including 'Modularity of nearly complete graphs and bipartite graphs', 'Universal lower bound for community structure of sparse graphs', and 'Modularity and partially observed graphs'.
Research Experience
- Was a Simons-Berkeley Research Fellow at UC Berkeley's Simons Institute for the program on Computational Complexity of Statistical Inference; research fellow at Bristol University; postdoc with Dan Kráľ at Masaryk University; and postdoc with Cecilia Holmgren at Uppsala University.
Education
- DPhil under the supervision of Colin McDiarmid, researching the modularity of networks, awarded the Corcoran Memorial Prize for the best thesis in the Oxford Statistics Department; Honours thesis with Brendan McKay at the Australian National University, looking at likely degree sequences in random bipartite graphs.
Background
- Research interests include probability and discrete structures, computational complexity, and statistical inference. Currently an Associate Professor at Uppsala University.
Co-authors