Cover Image

Cover and Hitting Times of Hyperbolic Random Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kiwi, Marcos, Schepers, Markus, Sylvester, John
Format:	Preprint
Published:	2022
Subjects:	Probability Discrete Mathematics Combinatorics 05C80, 60J10, 60G40
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
by: Sylvester, John
Published: (2021)

Multiple Random Walks on Graphs: Mixing Few to Cover Many
by: Rivera, Nicolás, et al.
Published: (2020)

Time-Biased Random Walks and Robustness of Expanders
by: Olesker-Taylor, Sam, et al.
Published: (2024)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Hitting times in the stochastic block model
by: Ottolini, Andrea
Published: (2024)

The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)

Geometric Bounds on the Fastest Mixing Markov Chain
by: Olesker-Taylor, Sam, et al.
Published: (2021)

Small maximal clusters are very unlikely in critical random graphs
by: De Ambroggio, Umberto
Published: (2024)

Large independent sets in recursive Markov random graphs
by: Gupte, Akshay, et al.
Published: (2022)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

On the concentration of the chromatic number of random graphs
by: Surya, Erlang, et al.
Published: (2022)

The clique chromatic number of sparse random graphs
by: Fernandez V, Manuel, et al.
Published: (2024)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

Functionality of Random Graphs
by: Sylvester, John, et al.
Published: (2024)

Ordering and Convergence of Large Degrees in Random Hyperbolic Graphs
by: Gassmann, Loïc
Published: (2024)

Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)

Preferential Attachment When Stable
by: Janson, Svante, et al.
Published: (2018)

Temporal Exploration of Random Spanning Tree Models
by: Baguley, Samuel, et al.
Published: (2025)

The rank of sparse random matrices
by: Coja-Oghlan, Amin, et al.
Published: (2019)

A Random Walk Approach to Broadcasting on Random Recursive Trees
by: Althaus, Ernst, et al.
Published: (2024)

Wasserstein distances between ERGMs and Erdős-Rényi models
by: Winstein, Vilas
Published: (2026)

Two-Point Concentration of the Domination Number of Random Graphs
by: Bohman, Tom, et al.
Published: (2024)

Contiguity and remote contiguity of some random graphs
by: Kleijn, B. J. K., et al.
Published: (2024)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)

Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
by: Erdős, Péter L., et al.
Published: (2022)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

Randomized Zero Forcing
by: Geneson, Jesse, et al.
Published: (2026)

Limits of Weighted Graphs via Random Quotients
by: Levin, Eitan, et al.
Published: (2025)

Random trees with local catastrophes: the Brownian case
by: Carrance, Ariane, et al.
Published: (2024)

Label propagation on binomial random graphs
by: Kiwi, Marcos, et al.
Published: (2023)

Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors
by: Long, Christopher D.
Published: (2026)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

A large deviation principle for block models
by: Borgs, Christian, et al.
Published: (2020)

Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025)

On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

Graph connectivity with fixed endpoints in the random-connection model
by: Liu, Qingwei, et al.
Published: (2023)