Fiona Skerman

About Fiona Skerman

Fiona Skerman, With an exceptional h-index of 9 and a recent h-index of 8 (since 2020), a distinguished researcher at Uppsala Universitet, specializes in the field of Random Graphs.

His recent articles reflect a diverse array of research interests and contributions to the field:

Modularity and Graph Expansion

Modularity of very dense graphs

Universal lower bound for community structure of sparse graphs

Logical limit laws for Mallows random permutations

No additional tournaments are quasirandom-forcing

Is it easier to count communities than find them?

The modularity of random graphs on the hyperbolic plane

From flip processes to dynamical systems on graphons

Fiona Skerman Information

University

Position

___

Citations(all)

230

Citations(since 2020)

196

Cited By

97

hIndex(all)

9

hIndex(since 2020)

8

i10Index(all)

7

i10Index(since 2020)

6

Email

University Profile Page

Google Scholar

Fiona Skerman Skills & Research Interests

Random Graphs

Top articles of Fiona Skerman

Modularity and Graph Expansion

arXiv preprint arXiv:2312.07521

2023/12/12

Fiona Skerman
Fiona Skerman

H-Index: 6

Modularity of very dense graphs

arXiv preprint arXiv:2311.06875

2023/11/12

Fiona Skerman
Fiona Skerman

H-Index: 6

Universal lower bound for community structure of sparse graphs

arXiv preprint arXiv:2307.07271

2023/7/14

Nina Kamčev
Nina Kamčev

H-Index: 5

Fiona Skerman
Fiona Skerman

H-Index: 6

Logical limit laws for Mallows random permutations

arXiv preprint arXiv:2302.10148

2023/2/20

Fiona Skerman
Fiona Skerman

H-Index: 6

No additional tournaments are quasirandom-forcing

European Journal of Combinatorics

2023/2/1

Roberto Parente
Roberto Parente

H-Index: 9

Fiona Skerman
Fiona Skerman

H-Index: 6

Is it easier to count communities than find them?

arXiv preprint arXiv:2212.10872

2022/12/21

Cynthia Rush
Cynthia Rush

H-Index: 10

Fiona Skerman
Fiona Skerman

H-Index: 6

The modularity of random graphs on the hyperbolic plane

Journal of Complex Networks

2022/2/1

Nikolaos Fountoulakis
Nikolaos Fountoulakis

H-Index: 17

Fiona Skerman
Fiona Skerman

H-Index: 6

From flip processes to dynamical systems on graphons

arXiv preprint arXiv:2201.12272

2022/1/28

Jan Hladký
Jan Hladký

H-Index: 5

Fiona Skerman
Fiona Skerman

H-Index: 6

Modularity and edge sampling

arXiv preprint arXiv:2112.13190

2021/12/25

Fiona Skerman
Fiona Skerman

H-Index: 6

A branching process with deletions and mergers that matches the threshold for hypercube percolation

arXiv preprint arXiv:2104.04407

2021/4/9

Laura Eslava
Laura Eslava

H-Index: 3

Fiona Skerman
Fiona Skerman

H-Index: 6

Finding large expanders in graphs: from topological minors to induced subgraphs

arXiv preprint arXiv:2012.15722

2020/12/31

Fiona Skerman
Fiona Skerman

H-Index: 6

Assigning times to minimise reachability in temporal graphs

Journal of Computer and System Sciences

2020/8/20

Kitty Meeks
Kitty Meeks

H-Index: 9

Fiona Skerman
Fiona Skerman

H-Index: 6

Modularity of Erdős‐Rényi random graphs

Random Structures & Algorithms

2020/8

Fiona Skerman
Fiona Skerman

H-Index: 6

The parameterised complexity of computing the maximum modularity of a graph

Algorithmica

2020/8

Kitty Meeks
Kitty Meeks

H-Index: 9

Fiona Skerman
Fiona Skerman

H-Index: 6

Random tree recursions: Which fixed points correspond to tangible sets of trees?

Random Structures & Algorithms

2020/5

Moumanti Podder
Moumanti Podder

H-Index: 3

Fiona Skerman
Fiona Skerman

H-Index: 6

Embedding small digraphs and permutations in binary trees and split trees

Algorithmica

2020/3/1

See List of Professors in Fiona Skerman University(Uppsala Universitet)

Co-Authors

academic-engine