Cover Image

Critical first passage percolation on random graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhamidi, Shankar, Durrett, Rick, Huang, Xiangying
Format:	Preprint
Published:	2024
Subjects:	Probability 60C05(primary) 05C80, 90B15 (secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sharp thresholds for NAC-colourings and stable cuts in random graphs
by: Clinch, Katie, et al.
Published: (2025)

Partial orders and monotonicity of logarithmic depth and height in preferential attachment trees
by: Mönch, Christian
Published: (2026)

Age-dependent random connection models with arc reciprocity: clustering and connectivity
by: Lüchtrath, Lukas, et al.
Published: (2026)

Sharp Thresholds for Factors in Random Graphs
by: Burghart, Fabian, et al.
Published: (2024)

The hitting time of nice factors
by: Burghart, Fabian, et al.
Published: (2024)

Random intersection graphs with communities
by: van der Hofstad, Remco, et al.
Published: (2018)

Co-evolving dynamic networks
by: Banerjee, Sayan, et al.
Published: (2022)

Cutoff for random Cayley graphs of nilpotent groups
by: Hermon, Jonathan, et al.
Published: (2024)

Random Walks and the Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Random Walks and the Best Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Board games, random boards and long boards
by: Shaviv, Ary
Published: (2021)

Persistent hubs in CMJ branching processes with independent increments and preferential attachment trees
by: Iyer, Tejas
Published: (2024)

On a sufficient condition for explosion in CMJ branching processes and applications to recursive trees
by: Iyer, Tejas
Published: (2023)

Competing types in preferential attachment graphs with community structure
by: Haslegrave, John, et al.
Published: (2022)

Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs
by: Bhamidi, Shankar, et al.
Published: (2024)

Subcritical annulus crossing in spatial random graphs
by: Jacob, Emmanuel, et al.
Published: (2024)

A Critical Probability for Biclique Partition of $G_{n,p}$
by: Bohman, Tom, et al.
Published: (2022)

The phase transition in bounded-size Achlioptas processes
by: Riordan, Oliver, et al.
Published: (2017)

Optimal subgraphs in geometric scale-free random graphs
by: Michielan, Riccardo, et al.
Published: (2024)

Attribute network models, stochastic approximation, and network sampling and ranking algorithms
by: Antunes, Nelson, et al.
Published: (2023)

All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance
by: Lüchtrath, Lukas
Published: (2024)

First passage percolation on Erdős-Rényi graphs with general weights
by: Daly, Fraser, et al.
Published: (2023)

The hard-core model in graph theory
by: Davies, Ewan, et al.
Published: (2025)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

Upper bounds on the odd graceful chromatic number of graphs
by: Afifurrahman, Muhammad, et al.
Published: (2025)

A logical limit law for $231$-avoiding permutations
by: Albert, Michael, et al.
Published: (2022)

Phase transitions for contact processes on sparse random graphs via metastability and local limits
by: Jahnel, Benedikt, et al.
Published: (2025)

Factor of iid colorings of trees
by: Thornton, Riley
Published: (2024)

Traces left by random walks on large random graphs: local limits
by: Dereich, Steffen
Published: (2024)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Non-equilibrium coagulation processes and subcritical percolation on evolving networks
by: Banerjee, Sayan, et al.
Published: (2025)

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)

Shotgun assembly of random regular graphs
by: Huang, Brice, et al.
Published: (2015)

Reconstruction of Line-Embeddings of Graphons
by: Janssen, Jeannette, et al.
Published: (2020)

Parities in random Latin squares
by: Kwan, Matthew, et al.
Published: (2025)

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

Spectral gap and edge universality of dense random regular graphs
by: He, Yukun
Published: (2022)

Symmetric Union Closed Families
by: M, Nived J
Published: (2024)

Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2024)