---
title: Discrete Time Temporal Graphs (DTTGs)
url: https://www.emergentmind.com/topics/discrete-time-temporal-graphs-dttgs
type: topic
---

# Discrete Time Temporal Graphs (DTTGs)

A discrete time temporal graph (DTTG) is a combinatorial structure comprising a finite set of nodes and edges, where each edge is associated with a discrete set of time-labels indicating the specific times at which the edge is available. DTTGs encode dynamic network connectivity with full temporal resolution and serve as a canonical model for evolving graphs in algorithmic, statistical, and dynamic systems studies. They admit several equivalent formalizations and a wide spectrum of algorithmic, statistical, and logical questions.

## 1. Formal Definitions and Model Variants

The standard definition is a triple \(G=(V,E,\lambda)\) where:

- \(V\) is a finite vertex set.
- \(E \subseteq \binom{V}{2}\) is the underlying static edge set.
- \(\lambda: E \to 2^{\mathbb{Z}}\) assigns to each edge \(e\) a finite set of time-labels \(\lambda(e)\), denoting the (discrete) moments at which \(e\) is present [1310.7898].

**Snapshot view:** Equivalently, a DTTG can be given as a tuple
\[
G = (V, E_1, E_2, \dots, E_T)
\]
where each \(E_t \subseteq \binom{V}{2}\) specifies the edge set at time \(t\) [1503.00278, 2602.12446].

**Edge-labelled view:** Another form uses \((V, E, \lambda: E \to 2^{[T]})\), where \(\lambda(e)\) is the set of (integer) time-steps when \(e\) exists [2602.12446].

**Unifying models:** Generalizations further permit directed edges and mixed temporal edges \((u, t_a, v, t_b)\), thus supporting both instantaneous edges and transitions across multiple time steps [1402.3488].

**Special cases:**
- **Uniform random temporal graphs (UNI-CASE):** Each edge is assigned exactly one label, chosen independently and uniformly at random from \([1, a]\); 'normalized' designates \(a = n\), the number of vertices [1310.7898].
- **RWIG (Random Walkers Induced Graphs):** A DTTG generator wherein edge activation is induced by the co-location of independent Markovian random walkers on an underlying graph [2409.08690].

## 2. Temporal Paths, Journeys, and Distance

**Temporal path (journey):** A temporal path from \(u\) to \(v\) is a time-ordered sequence
\[
(u_0, u_1, t_1), (u_1, u_2, t_2), \dots, (u_{k-1}, u_k, t_k)
\]
with \(u_0 = u\), \(u_k = v\), \(\{u_{i-1}, u_i\} \in E\), \(t_i \in \lambda(\{u_{i-1}, u_i\})\), and \(t_1 < t_2 < \dots < t_k\) [1310.7898, 1503.00278, 2602.12446].

**Arrival-time:** Defined as \(t_k\), the time-label of the final edge in the path.

