The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Profiling core-periphery network structure by random walkers
Open accessAbstract
Disclosing the main features of the structure of a network is crucial to understand a number of static and dynamic properties, such as robustness to failures, spreading dynamics, or collective behaviours. Among the possible characterizations, the core-periphery paradigm models the network as the union of a dense core with a sparsely connected periphery, highlighting the role of each node on the basis of its topological position. Here we show that the core-periphery structure can effectively be profiled by elaborating the behaviour of a random walker. A curve--the core-periphery profile--and a numerical indicator are derived, providing a global topological portrait. Simultaneously, a coreness value is attributed to each node, qualifying its position and role. The application to social, technological, economical, and biological networks reveals the power of this technique in disclosing the overall network structure and the peculiar role of some specific nodes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“The Erdo˝s-Re´nyi and Baraba´si-Albert networks 10,14 stand in the middle, with the former more similar to a complete network and the latter displaying a rather stronger core-periphery characterization 17 .”
Detecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001
Google's PageRank and Beyond: The Science of Search Engine Rankings
Langville, A. N., & Meyer, C. D. (2006) · doi:10.1515/9781400830329 · Cited by 814
On the uniform generation of random graphs with prescribed degree sequences
Milo, R., Kashtan, N., Itzkovitz, S., Newman, M. E. J., & Alon, U. (2003) · arXiv · doi:10.48550/arxiv.cond-mat/0312028 · Cited by 281
Cited by
Random 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
Metadata
- Authors
- Rossa, F. D., Dercole, F., & Piccardi, C.
- Venue
- Scientific Reports
- Published
- 2013-03-19
- Volume
- 3
- Issue
- 1
- Pages
- 1467-1467
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2067573658
- Cited by
- 188
- References
- 6
- FWCI
- 9.33
- Type
- journal article
- Language
- en
- Open access
- gold
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.