Estimating robustness in large social graphs

Knowledge and Information Systems

Volumn 45, Issue 3, 2015, Pages 645-678

  Malliaros, Fragkiskos D ^a,e   Megalooikonomou, Vasileios ^b,c   Faloutsos, Christos ^d  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF PATRAS   (Greece)

^c TEMPLE UNIVERSITY   (United States)

^d Carnegie Mellon University ^*  (United States)

^e ECOLE POLYTECHNIQUE   (France)

Author keywords

Expansion properties; Graph generating models; Graph mining; Network robustness; Social network analysis; Temporal evolution

Indexed keywords

INFORMATION SYSTEMS; SOCIAL NETWORKING (ONLINE);

EXPANSION PROPERTIES; GENERATING MODELS; GRAPH MINING; NETWORK ROBUSTNESS; TEMPORAL EVOLUTION;

GRAPHIC METHODS;

EID: 84944355981     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-014-0810-7     Document Type: Article

References (52)

1. Akoglu L, McGlohon M, Faloutsos C (2010) OddBall: spotting anomalies in weighted graphs. In: PAKDD, pp 410–421
2. Albert R, Jeong H, Barabasi A-L (1999) Diameter of the world wide web. Nature 401:130–131
3. Albert R, Jeong H, Barabasi A-L (2000) Error and attack tolerance of complex networks. Nature 406(6794):378–382
4. Anagnostopoulos A, Brova G, Terzi E (2011) Peer and authority pressure in information-propagation models. In: PKDD, pp 76–91
5. Baeza-Yates RA, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley Longman, New York
6. Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512
7. Bollobás B, Riordan O (2003) Robustness and vulnerability of scale-free random graphs. Internet Math 1(1):1–35
8. Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 80(25):5468–5471
9. Chakrabarti D, Faloutsos C (2012) Graph mining: laws, tools, and case studies. Synthesis lectures on data mining and knowledge discovery. Morgan and Claypool, San Rafael
10. Chandola V, Banerjee A, Kumar V (2009) Anomaly detection: a survey. ACM Comput Surv 41(3):1–58
11. Chung FRK (1997) Spectral graph theory. CBMS, regional conference series in mathematics, no. 92. AMS
12. Cohen R, Havlin S (2010) Complex networks: structure, robustness and function. Cambridge University Press, Cambridge
13. DBLP Bibliography Server (2006). http://dblp.uni-trier.de/xml/
14. Erdös P, Renyí A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17–61
15. Estrada E, Rodríguez-Velázquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71(5):056103
16. Estrada E (2006) Spectral scaling and good expansion properties in complex networks. Europhys Lett 73(4):649–655
17. Estrada E (2006) Network robustness to targeted attacks. The interplay of expansibility and degree distribution. Eur Phys J B 52:563–574
18. Faloutsos M, Faloutsos P, Faloutsos C (1999) On power–law relationships of the Internet topology. In: SIGCOMM, pp 251–262
19. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174
20. Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore
21. Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull Am Math Soc 43:439–561
22. KDD Cup (2004). http://www.cs.cornell.edu/projects/kddcup/
23. Kumar R, Novak J, Tomkins A (2006) Structure and evolution of online social networks. In: KDD, pp 611–617
24. Lefevre K, Terzi E (2010) GraSS: Graph structure summarization. In: SDM, pp 454–465
25. Leskovec J, Lang K, Dasgupta A, Mahoney M (2009) Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29–123
26. Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985–1042
27. Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW, pp 641–650
28. Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp 177–187
29. Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):1–41
30. Maiya AS, Berger-Wolf TY (2010) Expansion and search in networks. In: CIKM, pp 239–248
31. Malliaros FD, Megalooikonomou V, Faloutsos C (2012) Fast robustness estimation in large social graphs: communities and anomaly detection. In: SDM, pp 942–953
32. Malliaros FD, Vazirgiannis Michalis (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533(4):95–142
33. Maserrat H, Pei J (2010) Neighbor query friendly compression of social networks. In: KDD, pp 533–542
34. Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of influence networks. In: KDD, pp 529–537
35. McGlohon M, Akoglu L, Faloutsos C (2008) Weighted graphs and disconnected components: patterns and a generator. In: KDD, pp 524–532
36. Mihail M, Papadimitriou C, Saberi A (2011) On certain connectivity properties of the Internet topology. In: FOCS, pp 28–35
37. Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: IMC, pp 29–42
38. Mohar B (1989) Isoperimetric number of graphs. J Comb Theor B 47(3):274–291
39. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256
40. Newman MEJ, Park J (2003) Why social networks are different from other types of networks. Phys Rev E 68:036122
41. Newman MEJ (2006) Finding community structure in networks using the eigenvector of matrices. Phys Rev E 74(3):036104
42. Newman MEJ (2006) Modularity and community structure in networks. PNAS 103(23):8577–8582
43. Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Technical Report, Stanford InfoLab
44. Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: ISWC, pp 351–368
45. Sala A, Cao L, Wilson C, Zablit R, Zheng H, Zhao BY (2010) Measurement-calibrated graph models for social network experiments. In: WWW, pp 861–870
46. Satuluri V, Parthasarathy S (2009) Scalable graph clustering using stochastic flows: applications to community. discovery. In: KDD, pp 737–746
47. Seshadhri C, Pinar A, Kolda TG (2013) An in-depth analysis of stochastic Kronecker graphs. JACM 60(2):13:1–13:32
48. Toivonen H, Zhou F, Hartikainen A, Hinkka A (2011) Compression of weighted graphs. In: KDD, pp 965–973
49. Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM, pp 608–617
50. Tsourakakis CE (2011) Counting triangles in real-world networks using projections. Knowl Inf Syst 26:501–520
51. Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: WOSN, pp 37–42
52. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393(684):440–442