Real-world social networks, while disparate in nature, often comprise of a set of loose clusters (a.k.a. communities), in which members are better connected to each other than to the rest of the network. In addition, such communities are often hierarchical, reflecting the fact that some communities are composed of a few smaller, sub-communities. Discovering the complicated hierarchical communit...

Networks deploying hierarchical routing are recursively partitioned into sub-networks that do not reveal full details of their internal structure outside their domains. Instead, an aggregated view of certain parameters that are associated with traversal within such sub-networks between their border nodes is advertised. The ATM PNNI standard and the Internet Nimrod architecture both adopt this a...

This paper proposes several novel hierarchical interconnection networks based on Heawood graphs, namely, folded Heawood networks, root-folded Heawood networks, recursively expanded Heawood networks, and flooded Heawood networks. Like hypercubes and networks extended from Petersen networks, these hierarchical Heawood networks have the following properties: regular topology, high scalability, and...

Traditional ad hoc networks have flat architecture, which suffers from poor scalability. Theoretical analysis and experimental results imply that throughput for each node decreases rapidly toward zero while the number of nodes increases in such architecture. Hierarchical architecture in ad hoc networks present a trade off between cellular networks and pure ad hoc networks, in that data may be f...