A Statistical Analysis of Diffusion Dynamics in Networks
Abstract
Network diffusion is a well-known model for studying how a quantity in a network propagates to reach a steady state, where its value becomes uniformly distributed across all nodes. Previous studies of network diffusion have mainly focused on the second-smallest eigenvalue of the network Laplacian to determine the timescale associated with the slowest decaying mode. However, this study investigates the eigenspectrum of the network Laplacian in terms of its statistical properties. This method is useful for studying the statistical properties of network diffusion without calculating all eigenvalues, which can be useful for large networks. Additionally, this study introduces a condition under which the system is less diffusive and investigates how changes in the network structure influence the overall diffusion dynamics.
Related
- Encoding Hyperuniformity in Geometric Networks: Structural Signatures and Diffusion Dynamics
- Statistical validation of calorimeter inpainting with generative diffusion priors
- Active phase separation from concentration-dependent diffusion in chemical networks
- p-Adic statistical field theory of fluctuation effects in hierarchical neural networks
- Discrete Diffusion Models via Evolving Variational Autoregressive Networks
BibTeX
@misc{talebi2026statistical,
title = {{A Statistical Analysis of Diffusion Dynamics in Networks}},
author = {A. Talebi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.26759},
eprint = {2609.26759},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.26759},
}
RIS
TY - UNPB
TI - A Statistical Analysis of Diffusion Dynamics in Networks
AU - A. Talebi
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.26759
UR - https://arxiv.org/abs/2609.26759
AB - Network diffusion is a well-known model for studying how a quantity in a network propagates to reach a steady state, where its value becomes uniformly distributed across all nodes. Previous studies of network diffusion have mainly focused on the second-smallest eigenvalue of the network Laplacian to determine the timescale associated with the slowest decaying mode. However, this study investigates the eigenspectrum of the network Laplacian in terms of its statistical properties. This method is useful for studying the statistical properties of network diffusion without calculating all eigenvalues, which can be useful for large networks. Additionally, this study introduces a condition under which the system is less diffusive and investigates how changes in the network structure influence the overall diffusion dynamics.
ER -