There is a large, popular, and growing literature on" scale-free" networks with the Internet
along with metabolic networks representing perhaps the canonical examples. While this has …

Random graphs with given degrees are a natural next step in complexity beyond the Erdős–
Rényi model, yet the degree constraint greatly complicates simulation and estimation. We …

These lecture notes are intended to be used for master courses, where the students have a
limited prior knowledge of special topics in probability. Therefore, we have included many of …

Random graph theory is used to examine the" small-world phenomenon"–any two strangers
are connected through a short chain of mutual acquaintances. We will show that for certain …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We consider the diameter of a random graph G (n, p) for various ranges of p close to the
phase transition point for connectivity. For a disconnected graph G, we use the convention …

We investigate the darknet œ a collection of networks and technologies used to share digital
content. The darknet is not a separate physical network but an application and protocol layer …

The traditional power grid has been designed in a hierarchical fashion, with energy pushed
from the large scale production factories towards the end users. With the increasing …

In the last decade, structural properties of several naturally arising networks (the Internet,
social networks, the web graph, etc.) have been studied intensively with a view to …

Abstract Recently, Papadopoulos, Krioukov, Boguñá and Vahdat [Infocom'10] introduced a
random geometric graph model that is based on hyperbolic geometry. The authors argued …