We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
—In this paper we study the distributed multi-channel power allocation for spectrum sharing cognitive radio networks with QoS guarantee. We formulate this problem as a noncoopera...