The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Temporal node centrality in complex networks
Abstract
Many networks are dynamic in that their topology changes rapidly--on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Node centrality in weighted networks: Generalizing degree and shortest paths
Opsahl, T., Agneessens, F., & Skvoretz, J. (2010) · Social Networks · doi:10.1016/j.socnet.2010.03.006 · Cited by 3,718
Reality mining: sensing complex social systems
Eagle, N., & (Sandy) Pentland, A. (2006) · Personal and Ubiquitous Computing · doi:10.1007/s00779-005-0046-3 · Cited by 2,772
Research design and statistical analysis
(2011) · Choice Reviews Online · doi:10.5860/choice.48-4538 · Cited by 1,202
Research Design & Statistical Analysis
Myers, J. L., & Well, A. D. (2003) · Psychology Press eBooks · doi:10.4324/9781410607034 · Cited by 407
Connectivity and Inference Problems for Temporal Networks
Kempe, D., Kleinberg, J., & Kumar, A. (2002) · Journal of Computer and System Sciences · doi:10.1006/jcss.2002.1829 · Cited by 288
Kostakos, V. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.11.021 · Cited by 254
Characterising temporal distance and reachability in mobile and online social networks
Tang, J., Musolesi, M., Mascolo, C., & Latora, V. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1672308.1672329 · Cited by 159
Centrality prediction in dynamic human contact networks
Kim, H., Tang, J., Anderson, R., & Cecilia Mascolo, C. (2011) · Computer Networks · doi:10.1016/j.comnet.2011.10.022 · Cited by 77
Self-citation
Cited by
Modern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 419
Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
Chen, D.-B., Gao, H., Lü, L., & Zhou, T. (2013) · PLoS ONE · doi:10.1371/journal.pone.0077455 · Cited by 364
Metadata
- Authors
- Kim, H., & Anderson, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2012-02-13
- Volume
- 85
- Issue
- 2
- Pages
- 026107-026107
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2327974553
- Cited by
- 314
- References
- 10
- FWCI
- 13.14
- Type
- journal article
- Language
- en
- Open access
- closed
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.