{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:32Z","timestamp":1740160292182,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0003"],"award-info":[{"award-number":["FA9550-15-1-0003"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0339-8","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T06:50:42Z","timestamp":1465195842000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Striations in PageRank-ordered matrices"],"prefix":"10.1007","volume":"6","author":[{"given":"Corey","family":"Pennycuff","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3164-2615","authenticated-orcid":false,"given":"Tim","family":"Weninger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"339_CR1","doi-asserted-by":"crossref","unstructured":"Abbassi Z, Mirrokni VS (2007) A recommender system based on local random walks and spectral methods. In: Proceedings of WebKDD and SNA-KDD, ACM, pp 102\u2013108","DOI":"10.1145\/1348549.1348561"},{"issue":"6749","key":"339_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (1999) Internet: diameter of the World-Wide Web. Nature 401(6749):130\u2013131","journal-title":"Nature"},{"key":"339_CR3","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K (2006) Local graph partitioning using PageRank vectors. In: FOCS, IEEE, pp 475\u2013486 24","DOI":"10.1109\/FOCS.2006.44"},{"issue":"5439","key":"339_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"1","key":"339_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"AL Barabasi","year":"2000","unstructured":"Barabasi AL, Albert R, Jeong H (2000) Scale-free characteristics of random networks: the topology of the World-Wide Web. Phys A 281(1):69\u201377","journal-title":"Phys A"},{"issue":"3","key":"339_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s100510050067","volume":"13","author":"A Barrat","year":"2000","unstructured":"Barrat A, Weigt M (2000) On the properties of small-world network models. Eur Phys J B 13(3):547\u2013560","journal-title":"Eur Phys J B"},{"key":"339_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti L, Castillo C (2006) The distribution of PageRank follows a power-law only for particular values of the damping factor. In: WWW, ACM, pp 941\u2013942","DOI":"10.1145\/1135777.1135955"},{"key":"339_CR8","unstructured":"Bertin J (1973) S\u00b4emiologie graphique. Les diagrammes-les r\u00b4eseaux-les cartes"},{"key":"339_CR9","unstructured":"Blandford DK, Blelloch GE, Kash IA (2003) Compact representations of separable graphs. In: SODA, ACM\/SIAM, pp 679\u2013688"},{"key":"339_CR10","unstructured":"Chakrabarti D, Zhan Y, Blandford D, Faloutsos C, Blello G (2004a) Netmine: mining tools for large graphs. In: SDM workshop on link analysis, counterterrorism, and privacy, SIAM"},{"key":"339_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004b) R-mat: a recursive model for graph mining. In: SDM, SIAM, pp 442\u2013446","DOI":"10.1137\/1.9781611972740.43"},{"issue":"5","key":"339_CR12","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.ijhcs.2006.11.002","volume":"65","author":"D Chakrabarti","year":"2007","unstructured":"Chakrabarti D, Faloutsos C, Zhan Y (2007) Visualization of large networks with min-cut plots, A-plots and R-MAT. Int J Hum-Comput Stud 65(5):434\u2013445","journal-title":"Int J Hum-Comput Stud"},{"key":"339_CR13","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: SIGKDD, ACM, pp 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"339_CR14","volume-title":"Generalized blockmodeling","author":"P Doreian","year":"2005","unstructured":"Doreian P, Batagelj V, Ferligoj A (2005) Generalized blockmodeling, vol 25. Cambridge University Press, Cambridge"},{"issue":"6","key":"339_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1953122.1953146","volume":"54","author":"M Franceschet","year":"2011","unstructured":"Franceschet M (2011) PageRank: standing on the shoulders of giants. Commun ACM 54(6):92\u2013101","journal-title":"Commun ACM"},{"key":"339_CR16","unstructured":"George JA (1971) Computer implementation of the finite element method. Technical Report, DTIC Document"},{"key":"339_CR17","volume-title":"Computer solution of large sparse positive definite systems","author":"A George","year":"1981","unstructured":"George A, Liu J (1981) Computer solution of large sparse positive definite systems. Prentice-Hall, Englewood Cliffs"},{"issue":"2","key":"339_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/palgrave.ivs.9500092","volume":"4","author":"M Ghoniem","year":"2005","unstructured":"Ghoniem M, Fekete JD, Castagliola P (2005) On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Inf Vis 4(2):114\u2013135","journal-title":"Inf Vis"},{"issue":"12","key":"339_CR19","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"339_CR20","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: SciPy, Pasadena, CA USA, pp 11\u201315"},{"key":"339_CR21","doi-asserted-by":"crossref","unstructured":"Kang U, Meeder B, Faloutsos C (2011) Spectral analysis for billion-scale graphs: discoveries and implementation. In: Advances in knowledge discovery and data mining. Springer, pp 13\u201325","DOI":"10.1007\/978-3-642-20847-8_2"},{"issue":"4","key":"339_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1002\/nme.1620020406","volume":"2","author":"IP King","year":"1970","unstructured":"King IP (1970) An automatic reordering scheme for simultaneous equations derived from network systems. Int J Numer Meth Eng 2(4):523\u2013533","journal-title":"Int J Numer Meth Eng"},{"issue":"5","key":"339_CR23","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632","journal-title":"J ACM"},{"key":"339_CR24","volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The Stanford GraphBase: a platform for combinatorial computing, vol 37. Addison-Wesley, Reading"},{"issue":"1","key":"339_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/S0036144503424786","volume":"47","author":"AN Langville","year":"2005","unstructured":"Langville AN, Meyer CD (2005) A survey of eigenvector methods for web information retrieval. SIAM Rev 47(1):135\u2013161","journal-title":"SIAM Rev"},{"issue":"1","key":"339_CR26","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S1389-1286(00)00034-7","volume":"33","author":"R Lempel","year":"2000","unstructured":"Lempel R, Moran S (2000) The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Comput Netw 33(1):387\u2013401","journal-title":"Comput Netw"},{"key":"339_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: SIGKDD, ACM, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"339_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007a) The dynamics of viral marketing. ACM Trans Web 1(1):5","journal-title":"ACM Trans Web"},{"issue":"1","key":"339_CR29","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007b) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2","journal-title":"ACM Trans Knowl Discov Data"},{"key":"339_CR30","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985\u20131042","journal-title":"J Mach Learn Res"},{"issue":"7","key":"339_CR31","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"4","key":"339_CR32","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau O, Haase P, Slooten E, Dawson S (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"issue":"5","key":"339_CR33","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1287\/opre.20.5.993","volume":"20","author":"WT McCormick Jr","year":"1972","unstructured":"McCormick WT Jr, Schweitzer PJ, White TW (1972) Problem decomposition and data reorganization by a clustering technique. Oper Res 20(5):993\u20131009","journal-title":"Oper Res"},{"key":"339_CR34","doi-asserted-by":"crossref","unstructured":"Mueller C, Martin B, Lumsdaine A (2007a) A Comparison of vertex ordering algorithms for large graph visualization. In: APVIS, IEEE, pp 141\u2013148","DOI":"10.1109\/APVIS.2007.329289"},{"key":"339_CR35","doi-asserted-by":"crossref","unstructured":"Mueller C, Martin B, Lumsdaine A (2007b) Interpreting large visual similarity matrices. In: APVIS, IEEE, pp 149\u2013152","DOI":"10.1109\/APVIS.2007.329290"},{"issue":"208","key":"339_CR36","first-page":"701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman MEJ (2002) Assortative mixing in networks. Phys Rev Lett 89(208):701","journal-title":"Phys Rev Lett"},{"key":"339_CR37","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web, technical report, Stanford University, Stanford, CA"},{"key":"339_CR38","doi-asserted-by":"crossref","unstructured":"Pandurangan G, Raghavan P, Upfal E (2002) Using PageRank to characterize web structure. In: Computing and combinatorics. Springer, pp 330\u2013339","DOI":"10.1007\/3-540-45655-4_36"},{"issue":"036","key":"339_CR39","first-page":"107","volume":"78","author":"N Perra","year":"2008","unstructured":"Perra N, Fortunato S (2008) Spectral centrality measures in complex networks. Phys Rev E 78(036):107","journal-title":"Phys Rev E"},{"key":"339_CR40","doi-asserted-by":"crossref","unstructured":"Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C (2010) Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Advances in knowledge discovery and data mining. Springer, pp 435\u2013448","DOI":"10.1007\/978-3-642-13672-6_42"},{"issue":"2","key":"339_CR41","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/nme.1620230208","volume":"23","author":"S Sloan","year":"1986","unstructured":"Sloan S (1986) An algorithm for profile and wavefront reduction of sparse matrices. Int J Numer Meth Eng 23(2):239\u2013251","journal-title":"Int J Numer Meth Eng"},{"key":"339_CR42","doi-asserted-by":"crossref","unstructured":"Ugander J, Backstrom L, Kleinberg J (2013) Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In: WWW, pp 1307\u20131318","DOI":"10.1145\/2488388.2488502"},{"key":"339_CR43","doi-asserted-by":"crossref","unstructured":"Volkovich Y, Litvak N, Donato D (2007) Determining factors behind the PageRank log-log plot. In: Algorithms and models for the web-graph. Springer, pp 108\u2013123","DOI":"10.1007\/978-3-540-77004-6_9"},{"issue":"440\u2013442","key":"339_CR44","first-page":"26","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(440\u2013442):26","journal-title":"Nature"},{"issue":"1","key":"339_CR45","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","volume":"13","author":"PM Weichsel","year":"1962","unstructured":"Weichsel PM (1962) The Kronecker product of graphs. Proc Am Math Soc 13(1):47\u201352","journal-title":"Proc Am Math Soc"},{"issue":"1","key":"339_CR46","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"339_CR47","doi-asserted-by":"crossref","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","DOI":"10.1086\/jar.33.4.3629752"},{"key":"339_CR48","unstructured":"Zhan Y (2003) Tools for graph mining. Masters thesis, Carnegie Mellon University"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0339-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0339-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0339-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0339-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:23:49Z","timestamp":1589444629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0339-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["339"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0339-8","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2016,6,6]]},"assertion":[{"value":"3 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"30"}}