Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators

PeerJ Computer Science

Volumn 2016, Issue 5, 2016, Pages

  Yan, Xiaoran ^a   Teng, Shang Hua ^b   Lerman, Kristina ^c   Ghosh, Rumi ^d  

^a INDIANA UNIVERSITY   (United States)

^b University of Southern California   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d ROBERT BOSCH GMBH   (Germany)

Author keywords

Centrality; Community structure; Dynamical process; Network; Spectral graph theory

Indexed keywords

LAPLACE TRANSFORMS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; NETWORKS (CIRCUITS); PARAMETERIZATION;

CENTRALITY; CENTRALITY MEASURES; CHEEGER'S INEQUALITIES; COMMUNITY STRUCTURES; DYNAMICAL PROCESS; GRAPH PARTITIONING; LAPLACIAN MATRICES; SPECTRAL GRAPH THEORY;

GRAPH THEORY;

EID: 85020456521     PISSN: None     EISSN: 23765992     Source Type: Journal    
DOI: 10.7717/peerj-cs.57     Document Type: Article

References (59)

1. Adamic LA, Glance N. 2005. The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd international workshop on Link discovery. New York: ACM, 36-43.
2. Aldous D, Fill J. 2002. Reversible Markov chains and random walks on graphs. Available at https:// www.stat.berkeley.edu/ ~aldous/RWG/book.pdf .
3. Andersen R, Chung F, Lang K. 2007. Using PageRank to locally partition a graph. Internet Math 4(1):1-128 DOI 10.1080/15427951.2007.10129135.
4. Andersen R, Peres Y. 2009. Finding sparse cuts locally using evolving sets. In: Proceedings of 41st annual ACM symposium on Theory of computing . New York: ACM, 235-244. Available at http:// dl.acm.org/ citation.cfm?id=1536449.
5. Arenas A, Díaz-Guilera A, Pérez-Vicente CJ. 2006. Synchronization reveals topological scales in complex networks. Physical Review Letters 96(11):114102 DOI 10.1103/PhysRevLett.96.114102.
6. Avrachenkov K, Gonçalves P, Mishenin A, Sokol M. 2011. Generalized optimization framework for graph-based semi-supervised learning. CoRR ArXiv preprint. arXiv:1110.4278.
7. Bastian M, Heymann S, Jacomy M. 2009. Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the international conference on the web and social media. Palo Alto: AAAI, 361-362.
8. Bertozzi A, Flenner A. 2012. Diffuse interface models on graphs for classification of high dimensional data. Multiscale Modeling & Simulation 10(3):1090-1118 DOI 10.1137/11083109X.
9. Bonacich P. 1972. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2(1):113-120 DOI 10.1080/0022250X.1972.9989806.
10. Bonacich P, Lloyd P. 2001. Eigenvector-like measures of centrality for asymmetric relations. Social Networks 23(3):191-201 DOI 10.1016/S0378-8733(01)00038-7.
11. Borgatti S. 2005. Centrality and network flow. Social Networks 27(1):55-71 DOI 10.1016/j.socnet.2004.11.008.
12. Burda Z, Duda J, Luck JM, Waclaw B. 2009. Localization of the maximal entropy random walk. Physical Review Letters 102(16):160602 DOI 10.1103/PhysRevLett.102.160602.
13. Cheeger J. 1970. A lower bound for the smallest eigenvalue of the Laplacian. Problems in Analysis 625:195-199.
14. Chung F. 2007. The heat kernel as the pagerank of a graph. Proceedings of the National Academy of Sciences of the United States of America 104(50):19735-19740 DOI 10.1073/pnas.0708838104.
15. Chung F. 2009. A local graph partitioning algorithm using heat kernel pagerank. Internet Mathematics 6(3):315-330 DOI 10.1080/15427951.2009.10390643.
16. Chung FRK. 1997. Spectral graph theory (CBMS regional conference series in mathematics, No. 92). Providence: American Mathematical Society.
17. DeGroot MH. 1974. Reaching a consensus. Journal of the American Statistical Association 69(345):118-121 DOI 10.1080/01621459.1974.10480137.
18. Delvenne J-C, Yaliraki SN, Barahona M. 2008. Stability of graph communities across time scales. ArXiv preprint. arXiv:0812.1811.
19. Fortunato S. 2010. Community detection in graphs. Physics Reports 486:75-174 DOI 10.1016/j.physrep.2009.11.002.
20. Fronczak A, Fronczak P. 2009. Biased random walks in complex networks: the role of local navigation rules. Physical Review E 80(1):016107 DOI 10.1103/PhysRevE.80.016107.
21. Ghosh R, Lerman K. 2011. Parameterized centrality metric for network analysis. Physical Review E 83(6): 066118 DOI 10.1103/PhysRevE.83.066118.
22. Ghosh R, Lerman K. 2012. Rethinking centrality: the role of dynamical processes in social network analysis. CoRR ArXiv preprint. arXiv:1209.4616.
23. Ghosh R, Teng S-H, Lerman K, Yan X. 2014. The interplay between dynamics and networks: centrality, communities, and cheeger inequality. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD'14. New York: ACM, 1406-1415.
24. Girvan M, NewmanME J. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99(12):7821-7826 DOI 10.1073/pnas.122653799.
25. Gómez-Gardeñes J, Latora V. 2008. Entropy rate of diffusion processes on complex networks. Physical Review E 78(6):065102 DOI 10.1103/PhysRevE.78.065102.
26. Jerrum M, Sinclair A. 1988. Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved. In: Proceedings of the twentieth annual ACM symposium on Theory of computing . New York: ACM, 235-244.
27. Jeub LGS, Balachandran P, Porter MA, Mucha PJ, Mahoney MW. 2015. Think locally, act locally: detection of small, medium-sized, and large communities in large networks. Physical Review E 91(1): 012821 DOI 10.1103/PhysRevE.91.012821.
28. Kannan R, Vempala S, Vetta A. 2004. On clusterings: good, bad and spectral. Journal of the ACM 51(3):497-515 DOI 10.1145/990308.990313.
29. Katz L. 1953. A new status index derived from sociometric analysis. Psychometrika 18(1):39-43 DOI 10.1007/BF02289026.
30. Kempe D, Kleinberg J, Tardos é. 2003. Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining . New York: ACM, 137-146. Available at http:// dl.acm.org/ citation.cfm?id=956769.
31. Koutis I, Miller GL, Peng R. 2010. Approaching optimality for solving SDD linear systems. In: Proceedings of 51st annual IEEE symposium on Foundations of Computer Science (FOCS). Piscataway: IEEE, 235-244.
32. Krause U. 2008. Compromise, consensus, and the iteration of means. Elemente der Mathematik 63:1-8.
33. Lambiotte R, Delvenne J-C, Barahona M. 2008. Laplacian dynamics and multiscale modular structure in networks. ArXiv preprint. arXiv:0812.1770.
34. Lambiotte R, Sinatra R, Delvenne J-C, Evans TS, Barahona M, Latora V. 2011. Flow graphs: interweaving dynamics and structure. Physical Review E 84(1): 017102.
35. Lawler GF, Sokal AD. 1988. Bounds on the $2$ spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality. Transactions of the American Mathematical Society 309(2):557-580.
36. Lerman K, Ghosh R. 2012. Network structure, topology and dynamics in generalized models of synchronization. Physical Review E 86:026108.
37. Leskovec J, Lang KJ, Dasgupta A, Mahoney MW. 2008. Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th international conference on World Wide Web 2008 Apr 21. New York: ACM, 695-704. Available at http:// dl.acm.org/ citation.cfm?id=1367591.
38. Ling X, Hu MB, Ding JX, Shi Q, Jiang R. 2013. Effects of target routing model on the occurrence of extreme events in complex networks. The European Physical Journal B 86(4):1-5 DOI 10.1140/epjb/e2013-30409-9.
39. Lovász L. 1996. Random walks on graphs: a survey. In: Combinatorics, Paul Erdos is Eighty. Vol. 2. Budapest: János Bolyai Mathematical Society, 353-398.
40. McAuley JJ, Leskovec J. 2012. Learning to discover social circles in Ego networks. In: Proceedings of NIPS 2012. 548-556. Available at http:// papers.nips.cc/ paper/ 4532- learning-to-discover-social-circles-in-ego-networks.
41. Mihail M. 1989. Conductance and convergence of Markov chains-a combinatorial treatment of expanders. In: Foundations of computer science, 1989., 30th annual symposium on. 526-531.
42. Motter AE, Zhou C, Kurths J. 2005. Network synchronization, diffusion, and the paradox of heterogeneity. Physical Review E 71(1):016116 DOI 10.1103/PhysRevE.71.016116.
43. Newman MEJ. 2003. Mixing patterns in networks. Physical Review E 67(2):026126 DOI 10.1103/PhysRevE.67.026126.
44. Newman MEJ. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74(3):036104 DOI 10.1103/PhysRevE.74.036104.
45. Olfati-Saber R, Fax JA, Murray RM. 2007. Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE 95(1):215-233 DOI 10.1109/JPROC.2006.887293.
46. Page L, Brin S, Motwani R, Winograd T. 1999. The pagerank citation ranking: bringing order to the web. Technical Report. Standford: Stanford InfoLab. Available at http: // ilpubs.stanford.edu:8090/ 422/ .
47. Poole K. 2012. Voteview. Available at http:// voteview.com/ house98.htm.
48. Porter MA, Onnela JP, Mucha PJ. 2009. Communities in networks. Notices of the American Mathematical Society 56(9):1082-1097.
49. Ross SM. 2014. Introduction to probability models. Cambrdige: Academic press.
50. Rosvall M, Bergstrom CT. 2008. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences of the United States of America 105(4):1118-1123 DOI 10.1073/pnas.0706851105.
51. Shi J, Malik J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8):888-905 DOI 10.1109/34.868688.
52. Smith LM, Lerman K, Garcia-Cardona C, Percus AG, Ghosh R. 2013. Spectral clustering with epidemic diffusion. Physical Review E 88(4): 042813 DOI 10.1103/PhysRevE.88.042813.
53. Spielman DA, Teng SH. 1996. Spectral partitioning works: planar graphs and finite element meshes. In: Proceedings of 37th annual symposium on foundations of computer science. Piscataway: IEEE, 96-105.
54. Spielman DA, Teng SH. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing . New York: ACM, 81-90.
55. Taylor D, Myers SA, Clauset A, Porter MA, Mucha PJ. 2015. Eigenvector-based centrality measures for temporal networks. ArXiv preprint. arXiv:1507.01266.
56. Watts DJ, Strogatz SH. 1998. Collective dynamics of 'small-world' networks. Nature 393(6684):440-442 DOI 10.1038/30918.
57. Waugh AS, Pei L, Fowler JH, Mucha PJ, Porter MA. 2009. Party polarization in congress: a network science approach. ArXiv preprint. arXiv:0907.3509.
58. Zachary WW. 1977. An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33(4):452-473 DOI 10.1086/jar.33.4.3629752.
59. Zhu Y, Yan X, Moore C. 2014. Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions. Journal of Complex Networks 2(1):1-18 DOI 10.1093/comnet/cnt011.