{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T06:27:40Z","timestamp":1762928860724,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:00:00Z","timestamp":1606262400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:00:00Z","timestamp":1606262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007051","name":"Uppsala University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007051","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Analyzing ego networks to investigate local properties and behaviors of individuals is a fundamental task in social network research. In this paper we show that there is not a unique way of defining ego networks when the existence of edges is uncertain, since there are two different ways of defining the neighborhood of a node in such network models. Therefore, we introduce two definitions of probabilistic ego networks, called V-Alters-Ego and F-Alters-Ego, both rooted in the literature. Following that, we investigate three fundamental measures (degree, betweenness and closeness) for each definition. We also propose a method to approximate betweenness of an ego node among the neighbors which are connected via shortest paths with length 2. We show that this approximation method is faster to compute and it has high correlation with ego betweenness under the V-Alters-Ego definition in many datasets. Therefore, it can be a reasonable alternative to represent the extent to which a node plays the role of an intermediate node among its neighbors.<\/jats:p>","DOI":"10.1007\/s13278-020-00708-w","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T16:03:18Z","timestamp":1606320198000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Defining and measuring probabilistic ego networks"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5797-1068","authenticated-orcid":false,"given":"Amin","family":"Kaveh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Magnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Rohner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"708_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wang H (2010) Graph data management and mining: a survey of algorithms and applications. In: Managing and mining graph data. Springer, pp 13\u201368","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"708_CR4","doi-asserted-by":"crossref","unstructured":"Arnaboldi V, La\u00a0Gala M, Passarella A, Conti M (2014) The role of trusted relationships on content spread in distributed online social networks. In: European Conference on Parallel Processing. Springer, pp 287\u2013298","DOI":"10.1007\/978-3-319-14325-5_25"},{"key":"708_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.comcom.2015.09.028","volume":"76","author":"V Arnaboldi","year":"2016","unstructured":"Arnaboldi V, Conti M, La Gala M, Passarella A, Pezzoni F (2016a) Ego network structure in online social networks and its impact on information diffusion. Comput Commun 76:26\u201341","journal-title":"Comput Commun"},{"issue":"6","key":"708_CR5","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1007\/s12083-015-0395-2","volume":"9","author":"V Arnaboldi","year":"2016","unstructured":"Arnaboldi V, La Gala M, Passarella A, Conti M (2016b) Information diffusion in distributed OSN: the impact of trusted relationships. Peer-to-Peer Netw Appl 9(6):1195\u20131208","journal-title":"Peer-to-Peer Netw Appl"},{"key":"708_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.osnem.2017.04.001","volume":"1","author":"V Arnaboldi","year":"2017","unstructured":"Arnaboldi V, Conti M, Passarella A, Dunbar RI (2017) Online social networks and information diffusion: the role of ego networks. Online Soc Netw Media 1:44\u201355","journal-title":"Online Soc Netw Media"},{"issue":"6","key":"708_CR6","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1101\/gr.2203804","volume":"14","author":"S Asthana","year":"2004","unstructured":"Asthana S, King OD, Gibbons FD, Roth FP (2004) Predicting protein complex membership using probabilistic network reliability. Genome Res 14(6):1170\u20131175","journal-title":"Genome Res"},{"issue":"3","key":"708_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0378-8733(79)90014-5","volume":"2","author":"HR Bernard","year":"1979","unstructured":"Bernard HR, Killworth PD, Sailer L (1979) Informant accuracy in social network data IV: a comparison of clique-level structure in behavioral and cognitive network data. Soc Netw 2(3):191\u2013218","journal-title":"Soc Netw"},{"issue":"1","key":"708_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0049-089X(82)90006-0","volume":"11","author":"HR Bernard","year":"1982","unstructured":"Bernard HR, Killworth PD, Sailer L (1982) Informant accuracy in social-network data V. An experimental attempt to predict actual communication from recall data. Soc Sci Res 11(1):30\u201366","journal-title":"Soc Sci Res"},{"key":"708_CR9","doi-asserted-by":"crossref","unstructured":"Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014) Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1316\u20131325","DOI":"10.1145\/2623330.2623655"},{"issue":"2","key":"708_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154524","volume":"51","author":"I Brugere","year":"2018","unstructured":"Brugere I, Gallagher B, Berger-Wolf TY (2018) Network structure inference, a survey: motivations, methods, and applications. ACM Comput Surv (CSUR) 51(2):1\u201339","journal-title":"ACM Comput Surv (CSUR)"},{"key":"708_CR11","doi-asserted-by":"crossref","unstructured":"De Choudhury M, Mason WA, Hofman JM, Watts DJ (2010) Inferring relevant social networks from interpersonal communication. In: Proceedings of the 19th international conference on World wide web, pp 301\u2013310","DOI":"10.1145\/1772690.1772722"},{"issue":"1","key":"708_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","volume":"27","author":"M Everett","year":"2005","unstructured":"Everett M, Borgatti SP (2005) Ego network betweenness. Soc Netw 27(1):31\u201338","journal-title":"Soc Netw"},{"key":"708_CR13","doi-asserted-by":"crossref","unstructured":"Fushimi T, Saito K, Ikeda T, Kazama, K (2018) A new group centrality measure for maximizing the connectedness of network under uncertain connectivity. In: International conference on complex networks and their applications. Springer, pp 3\u201314","DOI":"10.1007\/978-3-030-05411-3_1"},{"issue":"6","key":"708_CR14","doi-asserted-by":"publisher","first-page":"3616","DOI":"10.1109\/TNET.2017.2756925","volume":"25","author":"X Gao","year":"2017","unstructured":"Gao X, Chen Z, Wu F, Chen G (2017) Energy efficient algorithms for k-sink minimum movement target coverage problem in mobile sensor network. IEEE\/ACM Trans Netw 25(6):3616\u20133627","journal-title":"IEEE\/ACM Trans Netw"},{"key":"708_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comnet\/cnz003","volume":"1","author":"A Kaveh","year":"2019","unstructured":"Kaveh A, Magnani M, Rohner C (2019) Comparing node degrees in probabilistic networks. J Complex Netw 1:1. https:\/\/doi.org\/10.1093\/comnet\/cnz003","journal-title":"J Complex Netw"},{"issue":"1","key":"708_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0378-8733(79)90009-1","volume":"2","author":"PD Killworth","year":"1979","unstructured":"Killworth PD, Bernard HR (1979) Informant accuracy in social network data III: a comparison of triadic structure in behavioral and cognitive data. Soc Netw 2(1):19\u201346","journal-title":"Soc Netw"},{"key":"708_CR17","doi-asserted-by":"crossref","unstructured":"Lu Z, Sun X, La Porta T (2016) Cooperative data offloading in opportunistic mobile networks. In: IEEE INFOCOM 2016-The 35th annual IEEE international conference on computer communications. IEEE, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524494"},{"key":"708_CR18","doi-asserted-by":"crossref","unstructured":"Magnani M, Montesi D, Rossi L (2010) Friendfeed breaking news: death of a public figure. In: 2010 IEEE second international conference on social computing. IEEE, pp 528\u2013533","DOI":"10.1109\/SocialCom.2010.83"},{"issue":"4","key":"708_CR19","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0378-8733(02)00016-3","volume":"24","author":"PV Marsden","year":"2002","unstructured":"Marsden PV (2002) Egocentric and sociocentric measures of network centrality. Soc Netw 24(4):407\u2013422","journal-title":"Soc Netw"},{"issue":"3","key":"708_CR20","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2017","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2017) Enumeration of maximal cliques from an uncertain graph. IEEE Trans Knowl Data Eng 29(3):543\u2013555","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"708_CR21","doi-asserted-by":"crossref","unstructured":"Pantazopoulos P, Karaliopoulos M, Stavrakakis I (2013) On the local approximations of node centrality in internet router-level topologies. In: International workshop on self-organizing systems. Springer, pp 115\u2013126","DOI":"10.1007\/978-3-642-54140-7_10"},{"issue":"3","key":"708_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818182","volume":"40","author":"P Parchas","year":"2015","unstructured":"Parchas P, Gullo F, Papadias D, Bonchi F (2015) Uncertain graph processing through representative instances. ACM Trans Database Syst (TODS) 40(3):1\u201339","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"12","key":"708_CR23","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/TKDE.2018.2819651","volume":"30","author":"P Parchas","year":"2018","unstructured":"Parchas P, Papailiou N, Papadias D, Bonchi F (2018) Uncertain graph sparsification. IEEE Trans Knowl Data Eng 30(12):2435\u20132449. https:\/\/doi.org\/10.1109\/TKDE.2018.2819651","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"708_CR24","unstructured":"Pfeiffer JJ, Neville J (2011) Methods to determine node centrality and clustering in graphs with uncertain structure. In: Fifth international AAAI conference on weblogs and social media"},{"issue":"3","key":"708_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1111\/2041-210X.12468","volume":"7","author":"T Poisot","year":"2016","unstructured":"Poisot T, Cirtwill AR, Cazelles K, Gravel D, Fortin MJ, Stouffer DB (2016) The structure of probabilistic networks. Methods Ecol Evol 7(3):303\u2013312","journal-title":"Methods Ecol Evol"},{"issue":"1\u20132","key":"708_CR26","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1\u20132):997\u20131008","journal-title":"Proc VLDB Endow"},{"issue":"8","key":"708_CR27","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1038\/nbt1103","volume":"23","author":"DR Rhodes","year":"2005","unstructured":"Rhodes DR, Tomlins SA, Varambally S, Mahavisno V, Barrette T, Kalyana-Sundaram S, Ghosh D, Pandey A, Chinnaiyan AM (2005) Probabilistic model of the human protein\u2013protein interaction network. Nat Biotechnol 23(8):951","journal-title":"Nat Biotechnol"},{"issue":"3","key":"708_CR28","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1111\/j.1475-6811.2010.01310.x","volume":"18","author":"SG Roberts","year":"2011","unstructured":"Roberts SG, Dunbar RI (2011) Communication in social networks: effects of kinship, network size, and emotional closeness. Pers Relationsh 18(3):439\u2013452","journal-title":"Pers Relationsh"},{"key":"708_CR29","doi-asserted-by":"crossref","unstructured":"Socievole A, Marano S (2012) Exploring user sociocentric and egocentric behaviors in online and detected social networks. In: 2012 2nd Baltic Congress on Future Internet Communications (BCFIC). IEEE, pp 140\u2013147","DOI":"10.1109\/BCFIC.2012.6217994"},{"issue":"02","key":"708_CR30","doi-asserted-by":"publisher","first-page":"1230002","DOI":"10.1142\/S021972001230002X","volume":"11","author":"S Srihari","year":"2013","unstructured":"Srihari S, Leong HW (2013) A survey of computational methods for protein complex prediction from protein interaction networks. J Bioinform Comput Biol 11(02):1230002","journal-title":"J Bioinform Comput Biol"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00708-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-020-00708-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00708-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T14:06:55Z","timestamp":1637417215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-020-00708-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,25]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["708"],"URL":"https:\/\/doi.org\/10.1007\/s13278-020-00708-w","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2020,11,25]]},"assertion":[{"value":"31 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}