{"id":"https://openalex.org/W7148491612","doi":"https://doi.org/10.1109/hipcw66559.2025.00095","title":"Linear Order Graph Sparsification for MCMC and Mean-Field Annealing","display_name":"Linear Order Graph Sparsification for MCMC and Mean-Field Annealing","publication_year":2025,"publication_date":"2025-12-17","ids":{"openalex":"https://openalex.org/W7148491612","doi":"https://doi.org/10.1109/hipcw66559.2025.00095"},"language":null,"primary_location":{"id":"doi:10.1109/hipcw66559.2025.00095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipcw66559.2025.00095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 32nd International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132784867","display_name":"Debraj Banerjee","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110745","display_name":"Interaction Institute for Social Change","ror":"https://ror.org/01qyb4t36","country_code":"US","type":"other","lineage":["https://openalex.org/I4210110745"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debraj Banerjee","raw_affiliation_strings":["IISc,Department of Electrical Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IISc,Department of Electrical Engineering","institution_ids":["https://openalex.org/I4210110745"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132735151","display_name":"Santanu Mahapatra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110745","display_name":"Interaction Institute for Social Change","ror":"https://ror.org/01qyb4t36","country_code":"US","type":"other","lineage":["https://openalex.org/I4210110745"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santanu Mahapatra","raw_affiliation_strings":["IISc,Department of Electronic Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IISc,Department of Electronic Systems Engineering","institution_ids":["https://openalex.org/I4210110745"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045035201","display_name":"Kunal N. Chaudhury","orcid":"https://orcid.org/0000-0002-8136-605X"},"institutions":[{"id":"https://openalex.org/I4210110745","display_name":"Interaction Institute for Social Change","ror":"https://ror.org/01qyb4t36","country_code":"US","type":"other","lineage":["https://openalex.org/I4210110745"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal N. Chaudhury","raw_affiliation_strings":["IISc,Department of Electrical Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IISc,Department of Electrical Engineering","institution_ids":["https://openalex.org/I4210110745"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210110745"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.83138643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"281","last_page":"282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.21860000491142273,"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.21860000491142273,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.1800999939441681,"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/T12303","display_name":"Tensor decomposition and applications","score":0.15839999914169312,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4871000051498413},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.4569999873638153},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.37220001220703125},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.29989999532699585},{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.29670000076293945},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.29429998993873596}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5327000021934509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.4569999873638153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4447000026702881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4440999925136566},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32280001044273376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3025999963283539},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2867000102996826},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hipcw66559.2025.00095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hipcw66559.2025.00095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 32nd International Conference on High Performance Computing, Data and Analytics Workshop (HiPCW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.4430793225765228,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1506342804","https://openalex.org/W2024060531","https://openalex.org/W2068674173","https://openalex.org/W2129575457","https://openalex.org/W3168032916"],"related_works":[],"abstract_inverted_index":{"We":[0],"tackle":[1],"the":[2,75,96],"problem":[3],"of":[4],"running":[5],"Markov":[6],"Chain":[7],"Monte":[8],"Carlo":[9],"(MCMC)":[10],"and":[11,72,106,129,145,151],"Mean-Field":[12],"(MF)":[13],"annealing":[14,76],"on":[15,59,79],"very":[16],"large":[17],"Ising":[18,80,121],"graphs":[19],"by":[20,44],"introducing":[21],"a":[22,60,132,143],"deterministic":[23],"Greedy-Pruning":[24],"graph":[25,139],"sparsification":[26,140],"method.":[27],"The":[28],"goal":[29],"is":[30,103],"to":[31,47,120],"cut":[32],"down":[33],"computation":[34],"while":[35],"keeping":[36],"solution":[37],"quality":[38],"high.":[39],"Our":[40],"algorithm":[41],"does":[42],"this":[43],"pruning":[45],"edges":[46],"create":[48],"sparse":[49,69],"subgraphs":[50],"with":[51,88,95,113,123],"limited":[52],"node":[53],"degree,":[54],"using":[55],"an":[56],"easy-to-compute":[57],"bound":[58],"worst-case":[61],"spectral":[62],"measure.":[63],"A":[64],"GPU":[65],"implementation":[66],"builds":[67],"these":[68],"matrices":[70],"efficiently":[71],"speeds":[73],"up":[74],"updates.":[77],"Tests":[78],"models":[81],"show":[82,137],"big":[83],"drops":[84],"in":[85,92],"per-iteration":[86],"cost":[87],"almost":[89],"no":[90],"loss":[91],"accuracy.":[93],"Compared":[94],"recent":[97],"Copy":[98],"Node":[99],"method,":[100],"our":[101],"approach":[102],"more":[104],"stable":[105],"robust.":[107],"By":[108],"combining":[109],"fast":[110],"sparse-matrix":[111],"generation":[112],"multi-GPU,":[114],"block-based":[115],"matrix-vector":[116],"multiplication,":[117],"we":[118],"scale":[119],"systems":[122],"about":[124],"10<sup":[125],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[126],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">6</sup>":[127],"spins":[128],"nearly":[130],"half":[131],"billion":[133],"couplings.":[134],"These":[135],"results":[136],"that":[138],"can":[141],"be":[142],"practical":[144],"scalable":[146],"tool":[147],"for":[148],"large-scale":[149],"optimization":[150],"statistical":[152],"physics.":[153]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2026-04-03T00:00:00"}