Fiona Skerman
Associate senior lecturer/Assistant Professor at Matematiska institutionen; Sannolikhetsteori och kombinatorik
- Telephone:
- +46 18 471 31 94
- E-mail:
- fiona.skerman@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postal address:
- Box 480
751 06 UPPSALA
Associate senior lecturer/Assistant Professor at Matematiska institutionen; Statistik, AI och data science
- Telephone:
- +46 18 471 31 94
- E-mail:
- fiona.skerman@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Lägerhyddsvägen 1
- Postal address:
- Box 480
751 06 UPPSALA
- ORCID:
- 0000-0003-4141-7059
More information is available to staff who log in.
Short presentation
My research interests are in probabilistic combinatorics, in random graphs and random trees. I study the modularity function introduced by Newman and Girvan 2004 a measure of how well a graph can be clustered into communities - in particular how this behaves on random graphs. I am also interested in phase transitions in other random discrete structures, in first order logic and automata on random discrete structures.
website: https://fskerman.github.io/
Keywords
- ai
- artificial intelligence
- artificiell intelligens
- machine learning
- maskininlärning
- probability theory
- random graph
- sannolikhetsteori
- slumpgraf
Publications
Recent publications
- No additional tournaments are quasirandom-forcing? (2023)
- Finding large expanders in graphs (2023)
- Is it easier to count communities than find them? (2023)
- The modularity of random graphs on the hyperbolic plane (2021)
- Assigning times to minimise reachability in temporal graphs (2021)
All publications
Articles
- No additional tournaments are quasirandom-forcing? (2023)
- Finding large expanders in graphs (2023)
- The modularity of random graphs on the hyperbolic plane (2021)
- Assigning times to minimise reachability in temporal graphs (2021)
- Random tree recursions (2020)
- Modularity of Erdos-Rényi random graphs (2020)
- kappa-cut on paths and some trees (2019)
- Inversions in Split Trees and Conditional Galton-Watson Treest (2019)
- Modularity of regular and treelike graphs (2018)
- Guessing Numbers of Odd Cycles (2017)
- Degree sequences of random digraphs and bipartite graphs (2016)
- Avoider-enforcer star games (2015)
Conferences
