{"id":"https://openalex.org/W7166827449","doi":"https://doi.org/10.4230/lipics.icalp.2026.28","title":"The Stochastic Block Model Has the Overlap Graph Property for Modularity","display_name":"The Stochastic Block Model Has the Overlap Graph Property for Modularity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166827449","doi":"https://doi.org/10.4230/lipics.icalp.2026.28"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26417","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.28/LIPIcs.ICALP.2026.28.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.28/LIPIcs.ICALP.2026.28.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032815468","display_name":"Shankar Bhamidi","orcid":"https://orcid.org/0009-0000-3953-936X"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhamidi, Shankar","raw_affiliation_strings":["Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, NC, USA"],"raw_orcid":"https://orcid.org/0009-0000-3953-936X","affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, NC, USA","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139836049","display_name":"David Gamarnik","orcid":"https://orcid.org/0000-0001-8898-8778"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gamarnik, David","raw_affiliation_strings":["MIT Sloan School of Management, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8898-8778","affiliations":[{"raw_affiliation_string":"MIT Sloan School of Management, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034587660","display_name":"Remco van der Hofstad","orcid":"https://orcid.org/0000-0003-1331-9697"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"van der Hofstad, Remco","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1331-9697","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087671143","display_name":"Nelly Litvak","orcid":"https://orcid.org/0000-0002-6750-3484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Litvak, Nelly","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-6750-3484","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079925942","display_name":"Pawe\u0142 Pra\u0142at","orcid":"https://orcid.org/0000-0001-9176-8493"},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pra\u0142at, Pawe\u0142","raw_affiliation_strings":["Department of Mathematics, Toronto Metropolitan University, Canada"],"raw_orcid":"https://orcid.org/0000-0001-9176-8493","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Toronto Metropolitan University, Canada","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037558079","display_name":"Fiona Skerman","orcid":"https://orcid.org/0000-0003-4141-7059"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Skerman, Fiona","raw_affiliation_strings":["Department of Mathematics, Uppsala University, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4141-7059","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114336486","display_name":"Yasmin Tousinejad","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Tousinejad, Yasmin","raw_affiliation_strings":["Department of Mathematics, Uppsala University, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-6860-9985","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87760159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.44029998779296875,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.44029998779296875,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.12530000507831573,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.11490000039339066,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stochastic-block-model","display_name":"Stochastic block model","score":0.7128999829292297},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6503999829292297},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.6503000259399414},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5812000036239624},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47540000081062317},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4715999960899353},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.39579999446868896},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3790999948978424},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.37709999084472656}],"concepts":[{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.7128999829292297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6633999943733215},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6503999829292297},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.6503000259399414},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5812000036239624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49720001220703125},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47540000081062317},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4715999960899353},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4235999882221222},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.39579999446868896},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3637999892234802},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.33009999990463257},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27079999446868896},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.266400009393692},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.25760000944137573},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26417","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.28/LIPIcs.ICALP.2026.28.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.28","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.28","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26417","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.28/LIPIcs.ICALP.2026.28.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166827449.pdf","grobid_xml":"https://content.openalex.org/works/W7166827449.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"overlap":[1],"gap":[2],"property":[3],"(OGP)":[4],"is":[5,153,204,215,235],"a":[6,19,51,128,147,165,185],"statement":[7],"about":[8],"the":[9,42,48,60,71,110,114,123,139,156,175,198,210,216,232,238],"geometry":[10],"of":[11,18,21,90,105,130,155,180,202],"near-optimal":[12],"solutions.":[13],"Exhibiting":[14],"OGP":[15,121,160],"implies":[16],"failure":[17],"class":[20,129],"local":[22,106,131,206],"algorithms;":[23],"and":[24,62,141,189],"has":[25,50,161],"been":[26,162],"observed":[27],"to":[28,172,237],"coincide":[29],"with":[30,36,54,75,84,195,222,227],"conjectured":[31],"algorithmic":[32],"limits":[33,104],"in":[34,80,98,138],"problems":[35],"statistical":[37],"computational":[38],"gap.":[39],"We":[40,116,219],"consider":[41,174],"Stochastic":[43],"Block":[44],"Model":[45],"(SBM),":[46],"where":[47,159,213],"graph":[49,217],"planted":[52,211,239],"partition":[53,201,226],"k":[55],"equal-size":[56],"blocks":[57],"which":[58],"form":[59],"\"communities\",":[61],"where,":[63],"for":[64,136,146,164],"parameters":[65],"p":[66],">":[67],"q,":[68,86],"vertices":[69,79],"within":[70],"same":[72],"community":[73],"connect":[74,83],"probability":[76,85],"p,":[77],"while":[78],"different":[81],"communities":[82],"independently":[87],"across":[88],"pairs":[89],"vertices.":[91],"Modularity-based":[92],"clustering":[93],"algorithms":[94,107,132],"have":[95],"become":[96],"ubiquitous":[97],"applications.":[99],"This":[100,125],"article":[101],"studies":[102],"theoretical":[103],"based":[108,133],"on":[109,113,122,134],"modularity":[111,119,135,199,228],"score":[112,229],"SBM.":[115,124],"establish":[117],"that":[118,194],"exhibits":[120],"rules":[126],"out":[127],"recovery":[137],"SBM,":[140],"shows":[142],"slow":[143],"mixing":[144],"time":[145],"related":[148],"Markov":[149],"Chain.":[150],"Theoretically":[151],"this":[152],"one":[154],"few":[157],"instances":[158],"established":[163,193],"\"planted\"":[166],"model,":[167],"as":[168],"most":[169],"such":[170],"analyses":[171],"date":[173],"\"null\"":[176],"model.":[177],"As":[178],"part":[179],"our":[181],"analysis,":[182],"we":[183],"extend":[184],"result":[186],"by":[187],"Bickel":[188],"Chen":[190],"2009,":[191],"who":[192],"high":[196,223],"probability,":[197,224],"optimal":[200,233],"SBM":[203],"o(n)":[205],"moves":[207],"away":[208],"from":[209],"partition,":[212],"n":[214],"size.":[218],"show":[220],"that,":[221],"any":[225],"sufficiently":[230],"near":[231],"value":[234],"close":[236],"partition.":[240]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-07-02T00:00:00"}