Network navigation with non-Lèvy superdiffusive random walks
From MaRDI portal
Publication:2070526
DOI10.1016/J.PHYSA.2021.126158OpenAlexW3172951351MaRDI QIDQ2070526
Simone Santini, Emilio Aced Fuentes
Publication date: 24 January 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2021.126158
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical methods for scientists and engineers.
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- A connection between a system of random walks and rumor transmission
- Unusual scaling in a discrete quantum walk with random long range steps
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- First passage time statistics for two-channel diffusion
- Emergence of Scaling in Random Networks
- Coupling Scale-Free and Classical Random Graphs
- On the Mean Square Displacement in Lévy Walks
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
This page was built for publication: Network navigation with non-Lèvy superdiffusive random walks