{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T15:49:28Z","timestamp":1740152968835,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K11985","17K00017"],"award-info":[{"award-number":["15K11985","17K00017"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Rev Socionetwork Strat"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s12626-019-00051-3","type":"journal-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T07:03:18Z","timestamp":1567666998000},"page":"123-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hyperfiniteness of Real-World Networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Yutaro","family":"Honda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshitaka","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Munehiko","family":"Sasajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichi","family":"Teruyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., & Barab\u00e1si, A. L. (2002). Statistical mechanics of complex networks. Rev. Mod. Phys., 74, 47\u201397.","journal-title":"Rev. Mod. Phys."},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., & Szegedy, M. (2000). Efficient testing of large graphs. Combinatorica, 20, 451\u2013476.","journal-title":"Combinatorica"},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/060667177","volume":"39","author":"N Alon","year":"2009","unstructured":"Alon, N., Fischer, E., Newman, I., & Shapira, A. (2009). A combinatorial characterization of the testable graph properties: It\u2019s all about regularity. SIAM J. Comput., 39(1), 143\u2013167.","journal-title":"SIAM J. Comput."},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Seymour, P., & Thomas, R. (1990). A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the twenty-second annual ACM symposium on theory of computing (STOC), pp. 293\u2013299.","DOI":"10.1145\/100216.100254"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Benjamini, I., Schramm, O., & Shapira, A. (2008). Every minor-closed property of sparse graphs is testable. In: Proceedings of the fortieth annual ACM symposium on theory of computing (STOC), pp. 393\u2013402.","DOI":"10.1145\/1374376.1374433"},{"issue":"3","key":"51_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., & Rubinfeld, R. (1993). Self-testing\/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3), 549\u2013595.","journal-title":"Journal of Computer and System Sciences"},{"key":"51_CR7","doi-asserted-by":"publisher","unstructured":"Cohen-Steiner, D., Kong, W., Sohler, C., & Valiant, G. (2018). Approximating the spectrum of a graph. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, KDD \u201918, pp. 1263\u20131271. ACM, New York, NY, USA. \n                    https:\/\/doi.org\/10.1145\/3219819.3220119\n                    \n                  .","DOI":"10.1145\/3219819.3220119"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Monemizadeh, M., Onak, K., & Sohler, C. (2011). Planar graphs: random walks and bipartiteness testing. In: IEEE 52nd annual symposium on foundations of computer science (FOCS), pp. 423\u2013432.","DOI":"10.1109\/FOCS.2011.69"},{"issue":"10","key":"51_CR9","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1016\/j.jfa.2008.01.010","volume":"254","author":"G Elek","year":"2008","unstructured":"Elek, G. (2008). L2-spectral invariants and convergent sequences of finite graphs. Journal of Functional Analysis, 254(10), 2667\u20132689.","journal-title":"Journal of Functional Analysis"},{"volume-title":"Property testing: current research and surveys. Lecture notes in computer science","year":"2010","key":"51_CR10","unstructured":"Goldreich, O. (Ed.). (2010). Property testing: current research and surveys. Lecture notes in computer science (Vol. 6390). Berlin: Springer."},{"key":"51_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction to property testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O. (2017). Introduction to property testing. Cambridge: Cambridge University Press."},{"issue":"4","key":"51_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., & Ron, D. (1998). Property testing and its connection to learning and approximation. Journal of the ACM, 45(4), 653\u2013750.","journal-title":"Journal of the ACM"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., & Ron, D. (1997). Property testing in bounded degree graphs. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing (STOC), pp. 406\u2013415. ACM.","DOI":"10.1145\/258533.258627"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kelner, J.A., Nguyen, H.N., & Onak, K. (2009). Local graph partitions for approximation and testing. In: 50th annual IEEE symposium on foundations of computer science (FOCS), pp. 22\u201331.","DOI":"10.1109\/FOCS.2009.77"},{"key":"51_CR15","unstructured":"Ito, H. (2016). Every property is testable on a natural class of scale-free multigraphs. In: P.\u00a0Sankowski, C.\u00a0Zaroliagis (eds.) 24th annual European symposium on algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a057, pp. 51:1\u201351:12."},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-662-43948-7_63","volume-title":"Automata, languages, and programming (ICALP)","author":"M Kusumoto","year":"2014","unstructured":"Kusumoto, M., & Yoshida, Y. (2014). Testing forest-isomorphism in the adjacency list model. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, languages, and programming (ICALP) (pp. 763\u2013774). Berlin Heidelberg: Springer."},{"issue":"3","key":"51_CR17","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2629508","volume":"11","author":"R Levi","year":"2015","unstructured":"Levi, R., & Ron, D. (2015). A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Trans Algorithms, 11(3), 24:1\u201324:13.","journal-title":"ACM Trans Algorithms"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., & Tarjan, R.E. (1977). Applications of a planar separator theorem. In: Foundations of computer science, 1977., 18th annual symposium on, pp. 162\u2013170. IEEE.","DOI":"10.1109\/SFCS.1977.6"},{"issue":"2","key":"51_CR19","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/1497290.1497298","volume":"5","author":"S Marko","year":"2009","unstructured":"Marko, S., & Ron, D. (2009). Approximating the distance to properties in bounded-degree and general sparse graphs. ACM Transactions on Algorithms, 5(2), 22:1\u201322:28.","journal-title":"ACM Transactions on Algorithms"},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Newman, I., & Sohler, C. (2011). Every property of hyperfinite graphs is testable. In: Proceedings of the forty-third annual ACM symposium on theory of computing (STOC), pp. 675\u2013684.","DOI":"10.1145\/1993636.1993726"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Sanders, P., & Schulz, C. (2013). Think Locally, Act Globally: Highly Balanced Graph Partitioning. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913), LNCS, vol. 7933, pp. 164\u2013175. Springer","DOI":"10.1007\/978-3-642-38527-8_16"}],"container-title":["The Review of Socionetwork Strategies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-019-00051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12626-019-00051-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12626-019-00051-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:32:11Z","timestamp":1599175931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12626-019-00051-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s12626-019-00051-3","relation":{},"ISSN":["2523-3173","1867-3236"],"issn-type":[{"type":"print","value":"2523-3173"},{"type":"electronic","value":"1867-3236"}],"subject":[],"published":{"date-parts":[[2019,9,5]]},"assertion":[{"value":"7 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}