{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:56:09Z","timestamp":1772762169426,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,21]],"date-time":"2014-12-21T00:00:00Z","timestamp":1419120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10115-014-0810-7","type":"journal-article","created":{"date-parts":[[2014,12,20]],"date-time":"2014-12-20T12:31:25Z","timestamp":1419078685000},"page":"645-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Estimating robustness in large social graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Fragkiskos D.","family":"Malliaros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Megalooikonomou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,21]]},"reference":[{"key":"810_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2010) OddBall: spotting anomalies in weighted graphs. In: PAKDD, pp 410\u2013421","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"810_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert R, Jeong H, Barabasi A-L (1999) Diameter of the world wide web. Nature 401:130\u2013131","journal-title":"Nature"},{"issue":"6794","key":"810_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barabasi A-L (2000) Error and attack tolerance of complex networks. Nature 406(6794):378\u2013382","journal-title":"Nature"},{"key":"810_CR4","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Brova G, Terzi E (2011) Peer and authority pressure in information-propagation models. In: PKDD, pp 76\u201391","DOI":"10.1007\/978-3-642-23780-5_15"},{"key":"810_CR5","volume-title":"Modern information retrieval","author":"RA Baeza-Yates","year":"1999","unstructured":"Baeza-Yates RA, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley Longman, New York"},{"issue":"5439","key":"810_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"1","key":"810_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/15427951.2004.10129080","volume":"1","author":"B Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s B, Riordan O (2003) Robustness and vulnerability of scale-free random graphs. Internet Math 1(1):1\u201335","journal-title":"Internet Math"},{"issue":"25","key":"810_CR8","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","volume":"80","author":"DS Callaway","year":"2000","unstructured":"Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 80(25):5468\u20135471","journal-title":"Phys Rev Lett"},{"key":"810_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01903-6","volume-title":"Graph mining: laws, tools, and case studies. Synthesis lectures on data mining and knowledge discovery","author":"D Chakrabarti","year":"2012","unstructured":"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"},{"issue":"3","key":"810_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1541880.1541882","volume":"41","author":"V Chandola","year":"2009","unstructured":"Chandola V, Banerjee A, Kumar V (2009) Anomaly detection: a survey. ACM Comput Surv 41(3):1\u201358","journal-title":"ACM Comput Surv"},{"key":"810_CR11","doi-asserted-by":"crossref","unstructured":"Chung FRK (1997) Spectral graph theory. CBMS, regional conference series in mathematics, no. 92. AMS","DOI":"10.1090\/cbms\/092"},{"key":"810_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511780356","volume-title":"Complex networks: structure, robustness and function","author":"R Cohen","year":"2010","unstructured":"Cohen R, Havlin S (2010) Complex networks: structure, robustness and function. Cambridge University Press, Cambridge"},{"key":"810_CR13","unstructured":"DBLP Bibliography Server (2006). http:\/\/dblp.uni-trier.de\/xml\/"},{"key":"810_CR14","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, Reny\u00ed A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17\u201361","journal-title":"Publ Math Inst Hung Acad Sci"},{"issue":"5","key":"810_CR15","doi-asserted-by":"crossref","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71(5):056103","journal-title":"Phys Rev E"},{"issue":"4","key":"810_CR16","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1209\/epl\/i2005-10441-3","volume":"73","author":"E Estrada","year":"2006","unstructured":"Estrada E (2006) Spectral scaling and good expansion properties in complex networks. Europhys Lett 73(4):649\u2013655","journal-title":"Europhys Lett"},{"key":"810_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1140\/epjb\/e2006-00330-7","volume":"52","author":"E Estrada","year":"2006","unstructured":"Estrada E (2006) Network robustness to targeted attacks. The interplay of expansibility and degree distribution. Eur Phys J B 52:563\u2013574","journal-title":"Eur Phys J B"},{"key":"810_CR18","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power\u2013law relationships of the Internet topology. In: SIGCOMM, pp 251\u2013262","DOI":"10.1145\/316188.316229"},{"issue":"3\u20135","key":"810_CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"810_CR20","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore","edition":"3"},{"key":"810_CR21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull Am Math Soc 43:439\u2013561","journal-title":"Bull Am Math Soc"},{"key":"810_CR22","unstructured":"KDD Cup (2004). http:\/\/www.cs.cornell.edu\/projects\/kddcup\/"},{"key":"810_CR23","doi-asserted-by":"crossref","unstructured":"Kumar R, Novak J, Tomkins A (2006) Structure and evolution of online social networks. In: KDD, pp 611\u2013617","DOI":"10.1145\/1150402.1150476"},{"key":"810_CR24","doi-asserted-by":"crossref","unstructured":"Lefevre K, Terzi E (2010) GraSS: Graph structure summarization. In: SDM, pp 454\u2013465","DOI":"10.1137\/1.9781611972801.40"},{"issue":"1","key":"810_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"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\u2013123","journal-title":"Internet Math"},{"key":"810_CR26","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985\u20131042","journal-title":"J Mach Learn Res"},{"key":"810_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: WWW, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"810_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"810_CR29","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):1\u201341","DOI":"10.1145\/1217299.1217301"},{"key":"810_CR30","doi-asserted-by":"crossref","unstructured":"Maiya AS, Berger-Wolf TY (2010) Expansion and search in networks. In: CIKM, pp 239\u2013248","DOI":"10.1145\/1871437.1871471"},{"key":"810_CR31","doi-asserted-by":"crossref","unstructured":"Malliaros FD, Megalooikonomou V, Faloutsos C (2012) Fast robustness estimation in large social graphs: communities and anomaly detection. In: SDM, pp 942\u2013953","DOI":"10.1137\/1.9781611972825.81"},{"issue":"4","key":"810_CR32","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros FD, Vazirgiannis Michalis (2013) Clustering and community detection in directed networks: a survey. Phys Rep 533(4):95\u2013142","journal-title":"Phys Rep"},{"key":"810_CR33","doi-asserted-by":"crossref","unstructured":"Maserrat H, Pei J (2010) Neighbor query friendly compression of social networks. In: KDD, pp 533\u2013542","DOI":"10.1145\/1835804.1835873"},{"key":"810_CR34","doi-asserted-by":"crossref","unstructured":"Mathioudakis M, Bonchi F, Castillo C, Gionis A, Ukkonen A (2011) Sparsification of influence networks. In: KDD, pp 529\u2013537","DOI":"10.1145\/2020408.2020492"},{"key":"810_CR35","doi-asserted-by":"crossref","unstructured":"McGlohon M, Akoglu L, Faloutsos C (2008) Weighted graphs and disconnected components: patterns and a generator. In: KDD, pp 524\u2013532","DOI":"10.1145\/1401890.1401955"},{"key":"810_CR36","unstructured":"Mihail M, Papadimitriou C, Saberi A (2011) On certain connectivity properties of the Internet topology. In: FOCS, pp 28\u201335"},{"key":"810_CR37","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: IMC, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"issue":"3","key":"810_CR38","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(89)90029-4","volume":"47","author":"B Mohar","year":"1989","unstructured":"Mohar B (1989) Isoperimetric number of graphs. J Comb Theor B 47(3):274\u2013291","journal-title":"J Comb Theor B"},{"key":"810_CR39","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256","journal-title":"SIAM Rev"},{"key":"810_CR40","doi-asserted-by":"crossref","first-page":"036122","DOI":"10.1103\/PhysRevE.68.036122","volume":"68","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ, Park J (2003) Why social networks are different from other types of networks. Phys Rev E 68:036122","journal-title":"Phys Rev E"},{"issue":"3","key":"810_CR41","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvector of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"issue":"23","key":"810_CR42","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. PNAS 103(23):8577\u20138582","journal-title":"PNAS"},{"key":"810_CR43","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Technical Report, Stanford InfoLab"},{"key":"810_CR44","doi-asserted-by":"crossref","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: ISWC, pp 351\u2013368","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"810_CR45","doi-asserted-by":"crossref","unstructured":"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\u2013870","DOI":"10.1145\/1772690.1772778"},{"key":"810_CR46","doi-asserted-by":"crossref","unstructured":"Satuluri V, Parthasarathy S (2009) Scalable graph clustering using stochastic flows: applications to community. discovery. In: KDD, pp 737\u2013746","DOI":"10.1145\/1557019.1557101"},{"issue":"2","key":"810_CR47","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/2450142.2450149","volume":"60","author":"C Seshadhri","year":"2013","unstructured":"Seshadhri C, Pinar A, Kolda TG (2013) An in-depth analysis of stochastic Kronecker graphs. JACM 60(2):13:1\u201313:32","journal-title":"JACM"},{"key":"810_CR48","doi-asserted-by":"crossref","unstructured":"Toivonen H, Zhou F, Hartikainen A, Hinkka A (2011) Compression of weighted graphs. In: KDD, pp 965\u2013973","DOI":"10.1145\/2020408.2020566"},{"key":"810_CR49","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM, pp 608\u2013617","DOI":"10.1109\/ICDM.2008.72"},{"key":"810_CR50","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10115-010-0291-2","volume":"26","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis CE (2011) Counting triangles in real-world networks using projections. Knowl Inf Syst 26:501\u2013520","journal-title":"Knowl Inf Syst"},{"key":"810_CR51","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: WOSN, pp 37\u201342","DOI":"10.1145\/1592665.1592675"},{"issue":"684","key":"810_CR52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(684):440\u2013442","journal-title":"Nature"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0810-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0810-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0810-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T20:44:50Z","timestamp":1690749890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0810-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,21]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["810"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0810-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,21]]}}}