Can I read The Use of Sparsest Cuts to Reveal the Hierarchical Community Structure of Social Networks on EtoBox?

The Use of Sparsest Cuts to Reveal the Hierarchical Community Structure of Social Networks by Charles F. Mann; David W. Matula; Eli V. Olinick is a Social Sciences article available to read on EtoBox.

What is The Use of Sparsest Cuts to Reveal the Hierarchical Community Structure of Social Networks about?

We show that good community structures can be obtained by partitioning a social network in a succession of divisive sparsest cuts. A network flow algorithm based on fundamental principles of graph theory is introduced to identify the sparsest cuts and an underlying hierarchical community structure of the network via maximum concurrent flow. Matula [Matula, David W., 1985. Concurrent flow and concurrent connectivity in graphs. In: Alavi, Y., et al. (Eds.), Graph Theory and its Applications to Algorithms and Computer Science. Wiley, New York, NY, pp. 543-559.] established the maximum concurrent flow problem (MCFP), and papers on divisive vs. agglomerative average-linkage hierarchical clustering [e.g., Matula,

Who reads The Use of Sparsest Cuts to Reveal the Hierarchical Community Structure of Social Networks?

Author

Charles F. Mann; David W. Matula; Eli V. Olinick

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0378-8733)

Published

2008

Language

EN

Field

Social Sciences