A measure of dissimilarity between diffusive processes on networks
arXiv:2205.10887 · doi:10.1088/1751-8121/acc144
Abstract
In this paper, we present a framework to compare the differences in the occupation probabilities of two random walk processes, which can be generated by modifications of the network or the transition probabilities between the nodes of the same network. We explore a dissimilarity measure defined in terms of the eigenvalues and eigenvectors of the normalized Laplacian of each process. This formalism is implemented to examine differences in the diffusive dynamics described by circulant matrices, the effect of new edges, and the rewiring in networks as well as to evaluate divergences in the transport in degree-biased random walks and random walks with stochastic reset. Our results provide a general tool to compare dynamical processes on networks considering the evolution of states and capturing the complexity of these structures.
arXiv comment23 pages, 6 figures
References in corpus (22)
- Emergence of scaling in random networks
- Random walks and diffusion on networks
- Stochastic Resetting and Applications
- Biased random walks on complex networks: the role of local navigation rules
- Long-Range Navigation on Complex Networks using Lévy Random Walks
- Random walks on networks with stochastic resetting
- Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
- Flow graphs: interweaving dynamics and structure
- Spectral properties of simple classical and quantum reset processes
- Efficient exploration of multiplex networks
- First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
- Extreme events and event size fluctuations in biased random walks on networks
- Statistical physics of complex information dynamics
- Network comparison and the within-ensemble graph distance
- Diffusive transport on networks with stochastic resetting to multiple nodes
- Nonlocal biased random walks and fractional transport on directed networks
- Mean encounter times for multiple random walkers on networks
- Aging in transport processes on networks with stochastic cumulative damage
- Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?
- Random walks on networks with preferential cumulative damage: Generation of bias and aging
- Optimal exploration of random walks with local bias on networks
- Random Walks on Complex Networks