Automatic Threshold Selection Leaves Finite-Degree Bias in Network Power-Law Fits

Minimum-distance fitting selects a degree threshold and a power-law exponent from the same network. We study the procedure that fits a continuous Pareto law with the Hill estimator and minimizes the Kolmogorov--Smirnov distance over retained ranks. For homogeneous linear preferential attachment and Norros--Reittu graphs with Pareto weights, we derive the joint limiting law of the selected rank, retained fraction of the threshold tie, and exponent error. The selector retains of order $n^{2/(α+2)}$ of $n$ vertices, where $α$ is the survival exponent. At this rank, integer spacing and finite-degree departures from a Pareto tail have the same order as sampling fluctuations. The exponent estimate is consistent and retains a shift on the scale used for confidence intervals. For integer degree laws whose tail sums have a first-order inverse-degree expansion, adding the retained tie fraction divided by the threshold to the Hill statistic removes the leading contribution of the tie. Under homogeneous preferential attachment with a fixed known number of edges per new vertex, removing the remaining model-specific term and calibrating for selection gives confidence intervals with asymptotically exact coverage. Observed networks show sensitivity of the fitted exponent and the classification of degree variance to threshold ties. Simulations assess interval coverage and show improved pooled connectivity predictions after correction under both specified graph laws. Changes to the Norros--Reittu weight distribution can reverse the prediction gain.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16817
Primary Topic
Complex Network Analysis Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Automatic Threshold Selection Leaves Finite-Degree Bias in Network Power-Law Fits

Tiandong Wang
arXiv (Cornell University)
Complex Network Analysis Techniques
preprint

Automatic Threshold Selection Leaves Finite-Degree Bias in Network Power-Law Fits

Tiandong Wang
preprint en

Abstract

Minimum-distance fitting selects a degree threshold and a power-law exponent from the same network. We study the procedure that fits a continuous Pareto law with the Hill estimator and minimizes the Kolmogorov--Smirnov distance over retained ranks. For homogeneous linear preferential attachment and Norros--Reittu graphs with Pareto weights, we derive the joint limiting law of the selected rank, retained fraction of the threshold tie, and exponent error. The selector retains of order $n^{2/(α+2)}$ of $n$ vertices, where $α$ is the survival exponent. At this rank, integer spacing and finite-degree departures from a Pareto tail have the same order as sampling fluctuations. The exponent estimate is consistent and retains a shift on the scale used for confidence intervals. For integer degree laws whose tail sums have a first-order inverse-degree expansion, adding the retained tie fraction divided by the threshold to the Hill statistic removes the leading contribution of the tie. Under homogeneous preferential attachment with a fixed known number of edges per new vertex, removing the remaining model-specific term and calibrating for selection gives confidence intervals with asymptotically exact coverage. Observed networks show sensitivity of the fitted exponent and the classification of degree variance to threshold ties. Simulations assess interval coverage and show improved pooled connectivity predictions after correction under both specified graph laws. Changes to the Norros--Reittu weight distribution can reverse the prediction gain.

arXiv (Cornell University)
Complex Network Analysis Techniques
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