Giant components in random temporal graphs

DOI10.1137/24M1673206MaRDI QIDQ7230403zbMATH OpenFDO

Authors Ruben Becker, Arnaud Casteigts, Pilu Crescenzi, Bojana Kodric, Michael Raskin, Malte Renken, Victor Zamaraev

Publication date 17 April 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1673206

zbMATH Keywords

Erdős-Rényi random graphrandom temporal graphsharp thresholdtemporal connected componenttemporal connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A critical point for random graphs with a given degree sequence
• Assigning times to minimise reachability in temporal graphs
• Broadcasting in dynamic radio networks
• Collective dynamics of `small-world' networks
• Connectivity and inference problems for temporal networks
• Deleting edges to restrict the size of an epidemic in temporal networks
• Emergence of Scaling in Random Networks
• Evolving graphs: dynamical models, inverse problems and propagation
• Finding temporal paths under waiting time constraints
• Flooding time of edge-Markovian evolving graphs
• How fast can we reach a target vertex in stochastic temporal graphs?
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 7559396 (Why is no real title available?)
• Increasing paths in random temporal graphs
• Introduction to Random Graphs
• Network science. With Márton Pósfai
• Networks
• On the existence of a factor of degree one of a connected random graph
• On the size of temporal cliques in subcritical random temporal graphs
• On the strength of connectedness of a random graph
• Parsimonious flooding in dynamic graphs
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Random graphs.
• Sharp thresholds in random simple temporal graphs
• Temporal graph classes: a view through temporal separators
• Temporal network theory
• The complexity of optimal design of temporally connected graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• The transitive closure of a random digraph
• Weighted sums of certain dependent random variables

This page was built for publication: Giant components in random temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230403)