Showing math.PRShow all
2 papers · 1 filter
math.PR2026
Note on edge expansion and modularity in preferential attachment graphs
Colin McDiarmid, Katarzyna Rybarczyk, Fiona Skerman +1
Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and…
math.PR2025
Modularity and random graphs
Colin McDiarmid, Fiona Skerman
This work will appear as a chapter in a forthcoming volume titled `Topics in Probabilistic Graph Theory'. For a given graph , each partition of the vertices has a modularity sco…