Speeding up non-Markovian first-passage percolation with a few extra edges

DOI10.1017/apr.2018.39zbMath1430.60087arXiv1708.09652OpenAlexW2962782794WikidataQ128940350 ScholiaQ128940350MaRDI QIDQ5215028

Gábor Pete, Alexey N. Medvedev

Publication date: 5 February 2020

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.09652

zbMATH Keywords

Galton-Watson treenon-Markovian processSI modeltemporal networkfirst-passage percolationErdős-Rényi graphspreading phenomenabursty time seriesnear-critical random graphPólya urn process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Time-dependent percolation in statistical mechanics (82C43)

Related Items (1)

Speeding up non-Markovian first-passage percolation with a few extra edges

Cites Work

• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Critical random graphs: limiting constructions and distributional properties
• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• The continuum random tree. I
• Asymptotic fringe distributions for general families of random trees
• A time-dependent version of Pólya's urn
• Random trees and applications
• Percolation theory and first-passage percolation
• Subdiffusive behavior of random walk on a random cluster
• On Strassen's theorem on stochastic domination
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Random enriched trees with applications to random graphs
• Recurrence of distributional limits of finite planar graphs
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
• First passage percolation on random graphs with finite mean degrees
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• The continuum random tree. III
• Universality for first passage percolation on sparse random graphs
• The continuum limit of critical random graphs
• Processes on unimodular random networks
• Probability on Trees and Networks
• Random Graphs and Complex Networks
• The mixing time of the giant component of a random graph
• Anatomy of a young giant component in the random graph
• First Passage Percolation on the Erdős–Rényi Random Graph
• 50 Years of First-Passage Percolation
• On the Altitude of Nodes in Random Trees
• The Structure and Function of Complex Networks
• Nonuniversality of weighted random graphs with infinite variance degree
• Speeding up non-Markovian first-passage percolation with a few extra edges
• The front of the epidemic spread and first passage percolation
• The birth of the giant component
• The Existence of Probability Measures with Given Marginals
• Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding up non-Markovian first-passage percolation with a few extra edges