Kleinberg's grid unchained
From MaRDI portal
Publication:2182646
DOI10.1016/j.tcs.2018.09.025zbMath1443.68028OpenAlexW2894004120WikidataQ125339887 ScholiaQ125339887MaRDI QIDQ2182646
Publication date: 26 May 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02052607/file/kleinberg_revised_hal.pdf
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal augmentation schemes for network navigability
- Greedy routing in small-world networks with power-law degrees
- Eclecticism shrinks even small worlds
- On the searchability of small-world networks with arbitrary underlying structure
- The small-world phenomenon
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Know thy neighbor's neighbor
- Rejection-inversion to generate variates from monotone discrete distributions
- How Many People Do You Know?: Efficiently Estimating Personal Network Size
- Probability and Computing
- Analyzing Kleinberg's (and other) small-world Models
This page was built for publication: Kleinberg's grid unchained