Image de couverture de livre

On the jump of the cover time in random geometric graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Martinez, Carlos, Mitsche, Dieter
Format:	Preprint
Publié:	2025
Sujets:	Probability Combinatorics 05C80, 60D05, 05C81
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Mixing time of the random walk on the giant component of the random geometric graph
par: Haaland, Magnus H., et autres
Publié: (2025)

Scaling limits of random graphs
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Majority dynamics on sparse random graphs
par: Chakraborti, Debsoumya, et autres
Publié: (2021)

Universal diameter bounds for random graphs with given degrees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

Label propagation on binomial random graphs
par: Kiwi, Marcos, et autres
Publié: (2023)

Spectral properties of the stochastic block model and their application to hitting times of random walks
par: Löwe, Matthias, et autres
Publié: (2024)

Isomorphisms between dense random graphs
par: Surya, Erlang, et autres
Publié: (2023)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

On the components of random geometric graphs in the dense limit
par: Penrose, Mathew D., et autres
Publié: (2025)

The law of the circumference of sparse binomial random graphs
par: Anastos, Michael, et autres
Publié: (2025)

Large deviations of the giant in supercritical kernel-based spatial random graphs
par: Jorritsma, Joost, et autres
Publié: (2024)

Cluster-size decay in supercritical kernel-based spatial random graphs
par: Jorritsma, Joost, et autres
Publié: (2023)

Note on down-set thresholds
par: Warnke, Lutz
Publié: (2023)

Normal approximation for number of edges in random intersection graphs
par: Rybarczyk, Katarzyna, et autres
Publié: (2025)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

On the upper tail of star counts in random graphs
par: Akhmejanova, Margarita, et autres
Publié: (2025)

Limits of chordal graphs with bounded tree-width
par: Castellví, Jordi, et autres
Publié: (2023)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)

Tripodal structure in undersaturated random graphs
par: DiCarlo, William, et autres
Publié: (2025)

Mixing trichotomy for random walks on directed stochastic block models
par: Bianchi, Alessandra, et autres
Publié: (2025)

Mixing cutoff for simple random walks on the Chung-Lu digraph
par: Bianchi, Alessandra, et autres
Publié: (2024)

Extreme local statistics in random graphs: maximum tree extension counts
par: Araújo, Pedro, et autres
Publié: (2023)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
par: Ignasiak, Dawid, et autres
Publié: (2025)

On the concentration of the chromatic number of random graphs
par: Surya, Erlang, et autres
Publié: (2022)

Graph connectivity with fixed endpoints in the random-connection model
par: Liu, Qingwei, et autres
Publié: (2023)

Isomorphisms between random $d$-hypergraphs
par: Lenoir, Théo
Publié: (2024)

The clique chromatic number of sparse random graphs
par: Fernandez V, Manuel, et autres
Publié: (2024)

Modularity and random graphs
par: McDiarmid, Colin, et autres
Publié: (2025)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
par: Mörters, Peter, et autres
Publié: (2025)

Diameter and mixing time of the giant component in the percolated hypercube
par: Anastos, Michael, et autres
Publié: (2025)

Normal approximation for subgraph count in random hypergraphs
par: Michalczuk, Wojciech, et autres
Publié: (2024)

Tipsy cop and tipsy robber: collisions of biased random walks on graphs
par: Harris, Pamela E., et autres
Publié: (2022)

Upper tail bounds for irregular graphs
par: Basak, Anirban, et autres
Publié: (2025)

Cutoff for random Cayley graphs of nilpotent groups
par: Hermon, Jonathan, et autres
Publié: (2024)

Large Components and Trees of Random Mappings
par: Mutafchiev, Ljuben, et autres
Publié: (2025)

On the Deepest Cycle of a Random Mapping
par: Mutafchiev, Ljuben, et autres
Publié: (2023)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
par: Bohman, Tom, et autres
Publié: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
par: Addario-Berry, Louigi, et autres
Publié: (2026)

The number and structure of connected graphs with a fixed degree sequence
par: Bell, Sasha, et autres
Publié: (2026)

A tail bound for cumulant series for complex functions of independent random variables
par: Isaev, Mikhail
Publié: (2025)