It's a small world for random surfers
DOI10.1007/S00453-015-0034-6zbMATH Open1352.68020OpenAlexW2181032003MaRDI QIDQ329281FDOQ329281
Authors: Abbas Mehrabian, Nicholas Wormald 
Publication date: 21 October 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0034-6
Recommendations
large deviationsprobabilistic analysisheight of random treesPageRank-based selection modelrandom-surfer webgraph modelsmall-world phenomenon
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81) Internet topics (68M11)
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- The diameter of a scale-free random graph
- Depth properties of scaled attachment random recursive trees
- Using PageRank to Characterize Web Structure
- Title not available (Why is that?)
- Note on the heights of random recursive trees and random m‐ary search trees
- Title not available (Why is that?)
- A random-surfer web-graph model
- Growing random networks with fitness
- Large deviations for the weighted height of an extended class of trees
- Diameters in preferential attachment models
Cited In (8)
- Title not available (Why is that?)
- The diameter of protean graphs
- Title not available (Why is that?)
- Justifying the small-world phenomenon via random recursive trees
- A random-surfer web-graph model
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Co-evolving dynamic networks
- It's a small world for random surfers
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)
