{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:34:43Z","timestamp":1743078883300,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934088"},{"type":"electronic","value":"9783030934095"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93409-5_22","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"260-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Exponential Ranking and\u00a0Its Linear Counterpart"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Gromov","sequence":"first","affiliation":[]},{"given":"Elizaveta","family":"Evmenova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10791-005-5660-1","volume":"8","author":"M Agosti","year":"2005","unstructured":"Agosti, M., Pretto, L.: A theoretical study of a generalized version of Kleinberg\u2019s HITS algorithm. Inf. Retrieval 8(2), 219\u2013243 (2005)","journal-title":"Inf. Retrieval"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"22_CR3","volume-title":"The Probabilistic Method","author":"N Alon","year":"2004","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Hoboken (2004)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Anchuri, P., Magdon-Ismail, M.: Communities and balance in signed networks: a spectral approach. In: 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 235\u2013242. IEEE (2012)","DOI":"10.1109\/ASONAM.2012.48"},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987)","journal-title":"Am. J. Sociol."},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.socnet.2004.08.007","volume":"26","author":"P Bonacich","year":"2004","unstructured":"Bonacich, P., Lloyd, P.: Calculating status with negative relations. Soc. Netw. 26(4), 331\u2013338 (2004)","journal-title":"Soc. Netw."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998). Proceedings of the Seventh International World Wide Web Conference","DOI":"10.1016\/S0169-7552(98)00110-X"},{"issue":"1","key":"22_CR8","first-page":"1177","volume":"15","author":"KY Chiang","year":"2014","unstructured":"Chiang, K.Y., Hsieh, C.J., Natarajan, N., Dhillon, I.S., Tewari, A.: Prediction and clustering in signed networks: a local to global perspective. J. Mach. Learn. Res. 15(1), 1177\u20131213 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"22_CR9","first-page":"261","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the strength of connectedness of a random graph. Acta Mathematica Hungarica 12(1), 261\u2013267 (1961)","journal-title":"Acta Mathematica Hungarica"},{"key":"22_CR10","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-64877-0_8","volume-title":"Networks in the Global World V","author":"E Evmenova","year":"2021","unstructured":"Evmenova, E., Gromov, D.: Analysis of directed signed networks: triangles inventory. In: Antonyuk, A., Basov, N. (eds.) NetGloW 2020. LNNS, vol. 181, pp. 120\u2013132. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-64877-0_8"},{"key":"22_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"issue":"1\/2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"de Kerchove, C., van Dooren, P.: The PageTrust algorithm: how to rank web pages when negative links are allowed? In: Proceedings of the 2008 SIAM International Conference on Data Mining, pp. 346\u2013352. SIAM (2008)","DOI":"10.1137\/1.9781611972788.31"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"012320","DOI":"10.1103\/PhysRevE.99.012320","volume":"99","author":"A Kirkley","year":"2019","unstructured":"Kirkley, A., Cantwell, G.T., Newman, M.: Balance in signed networks. Phys. Rev. E 99(1), 012320 (2019)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"22_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"22_CR16","volume-title":"Google\u2019s PageRank and Beyond","author":"AN Langville","year":"2011","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond. Princeton University Press, Princeton (2011)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mishra, A., Bhattacharya, A.: Finding the bias and prestige of nodes in networks based on trust scores. In: Proceedings of the 20th International Conference on World Wide Web, pp. 567\u2013576 (2011)","DOI":"10.1145\/1963405.1963485"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s13278-014-0172-x","volume":"4","author":"M Shahriari","year":"2014","unstructured":"Shahriari, M., Jalili, M.: Ranking nodes in signed social networks. Soc. Netw. Anal. Min. 4(1), 172 (2014). https:\/\/doi.org\/10.1007\/s13278-014-0172-x","journal-title":"Soc. Netw. Anal. Min."},{"issue":"85","key":"22_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1080\/00018737100101261","volume":"20","author":"VK Shante","year":"1971","unstructured":"Shante, V.K., Kirkpatrick, S.: An introduction to percolation theory. Adv. Phys. 20(85), 325\u2013357 (1971)","journal-title":"Adv. Phys."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-16567-2_14","volume-title":"Social Informatics","author":"VA Traag","year":"2010","unstructured":"Traag, V.A., Nesterov, Y.E., Van Dooren, P.: Exponential ranking: taking into account negative links. In: Bolc, L., Makowski, M., Wierzbicki, A. (eds.) SocInfo 2010. LNCS, vol. 6430, pp. 192\u2013202. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16567-2_14"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1852102.1852106","volume":"28","author":"W Webber","year":"2010","unstructured":"Webber, W., Moffat, A., Zobel, J.: A similarity measure for indefinite rankings. ACM Trans. Inf. Syst. 28(4), 1\u201338 (2010)","journal-title":"ACM Trans. Inf. Syst."},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Xing, W., Ghorbani, A.: Weighted PageRank algorithm. In: Proceedings of Second Annual Conference on Communication Networks and Services Research, 2004, pp. 305\u2013314 (2004)","DOI":"10.1109\/DNSR.2004.1344743"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93409-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:34:03Z","timestamp":1682627643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_22","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}