3 papers
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.PR2026
Modularity of preferential attachment graphs
Katarzyna Rybarczyk, MaÅgorzata Sulkowska
We study the preferential attachment model . A graph is generated from a finite initial graph by adding new vertices one at a time. Each new vertex connects to $h\ge…
math.CO2025
New bounds on the modularity of
Katarzyna Rybarczyk, MaÅgorzata Sulkowska
Modularity is a parameter indicating the presence of community structure in the graph. Nowadays it lies at the core of widely used clustering algorithms. We study the modularity of…