**Temporal distance:** For any \((u,v)\), the minimal arrival time over all temporal paths from \(u\) to \(v\):
\[
\delta'(u, v) = \min\,\{ \text{arrival-time} \mid \text{path from } u \text{ to } v \}
\]
To avoid undefined values, a slow-path cost \(n'\) may be imposed:
\[
\delta(u, v) := \min\{\delta'(u, v), n'\}
\]
[1310.7898, 2403.13183].

**Reachability:** \(u\) can reach \(v\) temporally if \(\delta(u, v) < \infty\).

## 3. Key Algorithmic and Combinatorial Results

### 3.1 Counting Temporal Paths in Random DTTGs

For the uniform random clique \(K_n\), where each static edge receives a label uniformly at random from \([1, a]\), the expected number of temporal paths of exact length \(k\) is
\[
E[\#\{\text{paths of length }k\}] = \frac{n!\,a!}{(n-k-1)!\;k!\;a^k(a-k)!}
\]
This formula accounts for the combinatorics of simple paths and the distinct, strictly increasing label assignments [1310.7898].

### 3.2 Maximum Expected Temporal Distance and Temporal Diameter

- **Maximum expected temporal distance:**
  \[
  \Delta_{\max}(G) := \max_{u,v \in V} \mathbb{E}[\delta(u, v)]
  \]
- **Temporal diameter:**
  \[
  \mathscr{D}(G) := \mathbb{E}[\max_{u,v \in V} \delta(u, v)]
  \]
Always, \(\mathscr{D}(G) \ge \Delta_{\max}(G)\) [1310.7898].

Closed formulas are derived for specific DTTG classes:
- For a star with i.i.d. labels in \([1, a]\), 
\[
\Delta_{\max}(G_{\rm star}) = \frac{(a-1)(a+1)(a+2)}{6 a^2} + n' \cdot \frac{a+1}{2a}
\]
- For the normalized clique,
\[
\Delta_{\max}(K_n), \mathscr D(K_n) = O(\sqrt{n} (\log n)^2)
\]
[1310.7898].

### 3.3 Algorithmic Problems on DTTGs

Several algorithmic paradigms are central in DTTG analysis:

- **Shortest/foremost journey computation:** Given a starting node and time, find earliest arrival at other nodes. Classical BFS/Dijkstra methods can be used on the (possibly weighted) time-unfolded digraph [0807.2357, 1503.00278].
- **Temporal reachability queries:** Reduced to reachability in the static time-expanded graph [1503.00278].
- **Temporal separation:** Given temporal start/end vertices \((s, z)\), find a minimal node set deleting which blocks all temporal paths from \(s\) to \(z\); complexity is NP-hard on both split and permutation class layers, but fixed-parameter algorithms exist using measures of temporal "change" (e.g., number of layer switches, total Kendall–tau distance) [2105.12003].
- **Matching and covering:** Temporal maximum matching requires that no vertex is matched twice in any \(\Delta\)-window; even for underlying paths, the problem is NP-complete [1905.05304].
- **Diameter shortcut sets:** By static expansion, DTTG diameter can be decreased using shortcut edge sets derived from the corresponding static graph, with construction algorithms and complexity closely paralleling their static counterparts, modulo expansion scaling [2504.01485].

## 4. Metric, Logical, and Statistical Properties

### 4.1 Temporal Centrality and Availability Metrics

Temporal centrality and related notions are computed using the time-unfolded (static) representation \(G_T = (V_T, E_T, w)\) mapping each time-labeled node to a vertex and adding waiting and instantaneous interaction arcs:

- **Temporal proximity \(p(X,Y;t_a,t_b)\):** Minimum total time-weight of any path starting from \((X, t \geq t_a)\) to \((Y, t' \leq t_b)\).
- **Average temporal/geodesic proximity \(P(X,Y), G(X,Y)\):** Averaged over all start times.
- **Temporal availability \(V(X,Y)\):** The fraction of times from which \(Y\) is temporally reachable from \(X\) [0807.2357].

### 4.2 Logical Meta-Theorems on DTTGs

- **MSO and FO meta-theorems:** By static expansion or sliding-window derivative, DTTGs admit meta-algorithms for monadic second-order and local first-order properties, parameterized by tree-width or twin-width of the expansion/derivative graphs:
  - MSO properties are fixed-parameter tractable with respect to the expansion’s tree-width (\(\operatorname{tw}(G_{\to})\)) and formula size [2602.12446].
  - Local FO properties are FPT parameterized by locally bounded sliding-window twin-width (\(\operatorname{dtww}_\Delta(G)\)), independent of the full DTTG lifetime [2602.12446].

### 4.3 Random Models and DTTG Generators

- The RWIG model produces contact sequences via independent random walks; all edge probability and higher-moment statistics have closed forms in terms of the stationary distribution and transition matrices. This enables analytical comparisons to classical static models (e.g., Erdős-Rényi, Barabási–Albert) [2409.08690].

## 5. Applications, Data Structures, and Model Representation

### 5.1 Representation Frameworks

Multiple explicit frameworks capture DTTGs:

- **Edge-labeled lists:** Each edge-time pair \((u,v,t)\) specifies availability; this is most common for algorithmic and data-mining studies [1503.00278, 1310.7898].
- **Snapshot sequences:** Storing each \(G_t\) for \(t = 1, \ldots, T\) directly [1503.00278, 1402.3488].
- **Quadruple-record (mixed-edge) model:** Dynamic edges \((u, t_a, v, t_b)\) accommodate both instantaneous and transit interactions, as well as periodic/cyclic temporal behavior [1402.3488].
- **Succinct compression:** Compressed Suffix Array (CSA)-based data structures support fast interval searches, neighbor queries, and more, with space proportional to the number of temporal contacts via contact encoding and compressed indexing [1812.11244].

### 5.2 Learning and Statistical Models

- **Machine learning architectures:** State-space models, GNN+RNN hybrids, and Transformer-based techniques have all been formulated for DTTGs. Recent methods incorporate explicitly the temporal and structural evolution, using sequence models regularized by the graph Laplacian or multi-scale transformers for learning long-range dependencies [2406.00943, 2302.01018, 2407.18523].
- **Feature representation:** DTTGs provide a canonical temporal backbone for node/edge-level and higher-order statistical tasks, including motif discovery, centrality, epidemic spread modeling, and task-specific prediction [2302.01018, 2409.08690].

### 5.3 Algorithmic Applications

DTTGs are foundational in areas such as:

- Dynamic communication and distributed systems: dynamic connectivity, resilience analysis, temporal message dissemination.
- Computational epidemiology: temporal reachability and contact tracing.
- Transportation and logistics: scheduling, dynamic shortest path, and earliest-arrival routing.
- Model checking and logic: analysis of properties via MSO/FO meta-theorems, temporal variants of classical graph theorems [2602.12446, 2310.12701].

## 6. Complexity, Limitations, and Theoretical Barriers

- **Computational complexity:** Many problems that are tractable in static graphs (such as matching, separation, metric dimension) become NP-hard or even APX-hard when extended to DTTGs, even on highly restricted classes (paths, stars, or cliques with limited labeling) [1905.05304, 2403.13183, 2105.12003].
- **Parameterization and FPT:** Notable fixed-parameter tractable islands exist when parameterizing by temporal "change over time" (number of switching vertices, sum of Kendall–tau distances) or by solution size; kernelization and further reductions are intensely studied [2105.12003, 1905.05304].
- **Limits of expressiveness:** The addition of time increases the expressive power but also the representational cost, especially for dense or long-lived networks. For sufficiently sparse real-world networks, optimal memory is linear in the number of temporal edges [1402.3488, 1812.11244].
- **Random model limitations:** For models such as RWIG, full exact pmfs are computable in closed form but scale combinatorially (Bell number) in the number of walkers, making large-scale enumeration infeasible [2409.08690].

## 7. Open Directions and Research Challenges

Significant challenges and future directions in DTTGs include:

- **Standardized benchmarks and DTTG-specific datasets** to facilitate evaluation and comparison of algorithms [2302.01018].
- **Developing a temporal Weisfeiler–Lehman theory** to characterize expressiveness and distinguishability of temporal structural patterns [2302.01018].
- **Deep DTTG models and long-range dependency learning**, overcoming issues of over-smoothing and vanishing gradients in spatio-temporal architectures [2406.00943, 2407.18523].
- **Approximation and parameterized algorithms** for hard combinatorial problems, especially as the number of time-steps or labels increases [2105.12003, 1905.05304].
- **Integration of domain-knowledge and temporal logic**, to handle application-specific constraints in areas such as network science, epidemiology, and transport [2602.12446].

---

For comprehensive technical details and specific theorems, see [1310.7898] for statistical properties and random models, [2602.12446] for meta-theoretic and logic results, [2105.12003] and [1905.05304] for complexity, separation, and matching, [2409.08690] for analytic models of temporal contact structures, and [2406.00943, 2407.18523, 2302.01018] for recent developments in representation learning and deep temporal graph methods.

Source: https://www.emergentmind.com/topics/discrete-time-temporal-graphs-dttgs