Tomography of scale-free networks and shortest path trees

Tomer Kalisky, Reuven Cohen, Osnat Mokryn, Danny Dolev, Yuval Shavitt, Shlomo Havlin

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


In this paper we model the tomography of scale-free networks by studying the structure of layers around an arbitrary network node. We find, both analytically and empirically, that the distance distribution of all nodes from a specific network node consists of two regimes. The first is characterized by rapid growth, and the second decays exponentially. We also show analytically that the nodes degree distribution at each layer exhibits a power-law tail with an exponential cutoff. We obtain similar empirical results for the layers surrounding the root of shortest path trees cut from such networks, as well as the Internet.

Original languageEnglish
Article number066108
JournalPhysical Review E
Issue number6
StatePublished - Dec 2006


Dive into the research topics of 'Tomography of scale-free networks and shortest path trees'. Together they form a unique fingerprint.

Cite this