{"id":"https://openalex.org/W7161166909","doi":"https://doi.org/10.48550/arxiv.2605.13021","title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","display_name":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161166909","doi":"https://doi.org/10.48550/arxiv.2605.13021"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13021","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.13021","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136096573","display_name":"Xu Bai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bai, Xu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136169927","display_name":"Bin Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136141388","display_name":"Kun Zhang","orcid":"https://orcid.org/0000-0001-8538-3159"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Kun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136151739","display_name":"Shengbo Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Shengbo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136170836","display_name":"Xinbing Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Xinbing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136106469","display_name":"Chenghu Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Chenghu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136126508","display_name":"Meng Jin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin, Meng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9480000138282776,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9480000138282776,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.034699998795986176,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.0027000000700354576,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6414999961853027},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.618399977684021},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5220999717712402},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5198000073432922},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4618000090122223},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4431999921798706},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4138000011444092},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.3880999982357025},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.36039999127388}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6414999961853027},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.618399977684021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6061999797821045},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5913000106811523},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5220999717712402},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5198000073432922},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4431999921798706},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4138000011444092},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41190001368522644},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3880999982357025},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.36039999127388},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.33489999175071716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3327000141143799},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.32600000500679016},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.29789999127388},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.2806999981403351},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.2802000045776367},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C2778841147","wikidata":"https://www.wikidata.org/wiki/Q36381317","display_name":"Selfishness","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26339998841285706},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13021","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.13021","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13021","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph":[0],"coarsening":[1],"is":[2],"a":[3,12,69,105],"graph":[4,17,172,177],"dimensionality":[5],"reduction":[6],"technique":[7],"that":[8,72,135],"aims":[9],"to":[10,68,115,161,175],"construct":[11],"smaller":[13],"and":[14,23,59,81,93,123,142,164],"more":[15],"tractable":[16],"while":[18],"preserving":[19],"the":[20,27,74,98,119,126],"essential":[21],"structural":[22],"semantic":[24],"properties":[25],"of":[26,77,100,150],"original":[28,162],"graph.":[29],"However,":[30],"most":[31],"existing":[32],"methods":[33],"rely":[34],"on":[35,49,118,155],"pair-wise":[36],"similarity":[37],"matching,":[38],"where":[39],"each":[40],"node":[41],"independently":[42],"searches":[43],"for":[44,129],"its":[45],"best":[46],"partner":[47],"based":[48,117],"global":[50],"information.":[51,178],"This":[52],"selfishness":[53],"matching":[54],"paradigm":[55],"incurs":[56],"substantial":[57],"computational":[58,95,127],"memory":[60,91],"overhead.":[61],"To":[62],"address":[63],"this":[64],"problem,":[65],"we":[66,103],"shift":[67],"non-selfishness":[70],"principle":[71],"prioritizes":[73],"collective":[75],"interference":[76,113],"neighborhood":[78],"in":[79,97],"coarsening,":[80],"propose":[82],"an":[83],"efficient":[84],"method":[85],"named":[86],"NOPE,":[87],"which":[88,109],"achieves":[89,137],"linear":[90],"consumption":[92],"near-linear":[94],"complexity":[96],"number":[99],"nodes.":[101,131],"Furthermore,":[102],"derive":[104],"faster":[106],"variant":[107],"NOPE*,":[108],"reduces":[110],"O(\u03b4\\dot":[111],"d)":[112],"evaluation":[114],"O(d)":[116],"local":[120],"isotropy":[121],"assumption,":[122],"consequently":[124],"alleviates":[125],"bottleneck":[128],"high-degree":[130],"Experimental":[132],"results":[133],"show":[134,167],"NOPE*":[136],"1.8-10\\times":[138],"speedup":[139],"over":[140,170],"NOPE":[141],"surpass":[143],"almost":[144],"all":[145],"baselines":[146],"with":[147],"1-3":[148],"orders":[149],"magnitude":[151],"acceleration.":[152],"Meanwhile,":[153],"learning":[154],"coarsened":[156],"graphs":[157],"yields":[158],"comparable":[159],"performance":[160,169],"graphs,":[163],"can":[165,181],"even":[166],"superior":[168],"LLM-based":[171],"reasoning":[173],"owing":[174],"compact":[176],"The":[179],"code":[180],"be":[182],"available":[183],"at":[184],"https://github.com/dazonglian/NOPE-main.":[185]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-15T00:00:00"}