Network navigation with non-Lèvy superdiffusive random walks
From MaRDI portal
Publication:2070526
Cites work
- A connection between a system of random walks and rumor transmission
- Coupling Scale-Free and Classical Random Graphs
- Emergence of Scaling in Random Networks
- First passage time statistics for two-channel diffusion
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- scientific article; zbMATH DE number 1131881 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- Impact of human behavior on information spreading: viral marketing and social networks
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Numerical methods for scientists and engineers.
- On the mean square displacement in Lévy walks
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- Unusual scaling in a discrete quantum walk with random long range steps
This page was built for publication: Network navigation with non-Lèvy superdiffusive random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070526)