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
Identifying Causes of Patterns in Ecological Networks: Opportunities and Limitations
TL;DR: A satisfactory resolution of the underlying factors determining network structure will require substantial additional information, not only on independently assessed abundances, but also on traits, and ideally on fitness cons...
The Development of Social Network Analysis—with an Emphasis on Recent Events
TL;DR: Social network analysis as mentioned in this paper is an approach that involves four defining properties: (1) it involves the intuition that links among social actors are important, (2) it is based on the collection and analysis of data that record social relations that link actors, (3) it draws heavily on graphic imagery to reveal and display the patterning of those links, and (4) it develops mathematical and computational models to describe and explain those patterns.
Journal ArticleDOI
Defecting or Not Defecting: How to “Read” Human Behavior during Cooperative Games by EEG Measurements
Fabrizio De Vico Fallani,Vincenzo Nicosia,Roberta Sinatra,Laura Astolfi,Febo Cincotti,Donatella Mattia,Christopher Wilke,A. Doud,Vito Latora,Bin He,Fabio Babiloni +10 more
TL;DR: Graph analysis of hyper-brain networks constructed from the EEG scanning of 26 couples of individuals playing the Iterated Prisoner's Dilemma reveals the possibility to predict non-cooperative interactions during the decision-making phase.
Journal ArticleDOI
Detection of functional brain network reconfiguration during task-driven cognitive states.
Qawi K. Telesford,Mary-Ellen Lynall,Jean M. Vettel,Michael B. Miller,Scott T. Grafton,Danielle S. Bassett +5 more
TL;DR: The impact of time window length on observed network dynamics during task performance is demonstrated and organizational principles of brain functional connectivity that are not accessible with static network approaches are revealed.
Journal ArticleDOI
Listing All Maximal Cliques in Large Sparse Real-World Graphs
TL;DR: This work implements a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Loffler, and Strash (ISAAC 2010) and analyzes its performance on a large corpus of real-world graphs to show that this algorithm is the first to offer a practical solution to listing allmaximal clique in large sparse graphs.
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.