ArticleMultiscale modeling & simulation : a SIAM interdisciplinary journal2017
EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS
Article in Multiscale modeling & simulation : a SIAM interdisciplinary journal, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 24 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
24 citing papers in PubMed.
- Graph and Hypergraph Theories Applied to Dynamic Protein-Protein Interaction Network Analysis, and Deep-Learning Frameworks for Protein Complex Network Prediction.International journal of molecular sciences · 2026Review
- Persistent cycles and network resilience: a hypernetwork-based framework for temporal graph analysis.Scientific reports · 2026Article
- Dynamics of temporal influence in polarised networks.PloS one · 2025Article
- A dandelion structure of eigenvector preferential attachment networks.Scientific reports · 2024Article
- Node-layer duality in networked systems.Nature communications · 2024Article
- Eigenvector centrality for multilayer networks with dependent node importance.Complex networks & their applications. International Conference on Complex Networks and Their Applications · 2024Article
- A generalized eigenvector centrality for multilayer networks with inter-layer constraints on adjacent node importance.Applied network science · 2024Article
- Node Importance Identification for Temporal Networks Based on Optimized Supra-Adjacency Matrix.Entropy (Basel, Switzerland) · 2022Article
- Exploring Risk Factors in Suicidal Ideation and Attempt Concept Cooccurrence Networks.AMIA ... Annual Symposium proceedings. AMIA Symposium · 2022Article
- Emergence of hierarchy in networked endorsement dynamics.Proceedings of the National Academy of Sciences of the United States of America · 2021Article
- Complex Contagion Features without Social Reinforcement in a Model of Social Information Flow.Entropy (Basel, Switzerland) · 2020Article
- An exploration of the knowledge structure in studies on old people physical activities inJournal of exercise rehabilitation · 2020Article
- Vaccination strategies on dynamic networks with indirect transmission links and limited contact information.PloS one · 2020Article
- A tensor-based framework for studying eigenvector multicentrality in multilayer networks.Proceedings of the National Academy of Sciences of the United States of America · 2019Article
- Trip Centrality: walking on a temporal multiplex with non-instantaneous link travel time.Scientific reports · 2019Article
- Effect of Inter-layer Coupling on Multilayer Network Centrality Measures.Journal of the Indian Institute of Science · 2019Article
- Dynamic graph metrics: Tutorial, toolbox, and tale.NeuroImage · 2018Article
- Popularity and Novelty Dynamics in Evolving Networks.Scientific reports · 2018Article
- Global spectral clustering in dynamic networks.Proceedings of the National Academy of Sciences of the United States of America · 2018Article
- Temporal walk based centrality metric for graph streams.Applied network science · 2018Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.