Skip to content
Preprint

Spatial Dependence in Directed Preferential-Attachment Networks

Jul 2026 · 0 citations · 32 references
Mathematics

TL;DR

This work extends Preferential attachment (PA) to spatial co-movement through a directed PA model whose out- and in-node weights follow temporally persistent Gaussian-process lognormal fields, and derives a strictly concave inverse that recovers the in-weights from terminal degree proportions.

Abstract

Spatially embedded directed networks, such as airline networks, often exhibit simultaneous high activity at nearby nodes. Preferential attachment (PA) explains hub dominance. We extend it to spatial co-movement through a directed PA model whose out- and in-node weights follow temporally persistent Gaussian-process lognormal fields. Under sublinear PA, out-degree proportions converge to explicit normalized powered weights, whereas self-loop exclusion yields a coupled in-degree limit. We derive a strictly concave inverse that recovers the in-weights from terminal degree proportions. For ordered network histories, we develop a minorization-maximization (MM) weight estimator and profile likelihood for the PA exponent; temporal pre-whitening and a spatial quasi-likelihood estimate the latent covariance. Simulations verify transmission of distance-decaying dependence and show how random segment volume creates a distance-independent common mode in raw degrees. An analysis of U.S. domestic flights (2015-2019) separates network-wide volume variation from a short-range spatial component. An observed-volume reconstruction reproduces the raw-degree common mode, and the fitted field yields an exploratory co-exceedance transition scale of roughly 150 km. A per-carrier analysis of European air traffic also reveals the same decomposition.

View source

Similar papers

Preprint Jul 2026

Hub Neighbor-Degree Diagnostics for Sparse Random Graphs

Networks with nearly identical degree distributions can place their hubs in sharply different neighborhoods. We develop a model diagnostic based on the mean degree of the neighbors of a degree-$k$ vertex. Under rank-one inhomogeneous random graphs, this statistic has degree-invariant centering and $k^{-1/2}$ fluctuatio...

Qian Hui, Tiandong Wang · 0 citations
Aug 2026

Vertex-level diffusion scaling from resistance distance.

The analysis of random walks on networks often relies on global quantities that average over nodes, thereby masking local differences in diffusion speed. This study introduces a vertex-level quantity Hi, defined as the finite-window fitted scaling exponent of the mean squared resistance distance ⟨Ωi2(t)⟩∼Cit2Hi from a...

Chun-Xiao Nie · 0 citations
Open access Jul 2026

Zealots and Preachers: A Heterogeneous Node–Edge Diffusion Model on Networks

The Zealot–Preacher model is introduced, a generalized diffusion framework on networks with simultaneous heterogeneity at the node and edge levels that accommodates both binary contagion and continuous consensus dynamics and nests standard homogeneous diffusion as a special case.

Ricardo Gimeno, Ruth Mateos de Cabo · 0 citations
Preprint Sep 2026

COSTA: Covariance-Optimized Design and Causal Inference under Network-Temporal Interference

Experiments on networks observed over time face network spillovers, temporal carryover, and dependence deliberately introduced by the design. We propose COSTA---Covariance-Optimized Spatiotemporal Treatment Allocation---a joint Bernoulli design for unit--time assignments. Under common treatment marginals and a nonnegat...

Qian-Yi Chen, Bo Li, Yong Qin et al. · 0 citations
Open access Jul 2026

Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks

A sparse optimal control framework built on the Network Drift-Diffusion Model (NDDM) is proposed, which shows that the best centrality choice depends strongly on the network topology, and the system undergoes phase transitions as control parameters vary.

Bo Wang · 0 citations
Preprint Sep 2026

Statistical Language Competition Model with Dynamic Edge Weighting on a Random Network

A dynamic edge-weighting mechanism that reinforces social ties between co-minority speakers by an additive increment $\Delta$ and a probabilistic agent-based framework governing language switching via a weighted majority rule are extended.

Somyaranjan Chakra, Mohit Anand Madhesia, Shradha Mishra · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.