Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Bipartite structure of all complex networks
Information Processing Letters
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Proceedings of the forty-first annual ACM symposium on Theory of computing
Co-evolution of social and affiliation networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Modeling affiliations in networks
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Relationships between entities in many complex systems, such as the Internet and social networks, have a natural hierarchical organization. Understanding these inherent hierarchies is essential for creating models of these systems. Thus, there is a recent body of research concerning the extraction of hierarchies from networks. We propose a new method for modeling hierarchies through extracting the affiliations of the network. From these affiliations, we construct a lattice of the relationships between nodes. A principal advantage of our approach is that any overlapping community structures of the nodes within the network have a natural representation within the lattice. We then show an example of our method using a real data set.