{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T19:26:47Z","timestamp":1744831607574,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T00:00:00Z","timestamp":1566518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T00:00:00Z","timestamp":1566518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17H01826"],"award-info":[{"award-number":["17H01826"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s41109-019-0187-3","type":"journal-article","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T14:02:36Z","timestamp":1566568956000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Estimating node connectedness in spatial network under stochastic link disconnection based on efficient sampling"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-8182","authenticated-orcid":false,"given":"Takayasu","family":"Fushimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumi","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuo","family":"Ikeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Kazama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,23]]},"reference":[{"key":"187_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cor.2017.05.006","volume":"86","author":"A Agra","year":"2017","unstructured":"Agra, A, Cerdeira JO, Requejo C (2017) A decomposition approach for the p-median problem on disconnected graphs. Comput Oper Res 86:79\u201385.","journal-title":"Comput Oper Res"},{"key":"187_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp, O, Erkut E, Drezner Z (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122:21\u201342.","journal-title":"Ann Oper Res"},{"issue":"10","key":"187_CR3","doi-asserted-by":"publisher","first-page":"P10,008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10,008.","journal-title":"J Stat Mech Theory Exp"},{"key":"187_CR4","doi-asserted-by":"publisher","unstructured":"Bonacich, P (1987) Power and Centrality: A Family of Measures. Am J Sociol 92(5):1170\u20131182. https:\/\/doi.org\/10.2307\/2780000 .","DOI":"10.2307\/2780000"},{"key":"187_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30:107\u2013117.","journal-title":"Comput Netw ISDN Syst"},{"issue":"4","key":"187_CR6","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1145\/3186728.3164143","volume":"11","author":"M Ceccarello","year":"2017","unstructured":"Ceccarello, M, Fantozzi C, Pietracaprina A, Pucci G, Vandin F (2017) Clustering uncertain graphs. Proc VLDB Endowment 11(4):472\u2013484.","journal-title":"Proc VLDB Endowment"},{"issue":"21","key":"187_CR7","doi-asserted-by":"publisher","first-page":"5706","DOI":"10.1109\/TSP.2015.2458782","volume":"63","author":"PY Chen","year":"2015","unstructured":"Chen, PY, Hero AO (2015) Deep community detection. IEEE Trans Signal Process 63(21):5706\u20135719.","journal-title":"IEEE Trans Signal Process"},{"key":"187_CR8","doi-asserted-by":"publisher","unstructured":"Clauset, A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066,111+. https:\/\/doi.org\/10.1103\/PhysRevE.70.066111 .","DOI":"10.1103\/PhysRevE.70.066111"},{"issue":"3","key":"187_CR9","doi-asserted-by":"publisher","first-page":"036,125+","DOI":"10.1103\/PhysRevE.73.036125","volume":"73","author":"P Crucitti","year":"2006","unstructured":"Crucitti, P, Latora V, Porta S (2006) Centrality Measures in Spatial Networks of Urban Streets. Phys Rev E 73(3):036,125+.","journal-title":"Phys Rev E"},{"issue":"3","key":"187_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"Linton C. Freeman","year":"1978","unstructured":"Freeman, L (1979) Centrality in social networks: Conceptual clarification. Soc Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7 .","journal-title":"Social Networks"},{"key":"187_CR11","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: Proceedings of the 7th International Conference on Complex Networks and Their Applications, 3\u201314.. Springer.","DOI":"10.1007\/978-3-030-05411-3_1"},{"issue":"12","key":"187_CR12","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799 .","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"9","key":"187_CR13","doi-asserted-by":"publisher","first-page":"551","DOI":"10.14778\/2002938.2002941","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin, R, Liu L, Ding B, Wang H (2011) Distance-constraint reachability computation in uncertain graphs. Proc VLDB Endowment 4(9):551\u2013562.","journal-title":"Proc VLDB Endowment"},{"key":"187_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L (1953) A new status index derived from sociometric analysis. Psychometrika 18:39\u201343.","journal-title":"Psychometrika"},{"issue":"1","key":"187_CR15","first-page":"200","volume":"62","author":"A Kaveh","year":"2018","unstructured":"Kaveh, A, Beitollahi A, Mahdavi V (2018) Locating emergency facilities using the weighted k-median problem: A graph-metaheuristic approach. Period Polytech Civ Eng 62(1):200\u2013205.","journal-title":"Period Polytech Civ Eng"},{"key":"187_CR16","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46:604\u2013632.","journal-title":"J ACM"},{"issue":"3","key":"187_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1023\/B:AURC.0000019375.23201.c1","volume":"65","author":"TV Levanova","year":"2004","unstructured":"Levanova, TV, Loresh MA (2004) Algorithms of ant system and simulated annealing for the p-median problem. Autom Remote Control 65(3):431\u2013438.","journal-title":"Autom Remote Control"},{"issue":"4","key":"187_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg, U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416.","journal-title":"Stat Comput"},{"issue":"3","key":"187_CR19","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.cor.2004.08.008","volume":"33","author":"AR McKendall","year":"2006","unstructured":"McKendall, AR, Shang J (2006) Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res 33(3):790\u2013803.","journal-title":"Comput Oper Res"},{"issue":"6","key":"187_CR20","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1109\/TSMCB.2005.850180","volume":"35","author":"S Misra","year":"2005","unstructured":"Misra, S, Oommen BJ (2005) Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Trans Syst Man Cybern Part B (Cybern) 35(6):1179\u20131192.","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"187_CR21","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society. Nature 435:814\u2013818.","journal-title":"Nature"},{"key":"187_CR22","unstructured":"Park, K, Yilmaz A (2010) A Social Network Analysis Approach to Analyze Road Networks In: Proceedings of the ASPRS Annual Conference 2010."},{"key":"187_CR23","doi-asserted-by":"crossref","unstructured":"Pfeiffer, JJ, Neville J (2011) Methods to determine node centrality and clustering in graphs with uncertain structure In: Proceedings of the Fifth International Conference on Weblogs and Social Media, 590\u2013593.. The AAAI Press.","DOI":"10.1609\/icwsm.v5i1.14187"},{"issue":"1","key":"187_CR24","doi-asserted-by":"publisher","first-page":"e53095","DOI":"10.1371\/journal.pone.0053095","volume":"8","author":"Mahendra Piraveenan","year":"2013","unstructured":"Piraveenan, M, Prokopenko M, Hossain L (2013) Percolation centrality: Quantifying graph-theoretic impact of nodes during percolation in networks. PLoS ONE 8(1):e53,095. https:\/\/doi.org\/10.1371\/journal.pone.0053095 .","journal-title":"PLoS ONE"},{"issue":"1-2","key":"187_CR25","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 Endowment 3(1-2):997\u20131008.","journal-title":"Proc VLDB Endowment"},{"key":"187_CR26","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2013.10.013","volume":"166","author":"J Puerto","year":"2014","unstructured":"Puerto, J, Ricca F, Scozzari A (2014) Unreliable point facility location problems on networks. Discret Appl Math 166:188\u2013203.","journal-title":"Discret Appl Math"},{"issue":"C","key":"187_CR27","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.chb.2016.07.032","volume":"64","author":"A Rezvanian","year":"2016","unstructured":"Rezvanian, A, Meybodi MR (2016) Stochastic graph as a model for social networks. Comput Hum Behav 64(C):621\u2013640.","journal-title":"Comput Hum Behav"},{"key":"187_CR28","volume-title":"Information Retrieval, 2nd edn.","author":"CJV Rijsbergen","year":"1979","unstructured":"Rijsbergen, CJV (1979) Information Retrieval, 2nd edn.. Butterworth-Heinemann, Newton."},{"issue":"3","key":"187_CR29","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287.","journal-title":"Soc Netw"},{"issue":"5","key":"187_CR30","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1587\/transinf.2016EDP7398","volume":"E100.D","author":"Koji TABATA","year":"2017","unstructured":"Tabata, K, Nakamura A, Kudo M (2017) An efficient approximate algorithm for the 1-median problem on a graph. IEICE Trans Inf Syst E100.D(5):994\u20131002. https:\/\/doi.org\/10.1587\/transinf.2016EDP7398 .","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"3","key":"187_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1142\/S0218488517500180","volume":"25","author":"SM Vahidipour","year":"2017","unstructured":"Vahidipour, SM, Meybodi MR, Esnaashari M (2017) Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic petri nets. Int J Uncertain Fuzziness Knowl-Based Syst 25(3):427\u2013455.","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0187-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-019-0187-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0187-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T11:37:12Z","timestamp":1695123432000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-019-0187-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,23]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["187"],"URL":"https:\/\/doi.org\/10.1007\/s41109-019-0187-3","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2019,8,23]]},"assertion":[{"value":"24 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All authors declare no financial and non-financial competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"66"}}