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.
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...
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...
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· Mathematics· 0 citations
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...
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· Frontiers in Computing and I...· 0 citations
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.