A Statistical Analysis of Diffusion Dynamics in Networks
A. Talebi
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.
Create a lesson
Related papers
Towards synergy between theory and experiments: First-passage processes under resetting with stochastic return protocols
Ashutosh Dubey, Arnab Pal
Emergent Loop Geometry in Gauge-Equivariant Graph Neural Networks
Ali Rayat, Gia-Wei Chern
Extending the mean first-passage-time formalism to the reconstruction of high free-energy barriers: A top-start approach
Ying Jiang, Ivan Saika-Voivod
Exact Microscopic One-Body Reduction in the Symmetric Exclusion Process
Olivier Bénichou, Aurélien Grabsch
Macroscopic fluctuation theory of stochastic systems undergoing monitoring
João Costa, Pedro Ribeiro, Andrea De Luca
Charge-selective topological locking and ultraslow coarsening in magnetoelastic media
Tirthankar Banerjee, Amaresh Jaiswal