{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T12:56:26Z","timestamp":1758632186502},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_13","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"130-140","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"L.A. Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the Web. Social Networks\u00a025, 211\u2013230 (2003)","journal-title":"Social Networks"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-02927-1_12","volume-title":"Automata, Languages and Programming","author":"S. Arora","year":"2009","unstructured":"Arora, S., Steurer, D., Wigderson, A.: Towards a Study of Low-Complexity Graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 119\u2013131. Springer, Heidelberg (2009)"},{"key":"13_CR3","doi-asserted-by":"publisher","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.: Emergence of Scaling in Random Networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity. American Mathematical Society (2003)","DOI":"10.1090\/gsm\/054"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1093\/sf\/53.2.181","volume":"53","author":"R.L. Breiger","year":"1974","unstructured":"Breiger, R.L.: The Duality of Persons and Groups. Social Forces\u00a053, 181\u2013190 (1974)","journal-title":"Social Forces"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-31585-5_40","volume-title":"Automata, Languages, and Programming","author":"K. Bhawalkar","year":"2012","unstructured":"Bhawalkar, K., Kleinberg, J., Lewi, K., Roughgarden, T., Sharma, A.: Preventing Unraveling in Social Networks: The Anchored k-Core Problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 440\u2013451. Springer, Heidelberg (2012)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"258702","DOI":"10.1103\/PhysRevLett.89.258702","volume":"89","author":"G. Caldarelli","year":"2002","unstructured":"Caldarelli, G., Capocci, A., de Los Rios, P., Mu\u00f1oz, M.A.: Scale-Free Networks from Varying Vertex Intrinsic Fitness. Phys. Rev. Lett.\u00a089, 258702 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0012-365X(97)00049-6","volume":"181","author":"C.M. Fiduccia","year":"1998","unstructured":"Fiduccia, C.M., Scheinerman, E.R., Trenk, A., Zito, J.S.: Dot product representations of graphs. Discrete Mathematics\u00a0181, 113\u2013138 (1998)","journal-title":"Discrete Mathematics"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comp. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theor. Comp. Sci."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0024-3795(80)90212-8","volume":"31","author":"L.J. Gray","year":"1980","unstructured":"Gray, L.J., Wilson, D.G.: Nonnegative factorization of positive semidefinite nonnegative matrices. Linear Algebra and its Applications\u00a031, 119\u2013127 (1980)","journal-title":"Linear Algebra and its Applications"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                  1\u2009\u2212\u2009\u03b5\n                  . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1198\/016214502388618906","volume":"97","author":"P.D. Hoff","year":"2002","unstructured":"Hoff, P.D., Raftery, A.E., Handcock, M.S.: Latent Space Approaches to Social Network Analysis. J. Am. Stat. Assoc.\u00a097, 1090\u20131098 (2002)","journal-title":"J. Am. Stat. Assoc."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                  5\/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J.\u00a0Comput.\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J.\u00a0Comput."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kang, R.J., Lov\u00e1sz, L., M\u00fcller, T., Scheinerman, E.R.: Dot product representations of planar graphs. Electr. J. Comb.\u00a018 (2011)","DOI":"10.1007\/978-3-642-18469-7_26"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"R.J. Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete and Computational Geometry\u00a047, 548\u2013568 (2012)","journal-title":"Discrete and Computational Geometry"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-18009-5_7","volume-title":"Algorithms and Models for the Web-Graph","author":"M. Kim","year":"2010","unstructured":"Kim, M., Leskovec, J.: Multiplicative Attribute Graph Model of Real-World Networks. In: Kumar, R., Sivakumar, D. (eds.) WAW 2010. LNCS, vol.\u00a06516, pp. 62\u201373. Springer, Heidelberg (2010)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/BF01195002","volume":"17","author":"A. Kotlov","year":"1997","unstructured":"Kotlov, A., Lov\u00e1sz, L., Vempala, S.: The Colin de Verdi\u00e9re number and sphere representations of a graph. Combinatorica\u00a017, 483\u2013521 (1997)","journal-title":"Combinatorica"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The Link Prediction Problem for Social Networks. In: Proc. CIKM 2003, pp. 556\u2013559 (2003)","DOI":"10.1145\/956863.956972"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M. McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a Feather: Homophily in Social Networks. Annual Rev. Sociology\u00a027, 415\u2013444 (2001)","journal-title":"Annual Rev. Sociology"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"13_CR24","unstructured":"Nickel, C.M.L.: Random Dot Product Graphs: A Model for Social Networks. PhD dissertation, Johns Hopkins University (2007)"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jcss.2000.1711","volume":"61","author":"C.H. Papadimitriou","year":"2000","unstructured":"Papadimitriou, C.H., Raghavan, P., Tamaki, H., Vempala, S.: Latent Semantic Indexing: A Probabilistic Analysis. J. Comput. Syst. Sci.\u00a061, 217\u2013235 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1002\/asi.4630270505","volume":"27","author":"D.J. de","year":"1976","unstructured":"de, D.J., Price, S.: A general theory of bibliometric and other cumulative advantage processes. J. American Society for Information Science\u00a027, 292\u2013306 (1976)","journal-title":"J. American Society for Information Science"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02187736","volume":"4","author":"J. Reiterman","year":"1989","unstructured":"Reiterman, J., R\u00f6dl, V., \u0160in\u01cejov\u00e1, E.: Embeddings of graphs in Euclidean spaces. Discrete and Computational Geometery\u00a04, 349\u2013364 (1989)","journal-title":"Discrete and Computational Geometery"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(89)90142-8","volume":"74","author":"J. Reiterman","year":"1989","unstructured":"Reiterman, J., R\u00f6dl, V., \u0160in\u01cejov\u00e1, E.: Geometrical embeddings of graphs. Discrete Mathematics\u00a074, 291\u2013319 (1989)","journal-title":"Discrete Mathematics"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(92)90002-F","volume":"56","author":"J. Reiterman","year":"1992","unstructured":"Reiterman, J., R\u00f6dl, V., \u0160in\u01cejov\u00e1, E.: On embedding of graphs into Euclidean spaces of small dimension. J. Combin. Theory B\u00a056, 1\u20138 (1992)","journal-title":"J. Combin. Theory B"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00180-009-0158-8","volume":"25","author":"E.R. Scheinerman","year":"2010","unstructured":"Scheinerman, E.R., Tucker, K.: Modeling graphs using dot product representations. Computational Statistics\u00a025, 1\u201316 (2010)","journal-title":"Computational Statistics"},{"key":"13_CR31","first-page":"425","volume":"42","author":"H.A. Simon","year":"1955","unstructured":"Simon, H.A.: On a class of skew distribution functions. Biom.\u00a042, 425\u2013440 (1955)","journal-title":"Biom."},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1146\/annurev.soc.012809.102709","volume":"37","author":"T.A.B. Snijders","year":"2011","unstructured":"Snijders, T.A.B.: Statistical Models for Social Networks. Annual Rev. Sociology\u00a037, 131\u2013153 (2011)","journal-title":"Annual Rev. Sociology"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1126\/science.1070120","volume":"296","author":"D.J. Watts","year":"2002","unstructured":"Watts, D.J., Dodds, P.S., Newman, M.E.J.: Identity and Search in Social Networks. Science\u00a0296, 1302\u20131305 (2002)","journal-title":"Science"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-77004-6_11","volume-title":"Algorithms and Models for the Web-Graph","author":"S.J. Young","year":"2007","unstructured":"Young, S.J., Scheinerman, E.R.: Random dot product graph models for social networks. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 138\u2013149. Springer, Heidelberg (2007)"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15427951.2008.10129301","volume":"5","author":"S.J. Young","year":"2008","unstructured":"Young, S.J., Scheinerman, E.R.: Directed random dot product graphs. Internet Mathematics\u00a05, 91\u2013111 (2008)","journal-title":"Internet Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:52:35Z","timestamp":1558781555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}