27 citations · 73 across the 20 of their papers we have counts for
5 papers · 1 filter
Random tree recursions: which fixed points correspond to tangible sets of trees?
Tobias Johnson, Moumanti Podder, Fiona Skerman
Let be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only i…
Modularity of Erdős-Rényi random graphs
Colin McDiarmid, Fiona Skerman
For a given graph , each partition of the vertices has a modularity score, with higher values indicating that the partition better captures community structure in . The modul…
The parameterised complexity of computing the maximum modularity of a graph
Kitty Meeks, Fiona Skerman
The maximum modularity of a graph is a parameter widely used to describe the level of clustering or community structure in a network. Determining the maximum modularity of a graph…
K-cut on paths and some trees
Xing Shi Cai, Luc Devroye, Cecilia Holmgren +1
We define the (random) -cut number of a rooted graph to model the difficulty of the destruction of a resilient network. The process is as the cut model of Meir and Moon except n…
Assigning times to minimise reachability in temporal graphs
Jessica Enright, Kitty Meeks, Fiona Skerman
Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g.~the spread of disease or dissemination of informa…