{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:19:09Z","timestamp":1740140349833,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation","doi-asserted-by":"publisher","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10287-023-00466-y","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T11:02:12Z","timestamp":1689591732000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modularity in planted partition model"],"prefix":"10.1007","volume":"20","author":[{"given":"Mikhail","family":"Koshelev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"466_CR1","doi-asserted-by":"crossref","unstructured":"Abbe E, Sandon C (2015) Community detection in general stochastic block models: fundamental limits and efficient algorithms for recovery. In: IEEE 56th annual symposium on foundations of computer science, pp 670\u2013688","DOI":"10.1109\/FOCS.2015.47"},{"key":"466_CR2","doi-asserted-by":"publisher","first-page":"21068","DOI":"10.1073\/pnas.0907096106","volume":"106","author":"PJ Bickel","year":"2009","unstructured":"Bickel PJ, Chen AA (2009) nonparametric view of network models and Newman\u2013Girvan and other modularities. Proc Nat Acad Sci India Sect A 106:21068","journal-title":"Proc Nat Acad Sci India Sect A"},{"key":"466_CR3","doi-asserted-by":"crossref","unstructured":"Bruneau P, Parisot O, Otjacques B (2014) A heuristic for the automatic parametrization of the spectral clustering algorithm. In: 2014 22nd international conference on pattern recognition, pp 1313\u20131318","DOI":"10.1109\/ICPR.2014.235"},{"key":"466_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","journal-title":"Phys Rev E"},{"issue":"4","key":"466_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1134\/S0032946021040086","volume":"57","author":"NM Derevyanko","year":"2021","unstructured":"Derevyanko NM, Koshelev MM (2021) New bounds on the modularity of $$G(n, r, s)$$ and $$G_p(n, r, s)$$ graphs. Probl Inf Transm 57(4):380\u2013401","journal-title":"Probl Inf Transm"},{"issue":"3\u20135","key":"466_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"466_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"SS Fortunato","year":"2007","unstructured":"Fortunato SS, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341","journal-title":"Proc Natl Acad Sci"},{"issue":"301","key":"466_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58(301):13\u201330","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"466_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2140\/moscow.2021.10.61","volume":"10","author":"MM Ipatov","year":"2021","unstructured":"Ipatov MM (2021) Exact modularity of line graphs of complete graphs. Moscow J Combin Number Theory 10(1):61\u201375","journal-title":"Moscow J Combin Number Theory"},{"issue":"1","key":"466_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1134\/S1064562420010147","volume":"101","author":"MM Ipatov","year":"2020","unstructured":"Ipatov MM, Koshelev MM, Raigorodskii AM (2020) Modularity of some distance graphs. Dokl Math 101(1):60\u201361","journal-title":"Dokl Math"},{"issue":"3","key":"466_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113262","volume":"346","author":"M Koshelev","year":"2023","unstructured":"Koshelev M (2023) Spectrum of Johnson graphs. Discrete Math 346(3):113262","journal-title":"Discrete Math"},{"key":"466_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume":"15","author":"M Krivelevich","year":"2006","unstructured":"Krivelevich M, Sudakov B (2006) Pseudo-random graphs. More sets, graphs and numbers. Bolyai Soc Math Stud 15:199\u2013262","journal-title":"Bolyai Soc Math Stud"},{"issue":"1","key":"466_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1214\/14-AOS1274","volume":"43","author":"J Lei","year":"2015","unstructured":"Lei J, Rinaldo A (2015) Consistency of spectral clustering in stochastic block models. Ann Stat 43(1):215\u2013237","journal-title":"Ann Stat"},{"key":"466_CR14","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1093\/comnet\/cnx046","volume":"6","author":"C McDiarmid","year":"2018","unstructured":"McDiarmid C, Skerman F (2018) Modularity of regular and treelike graphs. J Complex Netw 6:596\u2013619","journal-title":"J Complex Netw"},{"issue":"1","key":"466_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/rsa.20910","volume":"57","author":"C McDiarmid","year":"2020","unstructured":"McDiarmid C, Skerman F (2020) Modularity of Erd\u0151s\u2013R\u00e9nyi random graphs. Random Struct Algorithms 57(1):211\u2013243","journal-title":"Random Struct Algorithms"},{"key":"466_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133","journal-title":"Phys Rev E"},{"key":"466_CR17","first-page":"26","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:26\u2013113","journal-title":"Phys Rev E"},{"key":"466_CR19","doi-asserted-by":"crossref","unstructured":"Ostroumova Prokhorenkova L, Pralat P, Raigorodskii A (2016) Modularity of complex networks models. In: International workshop on algorithms and models for the web-graph. Springer, Berlin, pp 115\u2013126","DOI":"10.1007\/978-3-319-49787-7_10"},{"key":"466_CR18","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.endm.2017.07.058","volume":"61","author":"L Ostroumova Prokhorenkova","year":"2017","unstructured":"Ostroumova Prokhorenkova L, Pralat P, Raigorodskii A (2017) Modularity in several random graph models. Electron Notes Discrete Math 61:947\u2013953","journal-title":"Electron Notes Discrete Math"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00466-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00466-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00466-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T16:11:32Z","timestamp":1699632692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00466-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,17]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00466-y","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2023,7,17]]},"assertion":[{"value":"5 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"34"}}