Phase transition in random distance graphs on the torus

DOI10.1017/jpr.2017.63zbMath1396.05096arXiv1611.05771OpenAlexW2963951763MaRDI QIDQ4684920

Tatyana S. Turova, George M. Napolitano, Fioralba Ajazi

Publication date: 26 September 2018

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

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

zbMATH Keywords

largest connected componentinhomogeneous random graphrandom distance graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85) Distance in graphs (05C12)

Related Items (3)

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Networks of random trees as a model of neuronal connectivity ⋮ Accelerated information dissemination on networks with local and global edges

Cites Work

• Unnamed Item
• Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs
• Scale-free percolation
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Novel scaling limits for critical inhomogeneous random graphs
• The largest component in a subcritical random graph with a power law degree distribution
• On the spread-out limit for bond and continuum percolation
• Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• The Largest Component in Subcritical Inhomogeneous Random Graphs
• A simple coupling of renewal processes
• Random Geometric Graphs
• The phase transition in inhomogeneous random graphs
• Spread‐out percolation in ℝ^d
• The Multiplicative Process

This page was built for publication: Phase transition in random distance graphs on the torus