{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T11:00:39Z","timestamp":1764414039869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545337"},{"type":"electronic","value":"9783031545344"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54534-4_23","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:39:18Z","timestamp":1710844758000},"page":"325-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Limit Distributions of\u00a0Friendship Index in\u00a0Scale-Free Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4047-8239","authenticated-orcid":false,"given":"Sergei","family":"Sidorov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3699-5006","authenticated-orcid":false,"given":"Sergei","family":"Mironov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3820-9523","authenticated-orcid":false,"given":"Alexey","family":"Grigoriev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1038\/s41467-020-14394-x","volume":"11","author":"N Alipourfard","year":"2020","unstructured":"Alipourfard, N., Nettasinghe, B., Abeliuk, A., Krishnamurthy, V., Lerman, K.: Friendship paradox biases perceptions in directed networks. Nat. Commun. 11(1), 707 (2020). https:\/\/doi.org\/10.1038\/s41467-020-14394-x","journal-title":"Nat. Commun."},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds\/s13688-017-0100-1","volume":"6","author":"J Bollen","year":"2017","unstructured":"Bollen, J., Gon\u00e7alves, B., van de Leemput, I., Ruan, G.: The happiness paradox: your friends are happier than you. EPJ Data Sci. 6(1), 1\u201317 (2017). https:\/\/doi.org\/10.1140\/epjds\/s13688-017-0100-1","journal-title":"EPJ Data Sci."},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1214\/12-SSY076","volume":"3","author":"N Chen","year":"2013","unstructured":"Chen, N., Olvera-Cravioto, M.: Directed random graphs with given degree distributions. Stochast. Syst. 3(1), 147\u2013186 (2013). https:\/\/doi.org\/10.1214\/12-SSY076","journal-title":"Stochast. Syst."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"4603","DOI":"10.1038\/srep04603","volume":"4","author":"YH Eom","year":"2014","unstructured":"Eom, Y.H., Jo, H.H.: Generalized friendship paradox in complex networks: the case of scientific collaboration. Sci. Rep. 4, 4603 (2014). https:\/\/doi.org\/10.1038\/srep04603","journal-title":"Sci. Rep."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-15168-7_43","volume-title":"Social Informatics","author":"B Fotouhi","year":"2015","unstructured":"Fotouhi, B., Momeni, N., Rabbat, M.G.: Generalized friendship paradox: an analytical approach. In: Aiello, L.M., McFarland, D. (eds.) SocInfo 2014. LNCS, vol. 8852, pp. 339\u2013352. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15168-7_43"},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/comnet\/cny029","volume":"7","author":"DJ Higham","year":"2018","unstructured":"Higham, D.J.: Centrality-friendship paradoxes: when our friends are more important than us. J. Complex Netw. 7(4), 515\u2013528 (2018). https:\/\/doi.org\/10.1093\/comnet\/cny029","journal-title":"J. Complex Netw."},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Hofstad, R.V.D.: Random Graphs and Complex Networks. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2016). https:\/\/doi.org\/10.1017\/9781316779422","DOI":"10.1017\/9781316779422"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1086\/701031","volume":"127","author":"MO Jackson","year":"2019","unstructured":"Jackson, M.O.: The friendship paradox and systematic biases in perceptions and social norms. J. Polit. Econ. 127(2), 777\u2013818 (2019). https:\/\/doi.org\/10.1086\/701031","journal-title":"J. Polit. Econ."},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"052302","DOI":"10.1103\/PhysRevE.99.052302","volume":"99","author":"E Lee","year":"2019","unstructured":"Lee, E., Lee, S., Eom, Y.H., Holme, P., Jo, H.H.: Impact of perception models on friendship paradox and opinion formation. Phys. Rev. E 99(5), 052302 (2019). https:\/\/doi.org\/10.1103\/PhysRevE.99.052302","journal-title":"Phys. Rev. E"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"022801","DOI":"10.1103\/PhysRevE.87.022801","volume":"87","author":"N Litvak","year":"2013","unstructured":"Litvak, N., van der Hofstad, R.: Uncovering disassortativity in large scale-free networks. Phys. Rev. E 87, 022801 (2013). https:\/\/doi.org\/10.1103\/PhysRevE.87.022801","journal-title":"Phys. Rev. E"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"e0143633","DOI":"10.1371\/journal.pone.0143633","volume":"11","author":"N Momeni","year":"2016","unstructured":"Momeni, N., Rabbat, M.: Qualities and inequalities in online social networks through the lens of the generalized friendship paradox. PLoS ONE 11(2), e0143633 (2016). https:\/\/doi.org\/10.1371\/journal.pone.0143633","journal-title":"PLoS ONE"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s41109-019-0190-8","volume":"4","author":"S Pal","year":"2019","unstructured":"Pal, S., Yu, F., Novick, Y., Bar-Noy, A.: A study on the friendship paradox \u2013 quantitative analysis and relationship with assortative mixing. Appl. Netw. Sci. 4(1), 71 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0190-8","journal-title":"Appl. Netw. Sci."},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM (2017). https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Samorodnitsky, G., Taqqu, M.S.: Stable Non-Gaussian Random Processes. Routledge (2017). https:\/\/doi.org\/10.1201\/9780203738818","DOI":"10.1201\/9780203738818"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Sidorov, S., Mironov, S., Grigoriev, A.: Measuring the variability of local characteristics in complex networks: empirical and analytical analysis. Chaos: Interdisc. J. Nonlinear Sci. 33(6), 063106 (2023). https:\/\/doi.org\/10.1063\/5.0148803","DOI":"10.1063\/5.0148803"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s41109-021-00391-6","volume":"6","author":"SP Sidorov","year":"2021","unstructured":"Sidorov, S.P., Mironov, S.V., Grigoriev, A.A.: Friendship paradox in growth networks: analytical and empirical analysis. Appl. Netw. Sci. 6, 51 (2021). https:\/\/doi.org\/10.1007\/s41109-021-00391-6","journal-title":"Appl. Netw. Sci."},{"key":"23_CR17","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-030-65351-4_36","volume-title":"Complex Networks & Their Applications IX","author":"S Sidorov","year":"2021","unstructured":"Sidorov, S., Mironov, S., Malinskii, I., Kadomtsev, D.: Local degree asymmetry for preferential attachment model. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) COMPLEX NETWORKS 2020 2020. SCI, vol. 944, pp. 450\u2013461. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-65351-4_36"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Whitt, W.: Stochastic-Process Limits. Springer, New York (2002). https:\/\/doi.org\/10.1007\/b97479","DOI":"10.1007\/b97479"},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Yao, D., van der Hoorn, P., Litvak, N.: Average nearest neighbor degrees in scale-free networks. Internet math. 2018, 1\u201338 (2018). https:\/\/doi.org\/10.24166\/im.02.2018","DOI":"10.24166\/im.02.2018"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54534-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T10:43:42Z","timestamp":1710845022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54534-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545337","9783031545344"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54534-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yerevan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Armenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"93","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.62","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Out of the 93 submission, 17 were rejected before being sent to peer review.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}