Chris Kuhlman
ABSTRACT
Clustering is useful in elucidating associations among agents of networks and has been advantageously applied in numerous fields including biology, chemistry, sociology, and economics. Most clustering algorithms have been applied to (weighted) networks with a fixed topology. However, many networks are constructed to simulate particular dynamics on them; e.g., transmission of disease, vehicular transportation, electricity supply, and economic transfers in financial markets. These dynamics affect the large-scale structure that emerges from the underlying network. We present a clustering method that incorporates not only the weighted network topology, but also the particular dynamics for an application domain. The approach is general and can be used with any dynamic process that can be simulated on a network.
We apply this method to several networks to validate it: a benchmark network, various toy networks, and two large realistic synthetic networks. These span four, five, and two orders of magnitude in numbers of agents and links, and average degree, respectively, and possess vastly different degree distributions. The largest network includes over 580,000 agents and 13 million edges. The results show that different structures arise from variations in dynamics processes for a fixed network, and reflect the changes in the process itself. We observe a sharp transition from unclustered to well-clustered communities as dynamical parameters vary.
- M. Altaf-Ul-Amin, Y. Shinbo, K. Mihara, K. Kurokawa, and S. Kanaya. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics, 7, 2006.Google Scholar
- A. Apolloni, K. Channakeshava, L. Durbeck, M. Khan, C. Kuhlman, B. Lewis, and S. Swarap. A study of information diffusion over a realistic social network model. In The 2009 IEEE International Conference on Social Computing (Social Com-09), 2009. Google ScholarDigital Library
- K. Atkins, J. Chen, V. Kumar, M. Macauley, and A. Marathe. Locational market power in network constrained markets. Journal of Economic Behavior and Organization, 70(1-2):416--430, 2009.Google ScholarCross Ref
- K. Atkins, J. Chen, V. Kumar, and A. Marathe. Structure of electrical networks: A graph theory based analysis. Int. J. Critical Infrastructure, 5:265, 2009.Google ScholarCross Ref
- C. Barrett, R. Beckman, K. Berkbigler, K. Bisset, B. Bush, K. Campbell, S. Eubank, K. Henson, J. Hurford, D. Kubicek, M. Marathe, P. Romexo, J. Smith, L. Smith, P. Speckman, P. Stretz, G. Thayer, E. Eeckhout, and M. Williams. TRANSIMS: Transportation analysis simulation system. Los Alamos National Laboratory Unclassified Report, Tech. Rep. LA-UR-00-1725, 2001.Google Scholar
- C. Barrett, R. Beckman, M. Khan, V. Kumar, M. Marathe, P. Stretz, T. Dutta, and B. Lewis. Generation and analysis of large synthetic social contact networks. In Proceedings of the 2009 Winter Simulation Conference, 2009. Google ScholarDigital Library
- K. Bisset, J. Chen, X. Feng, A. Vullikanti, and M. Marathe. Epifast: A fast algorithm for large scale realistic epidemic simulations on distributed memory systems. In Proceedings of the 23rd ACM International Conference on Supercomputing (ICS '09), 2009. Google ScholarDigital Library
- V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. J. Stat. Mech., page P10008, 2008.Google Scholar
- G. Boender, T. Hagenaars, A. Bouma, G. Nodelijk, A. Elbers, M. de Jong, and M. van Boven. Risk maps for the spread of highly pathogenic avian influenza in poultry. PLoS Computational Biology, 3(4):704--712, 2007.Google ScholarCross Ref
- U. Brandes, D. Delling, M. Gaertler, R. Grke, M. Hoefer, Z. Nikoloski, and D. Wagner. On finding graph clusterings with maximum modularity. In Proceedings 33rd Intl. Workshop Graph-Theoretic Concepts in Computer Science (WG 2007), volume LNCS 4769, pages 121--132, 2007. Google ScholarDigital Library
- U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. In Proceedings of the 11th European Symposium on Algorithms (ESA '03), volume LNCS 2832, pages 568--579, 2003.Google ScholarCross Ref
- M. Bruhn, J. Cajka, G. Smith, R. Curry, S. Dunipace, W. Wheaton, P. Cooley, and D. Wagener. Generating realistic livestock and poultry operations to support development of infectious disease control strategies. In ESRI 2007 Conference, 2007.Google Scholar
- Damon Centola and Michael Macy. Complex contagions and the weakness of long ties. American Journal of Sociology, 113(3):702--734, 2007.Google ScholarCross Ref
- L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. J. Statistical Mechanics: Theory and Experiment, 2005.Google Scholar
- S. Fortunato and M. Barthelemy. Resolution limit in community detection. PNAS, 104(1):36--41, 2007.Google ScholarCross Ref
- A. Galstyan, V. Musoyan, and P. Cohen. Maximizing influence propagation in networks with community structure. Physical Review E, 79(056102), 2009.Google Scholar
- G. Gfeller, J. Chappelier, and P. De Los Rio. Finding instabilities in the community structure of complex networks. Physical Review E, 72(056135), 2005.Google Scholar
- M. Granovetter. The strength of weak ties. American Journal of Sociology, 78:1360--1380, 1973.Google ScholarCross Ref
- R. Guimera, M. Sales-Pardo, and L. Amaral. Modularity from fluctuations in random graphs and complex networks. Physical Review E, 70(025101), 2004.Google Scholar
- M. Halloran, N. Ferguson, I. Longini S. Eubank, D. Cummings, B. Lewis, S Xu, C. Fraser, A. Vullikanti, T. Germann, D. Wagener, R. Beckman, K. Kadau, C. Barrett, C. Macken, D. Burke, and P. Cooley. Modeling targeted layered containment of an influenza pandemic in the united states. PNAS, 105(12):4639--4644, 2008.Google ScholarCross Ref
- B. Karrer, E. Levina, and M. Newman. Robustness of community structure in networks. Physical Review E, 77:046119, 2008.Google ScholarCross Ref
- J. Kumpula, J.-P. Onnela, J. Saramaki, K. Kashi, and J. Kertesz. Emergence of communities in weighted networks. Physical Review Letters, 99(228701), 2007.Google Scholar
- J. Kumpula, J.-P. Onnela, J. Saramaki, J. Kertesz, and K. Kashi. Model of community emergence in weighted social networks. Computer Physics Communication, 180:517, 2009.Google ScholarCross Ref
- J. Kumpula, J. Saramaki, K. Kaski, and J. Kertesz. Limited resolution in complex network community detection with potts model approach. European Physical Journal B, 56:41--45, 2007.Google ScholarCross Ref
- A. Lancichinetti and S. Fortunato. Community detection algorithms: a comparative analysis. submitted.Google Scholar
- A. Lancichinetti and S. Fortunato. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80:016118, 2009.Google Scholar
- A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E, 78:046110, 2008.Google ScholarCross Ref
- A. Le Menach, E. Veru, R. Grais, D. Smith, and A. Flahault. Key strategies for reducing spread of avian influenza among commercial poultry holdings: lessons for transmission to humans. Proceedings of the Royal Society B, 273:2467--2475, 2006.Google ScholarCross Ref
- J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Statistical properties of community structure in large social and information networks. In WWW 2008, 2008. Google ScholarDigital Library
- I. Longini, A. Nizam, S. Xu, K. Ungchusak, W. Hanshaoworakul, D. Cummings, and M. Halloran. Containing pandemic influenza at the source. Science, 309(5737):1083--1087, 2005.Google ScholarCross Ref
- M. Newman. Mixing patterns in networks. Physical Review E, 67(026126), 2003.Google Scholar
- M. Newman. Detecting community structure in networks. European Physical Journal B, 38:321--330, 2004.Google ScholarCross Ref
- M. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.Google ScholarCross Ref
- G. Palla, A.-L. Barabasi, and T. Vicsek. Quantifying social group evolution. Nature, 446:664--667, 2007.Google ScholarCross Ref
- J. Pereira-Leal, A. Enright, and C. Ouzounis. Detection of functional modules from protein interaction networks. PROTEINS: Structure, Function, and Bioinformatics, 54:49--57, 2004.Google Scholar
- M. Rosvall and C. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105(4):1118--1123, 2008.Google ScholarCross Ref
- S. Schaeffer. Graph clustering. Computer Science Review, 1:27--64, 2007. Google ScholarDigital Library
- J. Truscott, T. Garske, I. Chis-Ster, J. Guitian, D. Pfeiffer, L. Snow, J. Wilesmith, N. Ferguson, and A. Ghani. Control of highly pathogenic h5n1 avian influenza outbreak in the gb poultry flock. Proceedings of the Royal Society B, 274:2287--2295, 2007.Google ScholarCross Ref
- S. van Dongen. Graph clustering by flow simulation. Ph.D. Thesis, Universiteit Utrecht, Utrecht, The Netherlands, 2000.Google Scholar
- W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33(4):452--473, 1977.Google ScholarCross Ref
- Clustering method incorporating network topology and dynamics
Recommendations
Network Fault Recognition Method Based on Network Topology Monitoring
WSSE '19: Proceedings of the 1st World Symposium on Software EngineeringIn the field of development of cyberspace, faults are not only the cause of abnormal network functions, but also the cause of network fault phenomenon. Network fault identification solves the problem of "Is there a fault?" "What's the trouble?" And "...
Weighted-spectral clustering algorithm for detecting community structures in complex networks
The community structure is a common non-trivial topological feature of many complex real-world networks. Existing methods for identifying the community structure are generally based on statistical-type properties, such as the degree of centrality, the ...
A Model of Spatially Constrained Social Network Dynamics
Social networks characterize the set of relationships among a population of social agents. As such, their structure both constrains and is constrained by social processes such as partnership formation and the spread of information, opinions, and ...
Comments