HAL (France)
open access
Giant Components in Random Temporal Graphs *
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erdős-Rényi random graph model. The proposed model is obtained by randomly permuting the edges of an Erdős-Rényi random graph and i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Planarity and number of crossings in general models of random geometric graphs#985751
- Phase transition of random non-uniform hypergraphs#652709
- A Chaining Approach to Canonical Processes with Log-Concave Tails#1050482
- Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking#1297857
- Random convergence of generalized Steiner processes#1201126
Record · ID 1298934
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive