27 citations · 73 across the 20 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
Modularity and partially observed graphs
Colin McDiarmid, Fiona Skerman
Suppose that there is an unknown underlying graph on a large vertex set, and we can test only a proportion of the possible edges to check whether they are present in . If $G…
math.PR2021
A branching process with deletions and mergers that matches the threshold for hypercube percolation
Laura Eslava, Sarah Penington, Fiona Skerman
We define a graph process based on a discrete branching process with deletions and mergers, which is inspired by the 4-cycle structure of both the hypercube $Q_d…
math.PR2021
The modularity of random graphs on the hyperbolic plane
Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman
Modularity is a quantity which has been introduced in the context of complex networks in order to quantify how close a network is to an ideal modular network in which the nodes for…