Searcharxiv⌕ Search

arXiv · 2611.16817

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tiandong Wang. 2026-11-12. Automatic Threshold Selection Leaves Finite-Degree Bias in Network Power-Law Fits. https://searcharxiv.com/abs/2611.16817

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

On Minimal Observation Time for Recovering Latent Hawkes Networks

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST↗

Bidirectional Random Projections

This paper analyzes bidirectional random projections for ordinary least squares (OLS) regression under the fixed design setting. Let $(X, Y) \in \mathbb{R}^{n\times p}\times\mathbb{R}^{n}$ be a sample and $W \in \mathbb{R}^{n_1\times n}$, $R \in \mathbb{R}^{p\times p_1}$ be two random projections. We develop an expected excess loss bound for the OLS estimator built on $(WXR, WY)$, extending an established bound for the OLS estimator built on $(XR, Y)$. Our analysis shows that our bound is larger and the gap between the two bounds decays at a rate of approximately $O(1/n_1)$. These findings are confirmed by numerical results.

math.ST↗

Asymptotics for Model Selection in Probabilistic Principal Component Analysis

The probabilistic formulation of principal component analysis promises statistically grounded solutions to the problem of selecting the number of principal components. However, developing tractable model selection methods is complicated by the fact that the probabilistic principal component analysis (PPCA) model exhibits non-standard large sample asymptotics at model singularities, where the Fisher information matrix does not have full rank. In this work, tools from singular learning theory are used to provide a complete description of the marginal likelihood asymptotics for PPCA. The singular Bayesian information criterion (sBIC) along with our asymptotic results provides an effective procedure for selecting the number of principal components. In particular, the sBIC corrects for the overpenalization of the standard dimension-based BIC, which leads to too few principal components being selected, while also selecting the smallest true model with probability converging to one. Our framework extends beyond PPCA, where we also provide expressions for the sBIC that can be used to select between PPCA and factor analysis models. In both simulations and on real data the effectiveness of the proposed sBIC methodology is demonstrated.

math.ST↗