The longest edge in discrete and continuous long-range percolation

DOI10.1007/S10687-024-00488-YMaRDI QIDQ6635941zbMATH OpenFDO

Authors Arnaud Rousselle, Ercan Sönmez

Publication date 12 November 2024

Published in Extremes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10687-024-00488-Y

zbMATH Keywords

extreme value theorylong-range percolationmaximum edge lengthPoisson approximationrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Central limit and other weak theorems (60F05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Extreme value theory; extremal stochastic processes (60G70) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Graph distances of continuum long-range percolation
• The longest edge of the one-dimensional soft random geometric graph with boundaries
• Random walk on the random connection model
• Long range percolation in stationary point processes
• Sharp asymptotic for the chemical distance in long-range percolation

Cites work

• Fundamentals of Stein's method
• Graph distances of continuum long-range percolation
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 1834589 (Why is no real title available?)
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Long range percolation in stationary point processes
• Mean-field critical behaviour for percolation in high dimensions
• On a continuum percolation model
• On the continuity of the critical value for long range percolation in the exponential case
• On the Ornstein-Zernike equation for stationary cluster processes and the random connection model
• Random walk on the random connection model
• Sharp asymptotic for the chemical distance in long-range percolation
• Simple random walk on long range percolation clusters. I: Heat kernel bounds
• Simple random walk on long-range percolation clusters. II: Scaling limits
• The diameter of a long-range percolation graph
• The diameter of long-range percolation clusters on finite cycles
• The growth of the infinite long-range percolation cluster
• The longest edge of the random minimal spanning tree
• The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
• The random connection model on the torus
• The random connection model: Connectivity, edge lengths, and degree distributions
• Transience, recurrence and critical behavior for long-range percolation
• Two moments suffice for Poisson approximations: The Chen-Stein method

Cited in

(1)

• The longest edge of the one-dimensional soft random geometric graph with boundaries

This page was built for publication: The longest edge in discrete and continuous long-range percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635941)