REVIEW 2 cited by
Temporal connectivity of Random Geometric Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Temporal connectivity of Random Geometric Graphs
read the original abstract
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps indicate the propagation of information. We determine a threshold for the existence of monotone increasing paths between all pairs of vertices in temporal random geometric graphs. The results reveal that temporal connectivity appears at a significantly larger edge density than simple connectivity of the underlying random geometric graph. This is in contrast with Erd\H{o}s-R\'enyi random graphs in which the thresholds for temporal connectivity and simple connectivity are of the same order of magnitude. Our results hold for a family of "soft" random geometric graphs as well as the standard random geometric graph.
Forward citations
Cited by 2 Pith papers
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
In two random temporal graph models, each fixed δ-temporal motif has an existence threshold determined by the sparsity min |V|/(|E|−1) over subgraphs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.