{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T05:33:17Z","timestamp":1759815197408,"version":"3.38.0"},"reference-count":73,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network analytic method designed for the analysis of static networks promise to identify significant relational patterns that correlate with important structures in the complex system the network is derived from. In this mini review, three groups of network analytic methods are discussed: centrality indices, network motifs, and clustering algorithms. We show that so far these methods have mainly been used in a descriptive way, but that they show promising possibilities to be used for prediction and classification. We thus conclude the article with a discussion of how benchmark sets and evaluation criteria could look like to realize this promise.<\/jats:p>","DOI":"10.2478\/s13537-011-0009-x","type":"journal-article","created":{"date-parts":[[2011,3,24]],"date-time":"2011-03-24T15:25:25Z","timestamp":1300980325000},"source":"Crossref","is-referenced-by-count":6,"title":["Good versus optimal: Why network analytic methods need more systematic evaluation"],"prefix":"10.2478","volume":"1","author":[{"given":"Katharina","family":"Zweig","sequence":"first","affiliation":[]}],"member":"374","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v024.i08","volume":"24","author":"R. Admiraal","year":"2008","unstructured":"Admiraal R., Handcock M.S., networksis: A package to simulate bipartite graphs with fixed marginals through sequential importance sampling, J STAT SOFTW, 2008, 24, 1\u201321","journal-title":"J STAT SOFTW"},{"key":"9_CR2","volume-title":"An Introduction to Systems Biology \u2014 Design Principles of Biological Circuits","author":"U. Alon","year":"2007","unstructured":"Alon U., An Introduction to Systems Biology \u2014 Design Principles of Biological Circuits, Chapman & Hall\/CRC\/Taylor & Francis, Boca Raton, FL, 2007"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"L.A. Nunes Amaral","year":"2000","unstructured":"Nunes Amaral L.A., Scala A., Barth\u00e9l\u00e9my M., Stanley H.E., Classes of small-world networks, P NATL ACAD SCI USA, 2000, 97, 11149\u201311152","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1126\/science.1099334","volume":"305","author":"Y. Artzy-Randrup","year":"2004","unstructured":"Artzy-Randrup Y., Fleishman S.J., Ben-Tal N., Stone L., Comment on \u201cnetwork motifs: Simple building blocks of complex networks\u201d and \u201csuperfamilies of evolved and designed networks\u201d, SCIENCE, 2004, 305, 1107","journal-title":"SCIENCE"},{"key":"9_CR5","volume-title":"Linked \u2014 The New Science of Networks","author":"A.-L. Barab\u00e1si","year":"2002","unstructured":"Barab\u00e1si A.-L., Linked \u2014 The New Science of Networks, Perseus, Cambridge MA, 2002"},{"key":"9_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., Emergence of scaling in random networks, SCIENCE, 1999, 286, 509\u2013512","journal-title":"SCIENCE"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical process on complex networks","author":"A. Barrat","year":"2008","unstructured":"Barrat A., Barth\u00e9lemy M., Vespignani A., Dynamical process on complex networks, Cambridge University Press, Cambridge, 2008"},{"key":"9_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B., Modern Graph Theory, Springer Verlag, Heidelberg, Germany, 1998"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs, Cambridge Studies in Advanced Mathematics 73","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B., Random Graphs, Cambridge Studies in Advanced Mathematics 73, 2nd edition, Cambridge University Press, London, 2001","edition":"2nd edition"},{"key":"9_CR10","unstructured":"Bollob\u00e1s B., Extremal Graph Theory, Dover Publications, 2004"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","volume":"27","author":"S.P. Borgatti","year":"2005","unstructured":"Borgatti S.P., Centrality and network flow, SOC NETWORKS, 2005, 27, 55\u201371","journal-title":"SOC NETWORKS"},{"key":"9_CR12","unstructured":"Brandes U., Delling D., Gaertler M., Goerke R., Hoefer M., Nikoloski Z., Wagner D., Maximizing modularity is hard, Technical report, Dynamically Evolving, Large-Scale Information Systems DELIS-TR-379, 2006"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Brandes U., Gaertler M., Wagner D., Experiments on graph clustering algorithms, In: Di Battista G., Zwick U. (Eds.), Proceedings of the 11th European Symposium on Algorithms, LECT NOTES COMPUT SC, 2832 (15\u201320 September 2003, Budapest) 568\u2013579","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Brandes U., Gaertler M., Wagner D., Engineering graph clustering: Models and experimental evaluation, ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS, 2007, 12, Article 1.1","DOI":"10.1145\/1227161.1227162"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Brin S., Motwani R., Ullman J.D., Tsur S., Dynamic itemset counting and implication rules for market basket data, In: Peckham J. (Ed.), Proceedings ACM SIGMOD International Conference on Management of Data (13\u201315 May 1997, Tucson, Arizona, USA), ACM Press, 1997, 255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"3054","DOI":"10.1016\/j.disc.2004.10.028","volume":"306","author":"R.A. Brualdi","year":"2006","unstructured":"Brualdi R.A., Algorithms for constructing (0,1)-matrices with prescribed row and column sum vectors, DISCRETE MATH, 2006, 306, 3054\u20133062","journal-title":"DISCRETE MATH"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F. Chung","year":"2002","unstructured":"Chung F., Lu L., The average distances in random graphs with given expected degrees, P NATL ACAD SCI USA, 2002, 99, 15879\u201315882","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR18","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","volume-title":"Complex Graphs and Networks","author":"F. Chung","year":"2006","unstructured":"Chung F., Lu L., Complex Graphs and Networks, American Mathematical Society, Providence, RI, 2006"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A. Clauset","year":"2008","unstructured":"Clauset A., Moore C., Newman M.E.J., Hierarchical structure and the prediction of missing links in networks, NATURE, 2008, 453, 98\u2013101","journal-title":"NATURE"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset A., Newman M.E.J., Moore C., Finding community structure in very large networks, PHYS REV E, 2004, 70, 066111","journal-title":"PHYS REV E"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A. Clauset","year":"2009","unstructured":"Clauset A., Shalizi C.R., Newman M.E.J., Power-law distributions in empirical data, SIAM REVIEW OF MODERN PHYSICS, 2009, 51, 661\u2013703","journal-title":"SIAM REVIEW OF MODERN PHYSICS"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0378-8733(78)90011-4","volume":"1","author":"I. Sola Pool de","year":"1978","unstructured":"de Sola Pool I., Kochen M., Contacts and influence, SOC NETWORKS, 1978\/79, 1, 5\u201351","journal-title":"SOC NETWORKS"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1074\/mcp.M100037-MCP200","volume":"1","author":"C. Deane","year":"2002","unstructured":"Deane C., Salwinski L., Xenarios I., Eisenberg D., Protein interactions: two methods for assessment of the reliability of high throughput observations, MOL CELL PROTEOMICS, 2002, 1, 349\u2013356","journal-title":"MOL CELL PROTEOMICS"},{"key":"9_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198515906.001.0001","volume-title":"Evolution of Networks","author":"S.N. Dorogovtsev","year":"2003","unstructured":"Dorogovtsev S.N., Mendes J.F.F., Evolution of Networks, Oxford University Press, New York, NY, 2003"},{"key":"9_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D. Easley","year":"2010","unstructured":"Easley D., Kleinberg J., Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, New York, NY, 2010"},{"key":"9_CR26","first-page":"23","volume":"4","author":"K. Faust","year":"1992","unstructured":"Faust K., Wasserman S., Centrality and prestige: A review and synthesis, QUANTITATIVE ANTHROPOLOGY, 1992, 4, 23\u201378","journal-title":"QUANTITATIVE ANTHROPOLOGY"},{"key":"9_CR27","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., Community detection in graphs, PHYS REP, 2010, 486, 75\u2013174","journal-title":"PHYS REP"},{"key":"9_CR28","volume-title":"The development of social network analysis","author":"L. Freeman","year":"2006","unstructured":"Freeman L., The development of social network analysis, Empirical Press, Vancouver, 2006"},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L.C. Freeman","year":"1979","unstructured":"Freeman L.C., Centrality in networks: I. conceptual clarifications, SOC NETWORKS, 1979, 1, 215\u2013239","journal-title":"SOC NETWORKS"},{"key":"9_CR30","volume-title":"LECT NOTES COMPUT SC","author":"M. Gaertler","year":"2005","unstructured":"Gaertler M., Clustering, Network Analysis: Methodological Foundations, In: Brandes U., Erlebach T. (Eds.), LECT NOTES COMPUT SC, vol. 3418, Springer-Verlag, New York, 2005"},{"key":"9_CR31","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"E.N. Gilbert","year":"1959","unstructured":"Gilbert E.N., Random graphs, ANN MATH STAT, 1959, 30, 1141\u20131144","journal-title":"ANN MATH STAT"},{"key":"9_CR32","first-page":"167","volume":"1","author":"A. Gionis","year":"2007","unstructured":"Gionis A., Mannila H., Mielik\u00e4inen T., Tsaparas P., Assessing data mining results via swap randomization, ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2007, 1, 167\u2013176","journal-title":"ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA"},{"key":"9_CR33","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan M., Newman M.E.J., Community structure in social and biological networks, P NATL ACAD SCI USA, 2002, 99, 7821\u20137826","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR34","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-95995-3_2","volume":"5427","author":"M. Gonen","year":"2009","unstructured":"Gonen M., Shavitt Y., Approximating the number of network motifs, LECT NOTES COMPUT SC, 2009, 5427, 13\u201324","journal-title":"LECT NOTES COMPUT SC"},{"key":"9_CR35","volume-title":"Data Mining \u2014 Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han J., Kamber M., Data Mining \u2014 Concepts and Techniques, Morgan Kaufmann, San Francisco, 2006"},{"key":"9_CR36","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/S0219525903000803","volume":"6","author":"P. Holme","year":"2003","unstructured":"Holme P., Congestion and centrality in traffic flow on complex networks, ADV COMPLEX SYST, 2003, 6, 163\u2013176","journal-title":"ADV COMPLEX SYST"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Jackson M.O., Social and economic networks, Princeton University Press, 2010","DOI":"10.2307\/j.ctvcm4gh1"},{"key":"9_CR38","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H. Jeong","year":"2001","unstructured":"Jeong H., Mason S.P., Barab\u00e1si A.-L., Oltvai Z.N., Lethality and centrality in protein networks, NATURE, 2001, 411, 41\u201342","journal-title":"NATURE"},{"key":"9_CR39","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z.R.M. Kashani","year":"2009","unstructured":"Kashani Z.R.M., Ahrabian H., Elahi E., Nowzari-Dalini A., Ansari E.S., Asadi S., Mohammadi S., Schreiber F., Masoudi-Nejad A., Kavosh: a new algorithm for finding network motifs, BMC BIOINFORMATICS, 2009, 10, 318\u2013329","journal-title":"BMC BIOINFORMATICS"},{"key":"9_CR40","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan N., Itzkovitz S., Milo R., Alon U., Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, BIOINFORMATICS, 2004, 20, 1746\u20131758","journal-title":"BIOINFORMATICS"},{"key":"9_CR41","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L. Katz","year":"1953","unstructured":"Katz L., A new index derived from sociometric data analysis, PSYCHOMETRIKA, 1953, 18, 39\u201343","journal-title":"PSYCHOMETRIKA"},{"key":"9_CR42","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1002\/bies.20294","volume":"27","author":"E.F. Keller","year":"2005","unstructured":"Keller E.F., Revisiting \u201cscale-free\u201d networks, BIOESSAYS, 2005, 27, 1060\u20131068","journal-title":"BIOESSAYS"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Kelvin W.T., Electrical units of measurement, Popular Lectures and Addresses (Vol. 1), London MacMillian, 1889","DOI":"10.5962\/bhl.title.31742"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Kleinberg J., The small-world phenomenon: An algorithmic perspective, Proceedings of the 32nd ACM Symposium on Theory of Computing (21\u201323 May 2000, Portland, OR, USA), 2000, 163\u2013170","DOI":"10.1145\/335305.335325"},{"key":"9_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical Analysis of Network Data: Methods and Models","author":"E.D. Kolaczyk","year":"2009","unstructured":"Kolaczyk E.D., Statistical Analysis of Network Data: Methods and Models, Springer Verlag, Heidelberg, 2009"},{"key":"9_CR46","series-title":"LECT NOTES COMPUT SC","volume-title":"Network Analysis \u2014 Methodological Foundations","author":"D. Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki D., Lehmann K.A., Peeters L., Richter S., Tenfelde-Podehl D., Zlotowski O., Centrality Indices, In: Brandes U., Erlebach T. (Eds.), Network Analysis \u2014 Methodological Foundations, LECT NOTES COMPUT SC, 2832, Springer Verlag, New York, 2005"},{"key":"9_CR47","series-title":"LECT NOTES COMPUT SC","volume-title":"Network Analysis - Methodological Foundations","author":"D. Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki D., Lehmann K.A., Tenfelde-Podehl D., Zlotowski O., Advanced Centrality Concepts, In: Brandes U., Erlebach T. (Eds.), Network Analysis - Methodological Foundations, LECT NOTES COMPUT SC, 2832, Springer Verlag, New York, 2005"},{"key":"9_CR48","series-title":"LECT NOTES COMPUT SC","volume-title":"Network Analysis \u2014 Methodological Foundations","author":"J. Lerner","year":"2005","unstructured":"Lerner J., Role Assignments, In: Brandes U., Erlebach T. (Eds.), Network Analysis \u2014 Methodological Foundations, LECT NOTES COMPUT SC, 2832, Springer Verlag, New York, 2005"},{"key":"9_CR49","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D. Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D., Kleinberg J., The link-prediction problem for social networks, J AM SOC INF SCI TEC, 2007, 58, 1019\u20131031","journal-title":"J AM SOC INF SCI TEC"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Lichtenwalter R.N., Dame N., Lussier J.T., Chawla N.V., New Perspectives and Methods in Link Prediction, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (25\u201328 July 2010, Washington DC, DC, USA), ACM, 2010","DOI":"10.1145\/1835804.1835837"},{"key":"9_CR51","unstructured":"Milo R., Kashtan N., Itzkovitz S., Newman M.E.J., Alon U., On the uniform generation of random graphs with prescribed degree sequences, preprint available at http:\/\/arxiv.org\/abs\/cond-mat\/0312028"},{"key":"9_CR52","doi-asserted-by":"crossref","first-page":"085102","DOI":"10.1103\/PhysRevB.70.085102","volume":"70","author":"R. Milo","year":"2004","unstructured":"Milo R., Kashtan N., Itzkovitz S., Newman M.E.J., Alon U., Subgraphs in networks, PHYS REV E, 2004, 70, 085102","journal-title":"PHYS REV E"},{"key":"9_CR53","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1126\/science.1100519","volume":"305","author":"R. Milo","year":"2004","unstructured":"Milo R., Itzkovitz S., Kashtan N., Levitt R., Alon U., Response to comment on \u201cnetwork motifs: Simple building blocks of complex networks\u201d and \u201csuperfamilies of evolved and designed networks\u201d, SCIENCE, 2004, 305, 1107","journal-title":"SCIENCE"},{"key":"9_CR54","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R. Milo","year":"2004","unstructured":"Milo R., Itzkovitz S., Kashtan N., Levitt R., Shen-Orr S., Ayzenshtat I., Sheffer M., Alon U., Superfamilies of evolved and designed networks, SCIENCE, 2004, 303, 1538\u20131542","journal-title":"SCIENCE"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Newman M.E.J., Networks: An Introduction, Oxford University Press, 2010","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"},{"key":"9_CR56","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.021544898","volume":"98","author":"M.E.J. Newman","year":"2001","unstructured":"Newman M.E.J., The structure of scientific collaboration networks, P NATL ACAD SCI USA, 2001, 98, 404\u2013409","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR57","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman M.E.J., Fast algorithm for detecting community structure in networks, PHYS REV E, 2004, 69, 066133","journal-title":"PHYS REV E"},{"key":"9_CR58","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M.E.J. Newman","year":"2006","unstructured":"Newman M.E.J., Modularity and community structure in networks, P NATL ACAD SCI USA, 2006, 103, 8577\u20138582","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR59","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman M.E.J., Girvan M., Finding and evaluating community structure in networks, PHYS REV E, 2004, 69, 026113","journal-title":"PHYS REV E"},{"key":"9_CR60","series-title":"LECT NOTES COMPUT SC","volume-title":"Network Analysis \u2014 Methodological Foundations","author":"M. Nunkesser","year":"2005","unstructured":"Nunkesser M., Sawitzki D., Blockmodels, In: Brandes U., Erlebach T. (Eds.), Network Analysis \u2014 Methodological Foundations, LECT NOTES COMPUT SC, 2832, Springer-Verlag, New York, 2005"},{"key":"9_CR61","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1086\/230190","volume":"98","author":"J.F. Padgett","year":"1993","unstructured":"Padgett J.F., Ansell C.K., Robust action and the rise of the medici, AM J SOCIOL, 1993, 98, 1259\u20131319","journal-title":"AM J SOCIOL"},{"key":"9_CR62","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla G., Der\u00e9nyi I., Farkas I., Vicsek T., Uncovering the overlapping community structure of complex networks in nature and society, NATURE, 2005, 435, 814\u2013818","journal-title":"NATURE"},{"key":"9_CR63","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1093\/bioinformatics\/btl030","volume":"22","author":"N. Przulj","year":"2006","unstructured":"Przulj N., Corneil D.G., Jurisica I., Efficient estimation of graphlet frequency distributions in protein-protein interaction networks, BIOINFORMATICS, 2006, 22, 974\u2013980","journal-title":"BIOINFORMATICS"},{"key":"9_CR64","volume-title":"Social Network Analysis","author":"J. Scott","year":"2003","unstructured":"Scott J., Social Network Analysis, 2nd edition, reprinted edition, SAGE Publications, London, 2003","edition":"2nd edition"},{"key":"9_CR65","volume-title":"Introduction to Percolation Theory","author":"D. Stauffer","year":"1994","unstructured":"Stauffer D., Aharony A., Introduction to Percolation Theory, CRC, Boca Raton, USA, 1994"},{"key":"9_CR66","doi-asserted-by":"crossref","unstructured":"Tarkoma S., Overlay Networks: Toward Information Networking, Auerbach Publications, 2010","DOI":"10.1201\/9781439813737"},{"key":"9_CR67","volume-title":"Social Network Analysis \u2014 Methods and Applications","author":"S. Wasserman","year":"1999","unstructured":"Wasserman S., Faust K., Social Network Analysis \u2014 Methods and Applications, revised, reprinted edition, Cambridge University Press, Cambridge, 1999"},{"key":"9_CR68","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts D.J., Strogatz S.H., Collective dynamics of \u2019small-world\u2019 networks, NATURE, 1998, 393, 440\u2013442","journal-title":"NATURE"},{"key":"9_CR69","doi-asserted-by":"crossref","first-page":"13382","DOI":"10.1073\/pnas.172501399","volume":"99","author":"S.-H. Yook","year":"2002","unstructured":"Yook S.-H., Jeong H., Barab\u00e1si A.-L., Modeling the internet\u2019s large-scale topology, P NATL ACAD SCI USA, 2002, 99, 13382\u20133386","journal-title":"P NATL ACAD SCI USA"},{"key":"9_CR70","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W.W. Zachary","year":"1977","unstructured":"Zachary W.W., An information flow model for conflict and fission in small groups, J ANTHROPOL RES, 1977, 33, 452\u2013473","journal-title":"J ANTHROPOL RES"},{"key":"9_CR71","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1748-7188-4-12","volume":"4","author":"L.A. Zahor\u00e1nszky","year":"2009","unstructured":"Zahor\u00e1nszky L.A., Katona G.Y., H\u00e1ri P., M\u00e1ln\u00e1si-Csizmadia A., Zweig K.A., Zahor\u00e1nszky-K\u00f6halmi G., Breaking the hierarchy \u2014 a new cluster selection mechanism for hierarchical clustering methods, ALGORITHM MOL BIOL, 2009, 4, 12","journal-title":"ALGORITHM MOL BIOL"},{"key":"9_CR72","unstructured":"Zweig K., Kaufmann M., A systematic approach to the one-mode projection of bipartite graphs, SOCIAL NETWORK ANALYSIS AND MINING, (in press)"},{"key":"9_CR73","doi-asserted-by":"crossref","unstructured":"Zweig K.A., How to forget the second side of the story: A new method for the one-mode projection of bipartite graphs, Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining ASONAM 2010 (9\u201311 August 2010, Odense, Denmark), IEEE Computer Society, 2010, 200\u2013207","DOI":"10.1109\/ASONAM.2010.24"}],"container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0009-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13537-011-0009-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0009-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T17:28:19Z","timestamp":1741109299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-011-0009-x\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":73,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.2478\/s13537-011-0009-x","relation":{},"ISSN":["2299-1093"],"issn-type":[{"type":"electronic","value":"2299-1093"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}