Recommendations
Cites work
- scientific article; zbMATH DE number 5764831 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 2119677 (Why is no real title available?)
- A random-surfer web-graph model
- Depth properties of scaled attachment random recursive trees
- Diameters in preferential attachment models
- Emergence of Scaling in Random Networks
- Growing random networks with fitness
- Large deviations for the weighted height of an extended class of trees
- Note on the heights of random recursive trees and random m‐ary search trees
- The diameter of a scale-free random graph
- Using PageRank to Characterize Web Structure
Cited in
(8)- scientific article; zbMATH DE number 5033859 (Why is no real title available?)
- The diameter of protean graphs
- scientific article; zbMATH DE number 2068167 (Why is no real title available?)
- Justifying the small-world phenomenon via random recursive trees
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- A random-surfer web-graph model
- It's a small world for random surfers
- Co-evolving dynamic networks
This page was built for publication: It's a small world for random surfers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329281)