Finding community structure in networks using the eigenvectors of matrices
Reads0
Chats0
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.Abstract:
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as ``modularity'' over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.read more
Citations
More filters
Journal ArticleDOI
Forman curvature for complex networks
R.P. Sreejith,Karthikeyan Mohanraj,Jürgen Jost,Jürgen Jost,Emil Saucan,Emil Saucan,Areejit Samal +6 more
TL;DR: This work adapts Forman's discretization of Ricci curvature to the case of undirected networks, both weighted and unweighted, and investigates the measure in a variety of model and real-world networks to suggest that it can be employed to gain novel insights on the organization of complex networks.
Book ChapterDOI
A Comparison of Community Detection Algorithms on Artificial Networks
TL;DR: This work uses Lancichinetti et al. model, which is able to generate networks with controlled power-law degree and community distributions, to test some community detection algorithms and uses the normalized mutual information measure to assess the quality of the results and compare the considered algorithms.
Book
Basic Phylogenetic Combinatorics
TL;DR: This book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, quartet systems and metrics, and highlights how each provides a unique perspective for viewing and perceiving the combinatorial structure of a phylogenetic tree.
Journal ArticleDOI
Emergence of Persistent Networks in Long-Term Intracranial EEG Recordings
TL;DR: It is suggested that a metastable, frequency-band-dependent scaffold of brain connectivity exists from which transient activity emerges and recedes, and that these structures are robust, emerging from brief time intervals regardless of cognitive state.
Journal ArticleDOI
Dynamical exploration of the repertoire of brain networks at rest is modulated by psilocybin
Louis-David Lord,Paul Expert,Selen Atasoy,Leor Roseman,Kristina M. Rapuano,Renaud Lambiotte,David J. Nutt,Gustavo Deco,Robin L. Carhart-Harris,Morten L. Kringelbach,Joana Cabral,Joana Cabral,Joana Cabral +12 more
TL;DR: How the brain's dynamical exploration of resting-state networks is rapidly modulated by intravenous infusion of psilocybin is characterized and one of the first attempts at bridging molecular pharmacodynamics and whole-brain network dynamics is represented.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
The Strength of Weak Ties
TL;DR: In this paper, it is argued that the degree of overlap of two individuals' friendship networks varies directly with the strength of their tie to one another, and the impact of this principle on diffusion of influence and information, mobility opportunity, and community organization is explored.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Journal ArticleDOI
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.