Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Network analysis›Temporal Network Analysis — Dynamic Networks
Process / pipeline

Temporal Network Analysis — Dynamic Networks

Temporal Network Analysis (Dynamic Networks) · Also known as: dynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks)

Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system.

ScholarGate
  1. Process / pipeline
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Temporal Network Analysis
Centrality AnalysisCommunity DetectionSocial Network AnalysisBayesian Temporal Networ…Dynamic Community Detect…Dynamic Degree CentralityDynamic Ego Network Anal…Dynamic Eigenvector Cent…Dynamic Exponential Rand…Dynamic Modularity Analy…

+15 more

When to use it

Temporal network analysis applies whenever the sequence or timing of interactions matters and cannot be discarded. It is well suited to contact tracing, information cascade studies, organisational communication logs, and any domain where the arrow of time governs reachability. The method requires time-stamped relational data (continuous, binary, or date-valued), a time series or panel data structure, and a node count of at least 20. It fits exploratory, predictive, and descriptive research purposes. Do not use it when timestamps are unavailable or unreliable; in such cases standard static network analysis is the correct choice.

Strengths & limitations

Strengths
  • Preserves causal ordering of contacts, making reachability and diffusion estimates accurate in a way that static graphs cannot match.
  • Handles both contact-sequence and windowed-snapshot representations, offering flexibility for different data resolutions.
  • Applicable across health, social, economic, and biological domains wherever time-stamped relational data exist.
  • Temporal centrality and latency metrics reveal bottlenecks and superspreaders invisible in static projections.
Limitations
  • Requires reliably and consistently recorded timestamps; poorly synchronised clocks or missing event times render the analysis invalid.
  • Window size in snapshot representations is a free parameter that substantially shapes all derived metrics; no single universally correct choice exists.
  • Computationally more demanding than static network analysis, particularly for large event streams or fine temporal resolution.
  • Fewer than 20 nodes is too small to detect meaningful temporal patterns; the method should not be used on very small networks.

Frequently asked

What is the difference between a temporal network and a static network?

A static network collapses all observed interactions into a single fixed graph, losing timing information. A temporal network retains the moment at which each edge appears, so that reachability, centrality, and diffusion can be computed respecting the actual causal order of events. A node pair that looks directly connected in a static graph may have no valid temporal path if their shared contacts occur in the wrong chronological order.

Contact sequence or windowed snapshots — which representation should I choose?

Contact sequences preserve full temporal resolution and are preferred when precise event timing is available and relevant. Windowed snapshots trade resolution for analytical convenience: each window yields a static graph that standard tools can handle. The downside is that the window size is a free parameter that strongly influences results; always run a sensitivity analysis over different window sizes and report the finding.

How many nodes do I need?

The practical lower bound is around 20 nodes. Below this threshold the network is too small to yield meaningful temporal patterns, and standard descriptive network statistics are the more appropriate tool.

Can temporal network analysis establish causality?

It provides a necessary condition: for one node to causally influence another, a valid temporal path connecting them in chronological order must exist. However, the existence of such a path does not by itself establish causation. If causality is the research goal, temporal path analysis must be conducted and confounders must be controlled through appropriate study design.

Sources

  1. Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125. DOI: 10.1016/j.physrep.2012.03.001 ↗
  2. Masuda, N. & Lambiotte, R. (2016). A Guide to Temporal Networks. World Scientific. DOI: 10.1142/q0033 ↗

How to cite this page

ScholarGate. (2026, June 1). Temporal Network Analysis (Dynamic Networks). ScholarGate. https://scholargate.app/en/network-analysis/temporal-network-analysis

Related methods

Centrality AnalysisCommunity DetectionSocial Network Analysis

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Centrality AnalysisNetwork analysis↔ compare
  • Community DetectionNetwork analysis↔ compare
  • Social Network AnalysisNetwork analysis↔ compare
Compare side by side →

Referenced by

Bayesian Temporal Network AnalysisDynamic Community DetectionDynamic Degree CentralityDynamic Ego Network AnalysisDynamic Eigenvector CentralityDynamic Exponential Random Graph ModelDynamic Modularity AnalysisDynamic PageRankDynamic Stochastic Block ModelDynamic Two-Mode Network AnalysisEgo Network AnalysisGraph Neural Network (Network Analysis)Multilayer Network AnalysisMultilayer Social Network AnalysisMultilayer Temporal Network AnalysisNetwork Diffusion ModelsNetwork Resilience AnalysisSmall-World and Scale-Free Network AnalysisTemporal Community DetectionTemporal Multiplex Network AnalysisTemporal Two-Mode Network AnalysisWeighted Temporal Network Analysis

Similar methods

Temporal Network Diffusion AnalysisTemporal Social Network AnalysisWeighted Temporal Network AnalysisMultilayer Temporal Network AnalysisTemporal Multiplex Network AnalysisDynamic Closeness CentralityTemporal Degree CentralityTemporal Betweenness Centrality

Related reference concepts

Network AnalysisNetwork Analysis in the HumanitiesComputational SociologyGraph and Network VisualizationNetwork Formation and Analysis: TheoryDisease Transmission and Dynamics

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Temporal Network Analysis (Temporal Network Analysis (Dynamic Networks)). Retrieved 2026-07-21 from https://scholargate.app/en/network-analysis/temporal-network-analysis · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Holme & Saramäki (2012) — seminal framework
Year
2012
Type
Dynamic graph analysis
DataStructure
Time-stamped edge lists or windowed snapshots
MinimumNodes
20
Difficulty
Intermediate (3/5)
Output
Temporal centrality, reachability, event-driven diffusion metrics
Related methods
Centrality AnalysisCommunity DetectionSocial Network Analysis
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account