Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Austin, Henry, Mertzios, George B., Spirakis, Paul G. |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021)
by: Mertzios, George B., et al.
Published: (2021)
On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)
by: Mertzios, George B., et al.
Published: (2024)
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)
by: Bangachev, Kiril, et al.
Published: (2024)
On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)
by: Chinyaev, Boris
Published: (2025)
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)
by: Galanis, Andreas, et al.
Published: (2026)
Matchings on Random Regular Hypergraphs
by: Li, Zhongyang
Published: (2021)
by: Li, Zhongyang
Published: (2021)
On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
by: Bangachev, Kiril, et al.
Published: (2024)
by: Bangachev, Kiril, et al.
Published: (2024)
Counterexamples to an Extremal Conjecture for Random Cycle-Factors
by: Gajjala, Rishikesh
Published: (2026)
by: Gajjala, Rishikesh
Published: (2026)
Random 0/1-polytopes expand rapidly
by: Guo, He, et al.
Published: (2026)
by: Guo, He, et al.
Published: (2026)
Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)
by: Altschuler, Dylan J.
Published: (2023)
Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)
by: De Ambroggio, Umberto, et al.
Published: (2024)
Temporal Exploration of Random Spanning Tree Models
by: Baguley, Samuel, et al.
Published: (2025)
by: Baguley, Samuel, et al.
Published: (2025)
The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)
by: de Colnet, Alexis, et al.
Published: (2026)
Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
The Careless Coupon Collector's Problem
by: Cruciani, Emilio, et al.
Published: (2026)
by: Cruciani, Emilio, et al.
Published: (2026)
Noise sensitivity on affine Weyl groups
by: Tanaka, Ryokichi
Published: (2024)
by: Tanaka, Ryokichi
Published: (2024)
Theory of Stochastic Drift
by: Kötzing, Timo
Published: (2024)
by: Kötzing, Timo
Published: (2024)
Cutoff for congestion dynamics and related generalized exclusion processes
by: Tanaka, Ryokichi
Published: (2025)
by: Tanaka, Ryokichi
Published: (2025)
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
by: Galanis, Andreas, et al.
Published: (2023)
by: Galanis, Andreas, et al.
Published: (2023)
Subtractive random forests
by: Broutin, Nicolas, et al.
Published: (2022)
by: Broutin, Nicolas, et al.
Published: (2022)
Multicoloured Hardcore Model: Fast Mixing and Queueing
by: Olesker-Taylor, Sam
Published: (2024)
by: Olesker-Taylor, Sam
Published: (2024)
Probability-graphons: Limits of large dense weighted graphs
by: Abraham, Romain, et al.
Published: (2023)
by: Abraham, Romain, et al.
Published: (2023)
Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
by: Chen, Zongchen, et al.
Published: (2023)
by: Chen, Zongchen, et al.
Published: (2023)
On sampling diluted Spin Glasses using Glauber dynamics
by: Efthymiou, Charilaos, et al.
Published: (2024)
by: Efthymiou, Charilaos, et al.
Published: (2024)
Exact Thresholds for Noisy Non-Adaptive Group Testing
by: Chen, Junren, et al.
Published: (2024)
by: Chen, Junren, et al.
Published: (2024)
Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)
by: Carlson, Charlie, et al.
Published: (2024)
Multiset Metric Dimension of Binomial Random Graphs
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)
by: Isaev, Mikhail, et al.
Published: (2026)
A threshold for online balancing of sparse i.i.d. vectors
by: Altschuler, Dylan J., et al.
Published: (2025)
by: Altschuler, Dylan J., et al.
Published: (2025)
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)
by: Gurvits, Leonid, et al.
Published: (2023)
Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)
by: Díaz, Alberto Espuny, et al.
Published: (2022)
Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)
by: Johnston, Tom, et al.
Published: (2022)
Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)
by: Addario-Berry, Louigi, et al.
Published: (2025)
Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)
by: Li, Ray, et al.
Published: (2025)
Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)
by: Alekseev, Yaroslav, et al.
Published: (2025)
Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)
by: Bouvel, Mathilde, et al.
Published: (2024)
A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)
by: Fang, Xuan, et al.
Published: (2025)
Similar Items
-
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025) -
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022) -
The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021) -
On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024) -
Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)