Motivated by the proliferation of dual radio devices, we consider a wireless network model in
which all devices have short-range transmission capability, but a subset of the nodes has a …

Small-world graphs, exhibiting high clustering co-efficients and small average path length,
have been shown to capture fundamental properties of a large number of natural and man …

With developments in experimental connectomics producing wiring diagrams of many
neuronal networks, there is emerging interest in theories to understand the relationship …

Information dissemination in communication networks is a key function whose effectiveness
depends both on the chosen dissemination algorithm and on the underlying network …

Networks, whether it is communication or transportation, often suffer from significant
degradation in average network flow capacity (ANFC) due to the presence of one or more …

Recent results from statistical physics show that large classes of complex networks, both
man-made and of natural origin, are characterized by high clustering properties yet strikingly …

This study investigates the capacity of small-world networks that are formulated as acquiring
the maximum multicommodity flows (MMF). The minimum multicut provides the upper bound …

Intrigued by the capacity of random networks, we start by proving a max-flow min-cut
theorem that is applicable to any random graph obeying a suitably defined independence-in …