A backbone transfer principle for cluster-size decay beyond power laws in spatial random graphs

We give a finite-box transfer principle for spatial random graphs with independent continuous marks and an increasing pair rule. A connected backbone at the volume-k scale gives a second-largest-component bound at speed kF̄(w), where F̄(w) is the mark tail at the backbone level. The transfer needs neither regular variation nor local seeds or upper kernel-growth bounds. For rapidly assortative kernels of the form (a ∨ b) exp{g(a ∧ b)}, with g regularly varying and g(t) = O(t), the matching finite-cluster speed is asymptotic to k times the root-degree tail at k. For g(t) = t^δ and Pareto marks it has order k/(log k)^(b/δ). We also obtain an exact cutoff criterion in the strict high–high regime beyond regular variation of g, sharp logarithmic corrections for stretched-exponential spatial profiles, and high-density surface upper bounds uniform over arbitrary finite mark assignments and bounded Cox media.

Authors

Publication Details

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

A backbone transfer principle for cluster-size decay beyond power laws in spatial random graphs

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

A backbone transfer principle for cluster-size decay beyond power laws in spatial random graphs

Shardul Mishra
preprint en

Abstract

We give a finite-box transfer principle for spatial random graphs with independent continuous marks and an increasing pair rule. A connected backbone at the volume-k scale gives a second-largest-component bound at speed kF̄(w), where F̄(w) is the mark tail at the backbone level. The transfer needs neither regular variation nor local seeds or upper kernel-growth bounds. For rapidly assortative kernels of the form (a ∨ b) exp{g(a ∧ b)}, with g regularly varying and g(t) = O(t), the matching finite-cluster speed is asymptotic to k times the root-degree tail at k. For g(t) = t^δ and Pareto marks it has order k/(log k)^(b/δ). We also obtain an exact cutoff criterion in the strict high–high regime beyond regular variation of g, sharp logarithmic corrections for stretched-exponential spatial profiles, and high-density surface upper bounds uniform over arbitrary finite mark assignments and bounded Cox media.

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