{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:11:32Z","timestamp":1742955092618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211300"},{"type":"electronic","value":"9783031211317"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-21131-7_26","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:15Z","timestamp":1674669855000},"page":"337-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Intersection of\u00a0Random Spanning Trees in\u00a0Small-World Networks"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"London","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Pluh\u00e1r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Karp, R. M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78\u2013100. (1995). https:\/\/doi.org\/10.1137\/S0097539792224474","DOI":"10.1137\/S0097539792224474"},{"key":"26_CR2","doi-asserted-by":"publisher","unstructured":"Gueye, A., Walrand, J.C., Anantharam, V.: Design of network topology in an adversarial environment. In: International Conference on Decision and Game Theory for Security, pp. 1\u201320. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17197-0_1","DOI":"10.1007\/978-3-642-17197-0_1"},{"key":"26_CR3","unstructured":"Kottegoda, K.: Spanning tree modulus and secure broadcast games. Ph.D. Thesis, Kansas State University (2020). https:\/\/hdl.handle.net\/2097\/40756.24"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Albin, N., Clemens, J., Hoare, D., Poggi-Corradini, P., Sit, B., Tymochko, S.: Fairest edge usage and minimum expected overlap for random spanning trees. Discrete Math. 344(5), 112282 (2021). https:\/\/doi.org\/10.1016\/j.disc.2020.112282","DOI":"10.1016\/j.disc.2020.112282"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17\u201360 (1960). http:\/\/dx.doi.org\/10.1515\/9781400841356.38","DOI":"10.1515\/9781400841356.38"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A. L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). http:\/\/dx.doi.org\/10.1126\/science.286.5439.509","DOI":"10.1126\/science.286.5439.509"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998). https:\/\/doi.org\/10.1038\/30918","DOI":"10.1038\/30918"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Wu, B.Y., Chao, K.M.: Spanning trees and optimization problems. Chapman and Hall\/CRC, New York (2004). https:\/\/doi.org\/10.1201\/9780203497289","DOI":"10.1201\/9780203497289"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Gower, J.C., Ross, G.J.: Minimum spanning trees and single linkage cluster analysis. J. Royal Stat. Soc. Ser. C (Appl. Stat.) 18(1), 54\u201364 (1969). https:\/\/doi.org\/10.2307\/2346439","DOI":"10.2307\/2346439"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Mantegna, R.N.: Hierarchical structure in financial markets. Eur. Phys. J. B 11(1), 193\u2013197 (1999). https:\/\/doi.org\/10.1007\/s100510050929","DOI":"10.1007\/s100510050929"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Tola, V., Lillo, F., Gallegati, M., Mantegna, R.N.: Cluster analysis for portfolio optimization. J. Econ. Dyn. Control 32(1), 235\u2013258 (2008). https:\/\/doi.org\/10.1016\/j.jedc.2007.01.034","DOI":"10.1016\/j.jedc.2007.01.034"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ma, B., Hero, A., Gorman, J., Michel, O.: Image registration with minimum spanning tree algorithm. In: Proceedings International conference on Image Processing, vol. 1, pp. 481\u2013484. IEEE (2000). https:\/\/doi.org\/10.1109\/ICIP.2000.901000","DOI":"10.1109\/ICIP.2000.901000"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Xu, Y., Uberbacher, E.C.: 2D image segmentation using minimum spanning trees. Image Vision Comput. 15(1), 47\u201357 (1997). https:\/\/doi.org\/10.1016\/S0262-8856(96)01105-5","DOI":"10.1016\/S0262-8856(96)01105-5"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 296\u2013303 (1996). https:\/\/doi.org\/10.1145\/237814.237880","DOI":"10.1145\/237814.237880"},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Kim, D.H., Noh, J.D., Jeong, H.: Scale-free trees: the skeletons of complex networks. Phys. Rev. E 70(4), 046126 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.70.046126","DOI":"10.1103\/PhysRevE.70.046126"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Chen, C., Morris, S.: Visualizing evolving networks: minimum spanning trees versus pathfinder networks. In: IEEE Symposium on Information Visualization, pp. 67\u201374. IEEE (2003). https:\/\/doi.org\/10.1109\/INFVIS.2003.1249010","DOI":"10.1109\/INFVIS.2003.1249010"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Granovetter, M.S.: The strength of weak ties. Am. J. Sociol. 78(6), 1360\u20131380. (1973). https:\/\/doi.org\/10.1109\/INFVIS.2003.1249010","DOI":"10.1109\/INFVIS.2003.1249010"},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. (10), P10008 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Ellens, W., Spieksma, F.M., Van Mieghem, P., Jamakovic, A., Kooij, R.E.: Effective graph resistance. Linear Algebra Appl. 435(10), 2491\u20132506 (2011). https:\/\/doi.org\/10.1016\/j.laa.2011.02.024","DOI":"10.1016\/j.laa.2011.02.024"},{"key":"26_CR20","unstructured":"http:\/\/www.personal.umich.edu\/mejn\/netdata\/"},{"key":"26_CR21","unstructured":"https:\/\/networkrepository.com\/"},{"key":"26_CR22","unstructured":"https:\/\/snap.stanford.edu\/data\/"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21131-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:07:43Z","timestamp":1674670063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21131-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211300","9783031211317"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21131-7_26","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","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":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","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"}}]}}