The use of sparsest cuts to reveal the hierarchical community structure of social networks

Social Networks

Volumn 30, Issue 3, 2008, Pages 223-234

  Mann, Charles F ^a   Matula, David W ^a   Olinick, Eli V ^a  

^a SOUTHERN METHODIST UNIVERSITY   (United States)

Author keywords

Community structure; Divisive algorithm; Graph theory; Maximum concurrent flow; Multipartite cut; Network structure; Social networks; Sparsest cut

Indexed keywords

EID: 44649151706     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2008.03.004     Document Type: Article

References (33)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice-Hall
2. Biswas J., and Matula D.W. Two flow routing algorithms for the maximum concurrent flow problem. Proceedings of Fall Joint Computer Conference (1986), IEEE Computer Society Press, Washington, DC 629-636
3. Borgatti S.P., and Everett M.G. A graph-theoretic perspective on centrality. Social Networks 28 4 (2006) 466-484
4. Breiger R.L., Boorman S.A., and Arabie P. An algorithm for clustering relational data with applications to social network analysis. Journal of Mathematical Psychology 12 (1975) 328-383
5. Breiger R.L., and Pattison P.E. Cumulated social roles: the duality of persons and their algebras. Social Networks 8 (1986) 215-256
6. Numerical taxonomy. In: Cole A.J. (Ed). Proceedings of the Colloquium in Numerical Taxonomy held in the University of St. Andrews (1969), Academic Press, London
7. Cox, Ingemar J., Hansen, Pierre, Julesz, Bela (Eds.), 1993. Partitioning Data Sets: DIMACS Workshop. Rutgers University, Princeton University, AT&T Bell Labs, and Bellcore.
8. Doreian P., Batagelj V., and Ferligoj A. Generalized Blockmodeling (2005), Cambridge University Press
9. Ford Jr. L.R., and Fulkerson D.R. Maximal flow through a network. Canadian Journal of Mathematics 8 (1956) 399-404
10. Ford Jr. L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
11. Fortunato S., Latora V., and Marchiori M. Method to find community structures based on information centrality. Physical Review E 70 (2004) 056104
12. Girvan M., and Newman M.E.J. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99 (2002) 7821-7826
13. Hardy G.H., and Wright E.M. An Introduction to the Theory of Numbers. 5th ed. (1979), Oxford University Press, Great Britain
14. Jardine N., and Sibson R. Mathematical Taxonomy (1971), Wiley, London
15. Lorrain F., and White H.C. Structural equivalence of individuals in social networks. Journal of Mathematical Sociology 1 (1971) 49-80
16. Mann, Charles F., 2008. Extensions of maximum concurrent flow to identify hierarchical community structure and hubs in networks. Ph.D. dissertation, Southern Methodist University.
17. Mann, Charles F., Matula, David W., Olinick, Eli V., 2007. Revealing the hierarchical community structure of social networks employing concurrent flow. Unpublished Technical Report. Report No. 07-CSE-01. Southern Methodist University.
18. Matula D.W. Graph theoretic techniques for cluster analysis algorithms. In: Van Ryzin J. (Ed). Classification and Clustering (1977), Academic Press, New York 95-129
19. Matula D.W. Cluster validity by concurrent chaining. In: Felsenstein J. (Ed). Numerical Taxonomy: Proc. of the NATO Adv. Study Inst., vol. 1 (1983), Springer-Verlag, New York 156-166 (Proceedings of the NATO ASI Series G)
20. Matula D.W. Concurrent flow and concurrent connectivity in graphs. In: Alavi Y., et al. (Ed). Graph Theory and its Applications to Algorithms and Computer Science (1985), Wiley, New York, NY 543-559
21. Matula D.W. Divisive vs. agglomerative average linkage hierarchical clustering. In: Gaul W., and Schader M. (Eds). Classification as a Tool of Research (1986), Elsevier, North-Holland, Amsterdam 289-301
22. Matula D.W., and Shahrokhi F. Sparsest cuts and bottlenecks in graphs. Journal of Discrete Applied Mathematics 27 (1990) 113-123
23. Newman M.E.J. Analysis of weighted networks. Physical Review E 70 (2004) 056131
24. Padgett J.F., and Ansell C.K. Robust action and the rise of the medici, 1400-1434. American Journal of Sociology 98 (1993) 1259-1319
25. Scott J. Social Network Analysis: A Handbook. 2nd ed. (2000), Sage, London
26. Shahrokhi, Farhad, 1987. The maximum concurrent flow problem. Ph.D. Dissertation. Western Michigan University.
27. Shahrokhi F. Approximation algorithms for the maximum concurrent flow problem. ORSA Journal on Computing 1 2 (1989) 62-69
28. Shahrokhi F., and Matula D.W. On solving large maximum concurrent flow problems. Proceedings of the ACM 15th Annual Conference on Computer Science. February 1987, St. Louis, Missouri, United States (1987) 205-209
29. Shahrokhi F., and Matula D.W. The maximum concurrent flow problem. Journal of the Association for Computing Machinery 37 2 (1990) 318-334
30. Sneath P.H.A., and Sokal R.R. Numerical Taxonomy (1973), Freeman
31. Thompson, Byron J., 1985. A flow rerouting algorithm for the maximum concurrent flow problem with variable capacities and demands, and its application to cluster analysis. Master Thesis. School of Engineering and Applied Science, Southern Methodist University.
32. White H.C., Boorman S.A., and Breiger R.L. Social structure from multiple networks. I. Blockmodels of roles and positions. American Journal of Sociology 81 (1976) 730-779
33. Winston W.L., and Venkataramanan M. Introduction to Mathematical Programming Operations Research: Volume One. 4th edition (2003), Brooks/Cole-Thomson Learning