Discovering a community structure is fundamental for uncovering the links between structure and function in complex networks. In this paper, we discuss an equivalence of the objective functions of the symmetric nonnegative matrix factorization (SNMF) and the maximum optimization of modularity...

We study the robustness of several network models subject to edge removal. The robustness is measured by the statistics of network breakdowns, where a breakdown is defined as the destroying of the total connectedness of a network, rather than the disappearance of the giant component. We...

We use generating function formalism to obtain an exact formula of the betweenness centrality in finite components of random networks with arbitrary degree distributions. The formula is obtained as a function of the degree and the component size, and is confirmed by simulations for Poisson,...