Fiona Skerman
Senior Lecturer/Associate Professor at Department of Mathematics; Academic staff
- E-mail:
- fiona.skerman@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 524
751 20 UPPSALA
Download contact information for Fiona Skerman at Department of Mathematics; Academic staff
Senior Lecturer/Associate Professor at Department of Mathematics; Probability Theory and Combinatorics
- E-mail:
- fiona.skerman@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 524
751 20 UPPSALA
Senior Lecturer/Associate Professor at Department of Mathematics; Statistics, AI and Data Science
- E-mail:
- fiona.skerman@math.uu.se
- Visiting address:
- Ångströmlaboratoriet, Regementsvägen 10
- Postal address:
- Box 524
751 20 UPPSALA
- Academic merits:
- Docent
- ORCID:
- 0000-0003-4141-7059
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
- artificial intelligence
- machine learning
- artificiell intelligens
- maskininlärning
- ai
- random graph
- probability theory
- slumpgraf
- sannolikhetsteori

Publications
Recent publications
-
Approximating temporal modularity on graphs of small underlying treewidth
Part of Theoretical Computer Science, 2026
- DOI for Approximating temporal modularity on graphs of small underlying treewidth
- Download full text (pdf) of Approximating temporal modularity on graphs of small underlying treewidth
-
On graphs with modularity zero or near-zero
Part of The Electronic Journal of Combinatorics, 2026
- DOI for On graphs with modularity zero or near-zero
- Download full text (pdf) of On graphs with modularity zero or near-zero
-
Is It Easier to Count Communities Than Find Them?
Part of Random Structures & Algorithms, 2026
- DOI for Is It Easier to Count Communities Than Find Them?
- Download full text (pdf) of Is It Easier to Count Communities Than Find Them?
-
Approximating temporal modularity on graphs of small underlying treewidth
Part of Algorithmics of Wireless Networks, p. 17-31, 2025
-
Logical limit laws for Mallows random permutations
Part of The Electronic Journal of Combinatorics, 2025
- DOI for Logical limit laws for Mallows random permutations
- Download full text (pdf) of Logical limit laws for Mallows random permutations
All publications
Articles in journal
-
Approximating temporal modularity on graphs of small underlying treewidth
Part of Theoretical Computer Science, 2026
- DOI for Approximating temporal modularity on graphs of small underlying treewidth
- Download full text (pdf) of Approximating temporal modularity on graphs of small underlying treewidth
-
On graphs with modularity zero or near-zero
Part of The Electronic Journal of Combinatorics, 2026
- DOI for On graphs with modularity zero or near-zero
- Download full text (pdf) of On graphs with modularity zero or near-zero
-
Is It Easier to Count Communities Than Find Them?
Part of Random Structures & Algorithms, 2026
- DOI for Is It Easier to Count Communities Than Find Them?
- Download full text (pdf) of Is It Easier to Count Communities Than Find Them?
-
Logical limit laws for Mallows random permutations
Part of The Electronic Journal of Combinatorics, 2025
- DOI for Logical limit laws for Mallows random permutations
- Download full text (pdf) of Logical limit laws for Mallows random permutations
-
On the accurate computation of expected modularity in probabilistic networks
Part of Scientific Reports, 2025
- DOI for On the accurate computation of expected modularity in probabilistic networks
- Download full text (pdf) of On the accurate computation of expected modularity in probabilistic networks
-
From flip processes to dynamical systems on graphons
Part of Annales de l'I.H.P. Probabilites et statistiques, p. 2878-2922, 2024
-
A branching process with deletions and mergers that matches the threshold for hypercube percolation
Part of Annales de l'I.H.P. Probabilites et statistiques, p. 1418-1457, 2024
-
Finding large expanders in graphs: from topological minors to induced subgraphs
Part of The Electronic Journal of Combinatorics, 2023
- DOI for Finding large expanders in graphs: from topological minors to induced subgraphs
- Download full text (pdf) of Finding large expanders in graphs: from topological minors to induced subgraphs
-
No additional tournaments are quasirandom-forcing?
Part of European journal of combinatorics (Print), 2023
-
The modularity of random graphs on the hyperbolic plane
Part of Journal of Complex Networks, 2022
- DOI for The modularity of random graphs on the hyperbolic plane
- Download full text (pdf) of The modularity of random graphs on the hyperbolic plane
-
Assigning times to minimise reachability in temporal graphs
Part of Journal of computer and system sciences (Print), p. 169-186, 2021
- DOI for Assigning times to minimise reachability in temporal graphs
- Download full text (pdf) of Assigning times to minimise reachability in temporal graphs
-
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
Part of Algorithmica, p. 589-615, 2020
- DOI for Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
- Download full text (pdf) of Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
-
Random tree recursions: Which fixed points correspond to tangible sets of trees?
Part of Random structures & algorithms (Print), p. 796-837, 2020
-
Modularity of Erdos-Rényi random graphs
Part of Random structures & algorithms (Print), p. 211-243, 2020
-
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
Part of Algorithmica, p. 2174-2199, 2019
-
kappa-cut on paths and some trees
Part of Electronic Journal of Probability, 2019
- DOI for kappa-cut on paths and some trees
- Download full text (pdf) of kappa-cut on paths and some trees
-
Inversions in Split Trees and Conditional Galton-Watson Treest
Part of Combinatorics, probability & computing, p. 335-364, 2019
-
Modularity of regular and treelike graphs
Part of Journal of Complex Networks, p. 596-619, 2018
-
Guessing Numbers of Odd Cycles
Part of The Electronic Journal of Combinatorics, 2017
-
Degree sequences of random digraphs and bipartite graphs
Part of Journal of Combinatorics, p. 21-49, 2016
-
Part of Discrete Mathematics & Theoretical Computer Science, p. 145-160, 2015
Conference papers
-
Approximating temporal modularity on graphs of small underlying treewidth
Part of Algorithmics of Wireless Networks, p. 17-31, 2025
-
Modularity and Graph Expansion
Part of 15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024
-
Is it easier to count communities than find them?
Part of 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
- DOI for Is it easier to count communities than find them?
- Download full text (pdf) of Is it easier to count communities than find them?
-
Survival for a Galton-Watson tree with cousin mergers
Part of PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, p. 445-452, 2021
- DOI for Survival for a Galton-Watson tree with cousin mergers
- Download full text (pdf) of Survival for a Galton-Watson tree with cousin mergers
-
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
Part of 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2019
- DOI for The Parameterised Complexity of Computing the Maximum Modularity of a Graph
- Download full text (pdf) of The Parameterised Complexity of Computing the Maximum Modularity of a Graph