Sharp cluster-size decay and logarithmic phase boundaries in Pareto-weighted spatial random graphs

We study supercritical kernel-based spatial random graphs with Pareto vertex weights on Poisson and lattice vertex sets, a framework containing continuum scale-free percolation, geometric inhomogeneous random graphs and the age-dependent random connection model. When long edges strictly dominate surface order, we determine the sharp decay of the finite-cluster size distribution and the order of the second-largest component in a box. In the high–high regime we prove the conjectured exponent ζ_hh on both vertex sets, including the range τ < σ + 1 where the previously known upper exponent did not match; at (d, α, τ, σ) = (2, 2, 5/2, 2) it improves from 4/9 to 2/3. At ties between long-edge mechanisms we identify the logarithmic corrections; on the high–low/high–high tie the correction is (log k)^(b/α) with b/α < 1, so the number of tied mechanisms does not determine it. At high density, deterministic threshold connections satisfy matching rooted and free-box surface-order laws, and randomly thinned ones matching rooted laws. On the lattice, local seeds exist at every strictly supercritical parameter with a positive long-edge exponent, including retention one and dimension one.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24223736
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharp cluster-size decay and logarithmic phase boundaries in Pareto-weighted spatial random graphs

Shardul Mishra
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Sharp cluster-size decay and logarithmic phase boundaries in Pareto-weighted spatial random graphs

Shardul Mishra
preprint en

Abstract

We study supercritical kernel-based spatial random graphs with Pareto vertex weights on Poisson and lattice vertex sets, a framework containing continuum scale-free percolation, geometric inhomogeneous random graphs and the age-dependent random connection model. When long edges strictly dominate surface order, we determine the sharp decay of the finite-cluster size distribution and the order of the second-largest component in a box. In the high–high regime we prove the conjectured exponent ζ_hh on both vertex sets, including the range τ < σ + 1 where the previously known upper exponent did not match; at (d, α, τ, σ) = (2, 2, 5/2, 2) it improves from 4/9 to 2/3. At ties between long-edge mechanisms we identify the logarithmic corrections; on the high–low/high–high tie the correction is (log k)^(b/α) with b/α < 1, so the number of tied mechanisms does not determine it. At high density, deterministic threshold connections satisfy matching rooted and free-box surface-order laws, and randomly thinned ones matching rooted laws. On the lattice, local seeds exist at every strictly supercritical parameter with a positive long-edge exponent, including retention one and dimension one.

Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon