Sharp Thresholds in Random Simple Temporal Graphs

by   Arnaud Casteigts, et al.

A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological order (i.e. a temporal path). In this paper, we consider a simple model of random temporal graph, obtained by assigning to every edge of an Erdős-Rényi random graph G_n,p a uniformly random presence time in the real interval [0, 1]. It turns out that this model exhibits a surprisingly regular sequence of thresholds related to temporal reachability. In particular, we show that at p=log n/n any fixed pair of vertices can a.a.s. reach each other, at 2 log n/n at least one vertex (and in fact, any fixed node) can a.a.s. reach all others, and at 3 log n/n all the vertices can a.a.s. reach each other (i.e. the graph is temporally connected). All these thresholds are sharp. In addition, at p=4 log n/n the graph contains a spanning subgraph of minimum possible size that preserves temporal connectivity, i.e. it admits a temporal spanner with 2n-4 edges. Another contribution of this paper is to connect our model and the above results with existing ones in several other topics, including gossip theory (rumor spreading), population protocols (with sequential random scheduler), and edge-ordered graphs. In particular, our analyses can be extended to strengthen several known results in these fields.


page 1

page 2

page 3

page 4


Giant Components in Random Temporal Graphs

A temporal graph is a graph whose edges appear only at certain points in...

Sparse Temporal Spanners with Low Stretch

A temporal graph is an undirected graph G=(V,E) along with a function th...

Cyclability, Connectivity and Circumference

In a graph G, a subset of vertices S ⊆ V(G) is said to be cyclable if th...

Random k-out subgraph leaves only O(n/k) inter-component edges

Each vertex of an arbitrary simple graph on n vertices chooses k random ...

Increasing paths in random temporal graphs

We consider random temporal graphs, a version of the classical Erdős–Rén...

The complexity of computing optimum labelings for temporal connectivity

A graph is temporally connected if there exists a strict temporal path, ...

Sharp Thresholds in Adaptive Random Graph Processes

Suppose that K_n is the complete graph on vertex set [n], and is a dist...

Please sign up or login with your details

Forgot password? Click here to reset