Network landscape from a Brownian particle’s perspective
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Given a complex biological or social network, how many clusters should it be decomposed into? We define the distance d(i,j) from node i to node j as the average number of steps a Brownian particle takes to reach j from i. Node j is a global attractor of i if d(i,j)< or =d(i,k) for any k of the graph; it is a local attractor of i if j in E(i) (the set of nearest neighbors of i) and d(i,j)< or =d(i,l) for any l in E(i). Based on the intuition that each node should have a high probability to be in the same community as its global (local) attractor on the global (local) scale, we present a simple method to uncover a network's community structure. This method is applied to several real networks and some discussion on its possible extensions is made.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“White and Smyth (White and Smyth, 2003) and Zhou (Zhou, 2003a) used instead the average first passage time, i. e. the average number of steps needed to reach for the first time the target vertex from the source.”
BackgroundMethodInfluentialComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
“…running dynamical processes on the network, like diffusion (Jeub et al., 2015; Pons and Latapy, 2005; Rosvall and Bergstrom, 2008; Van Dongen, 2000; Zhou, 2003a,b; Zhou and Lipowsky, 2004), spin dynamics (Raghavan et al., 2007; Reichardt and Bornholdt, 2006; Ronhovde and Nussinov, 2010; Traag et…”
BackgroundRandom walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Method to find community structures based on information centrality
Fortunato, S., Latora, V., & Marchiori, M. (2004) · Physical Review E · doi:10.1103/physreve.70.056104 · Cited by 294
Distance, dissimilarity index, and network community structure
Zhou, H. (2003) · Physical Review E · doi:10.1103/physreve.67.061901 · Cited by 272
Self-citationInferring neural signalling directionality from undirected structural connectomes
Seguin, C., Razi, A., & Zalesky, A. (2019) · Nature Communications · doi:10.1038/s41467-019-12201-w · Cited by 96
Metadata
- Authors
- Zhou, H.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2003-04-21
- Volume
- 67
- Issue
- 4
- Pages
- 041908-041908
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2009827286
- Cited by
- 144
- References
- 2
- FWCI
- 2.34
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.