Community structure of the physical review citation network
Journal of InformetricsPublished 28 January 2010Open access
P. Chen, S. Redner
Citations162
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This investigation of the community structure of physics subfields in the citation network of all Physical Review publications between 1893 and August 2007 focuses on well-cited publications, and applies modularity maximization to uncover major communities that correspond to clearly-identifiable subfields of physics.
Abstract
We investigate the community structure of physics subfields in the citation\nnetwork of all Physical Review publications between 1893 and August 2007. We\nfocus on well-cited publications (those receiving more than 100 citations), and\napply modularity maximization to uncover major communities that correspond to\nclearly-identifiable subfields of physics. While most of the links between\ncommunities connect those with obvious intellectual overlap, there sometimes\nexist unexpected connections between disparate fields due to the development of\na widely-applicable theoretical technique or by cross fertilization between\ntheory and experiment. We also examine communities decade by decade and also\nuncover a small number of significant links between communities that are widely\nseparated in time.\n
Keywords
Decision SciencesEconomics, Econometrics and FinancePhysics and Astronomy
Physical ReviewSelf-Consistent Equations Including Exchange and Correlation Effects
63,214 Citations1965W. Kohn, L. J. Sham
Proceedings of the National Academy of SciencesCommunity structure in social and biological networks
15,656 Citations2002Michelle Girvan, M. E. J. Newman
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Physical Review EFinding and evaluating community structure in networks
13,892 Citations2004Michelle G. Newman, Michelle Girvan
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Proceedings of the National Academy of SciencesModularity and community structure in networks
12,281 Citations2006M. E. J. Newman
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.
Physical Review LettersSolitons in Polyacetylene
6,755 Citations1979W. P. Su, J. R. Schrieffer +1 more
Bell System Technical JournalAn Efficient Heuristic Procedure for Partitioning Graphs
5,218 Citations1970Brian W. Kernighan, Shang Min Lin
A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Physical Review EFinding community structure in networks using the eigenvectors of matrices
4,801 Citations2006M. E. J. Newman
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.
NatureFunctional cartography of complex metabolic networks
4,013 Citations2005Roger Guimerà, Luı́s A. Nunes Amaral
A methodology is proposed that can find functional modules in complex networks, and classify nodes into universal roles according to their pattern of intra- and inter-module connections, which yields a ‘cartographic representation’ of complex networks.
Proceedings of the National Academy of SciencesResolution limit in community detection
3,045 Citations2006Santo Fortunato, Marc Barthélemy
It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined.
Journal of Statistical Mechanics Theory and ExperimentComparing community structure identification
2,877 Citations2005León Danon, Albert Dı́az-Guilera +2 more
It is found that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes.
Information Processing LettersAn algorithm for drawing general undirected graphs
2,771 Citations1989Tomihisa Kamada, Satoru Kawai
American Journal of SociologySocial Structure from Multiple Networks. I. Blockmodels of Roles and Positions
2,050 Citations1976Harrison C. White, Scott A. Boorman +1 more
The European Physical Journal BDetecting community structure in networks
2,022 Citations2004M. E. J. Newman
A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.
New Journal of PhysicsDetecting the overlapping and hierarchical community structure in complex networks
1,960 Citations2009Andrea Lancichinetti, Santo Fortunato +1 more
The first algorithm that finds both overlapping communities and the hierarchical structure is presented, based on the local optimization of a fitness function, enabling different hierarchical levels of organization to be investigated.
Physical Review ECommunity detection in complex networks using extremal optimization
1,573 Citations2005Jordi Duch, Àlex Arenas
The method outperforms the optimal modularity found by the existing algorithms in the literature and is feasible to be used for the accurate identification of community structure in large complex networks.
Physical Review LettersCommunity Structure in Directed Networks
1,144 Citations2008E. A. Leicht, M. E. J. Newman
This work describes an explicit algorithm based on spectral optimization of the modularity and shows that it gives demonstrably better results than previous methods on a variety of test networks, both real and computer generated.
ComputerSelf-organization and identification of Web communities
1,007 Citations2002Gary William Flake, Sandra Lawrence +2 more
This work shows that the Web self-organizes and its link structure allows efficient identification of communities and is significant because no central authority or process governs the formation and structure of hyperlinks.
Physical review. B, Condensed matterContinuum model for solitons in polyacetylene
869 Citations1980Hajime Takayama, Y. R. Lin‐Liu +1 more
Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fieldsParticle spectrum in model field theories from semiclassical functional integral techniques
697 Citations1975Roger Dashen, Brosl Hasslacher +1 more
Physical Review LettersCorrelation exponents and the metal-insulator transition in the one-dimensional Hubbard model
641 Citations1990H. J. Schulz
The long-distance decay of correlation functions in the one-dimensional Hubbard model is determined for arbitrary band filling and correlation strength, using the exact solution of Lieb and Wu, and the behavior of the frequency-dependent conductivity is discussed.
Physics TodayCitation Statistics from 110 Years of <i>Physical Review</i>
427 Citations2005Sidney Redner
KTH Publication Database DiVA (KTH Royal Institute of Technology)Algorithms for Graph Partitioning: A Survey
22 Citations1998Fjällström, Per-Olof