6 papers
Arrangements of Consecutive Numbers in Mallows Permutations
Katarzyna Rybarczyk
We study the random variable that counts the number of specific arrangements of clustered consecutive numbers in permutations under the Mallows distribution. We provide an asymptot…
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…
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…
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…
Normal approximation for number of edges in random intersection graphs
Katarzyna Rybarczyk, Grzegorz Serafin
The random intersection graph model is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is sign…
Modularity of random intersection graphs
Katarzyna Rybarczyk
Modularity was introduced by Newman and Girvan in 2004 and is used as a measure of community structure of networks represented by graphs. In our work we study modularity of the ran…