{"id":"https://openalex.org/W4415368756","doi":"https://doi.org/10.1109/isit63088.2025.11195705","title":"Exact Random Graph Matching with Multiple Graphs","display_name":"Exact Random Graph Matching with Multiple Graphs","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368756","doi":"https://doi.org/10.1109/isit63088.2025.11195705"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5114166983","display_name":"Taha Ameen","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Taha Ameen","raw_affiliation_strings":["University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801"],"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047760182","display_name":"Bruce Hajek","orcid":"https://orcid.org/0000-0002-8520-0196"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce Hajek","raw_affiliation_strings":["University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801"],"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114166983"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":2.4362,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90978154,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9939000010490417,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9939000010490417,"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/T11106","display_name":"Data Management and Algorithms","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9760000109672546,"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.641700029373169},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6000999808311462},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5767999887466431},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5626000165939331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40610000491142273},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.3901999890804291},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.3785000145435333},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.36959999799728394}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.641700029373169},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6000999808311462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5791000127792358},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5767999887466431},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5626000165939331},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4404999911785126},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4339999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4259999990463257},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3901999890804291},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.3785000145435333},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.36959999799728394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36719998717308044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35269999504089355},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.31369999051094055},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2786000072956085},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.27619999647140503},{"id":"https://openalex.org/C114928208","wikidata":"https://www.wikidata.org/wiki/Q17104952","display_name":"Pairwise independence","level":5,"score":0.26100000739097595},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26010000705718994},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2116174208","display_name":null,"funder_award_id":"CCF 1900636","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1507964143","https://openalex.org/W2044490483","https://openalex.org/W2056124433","https://openalex.org/W2112609142","https://openalex.org/W2135930857","https://openalex.org/W2151875636","https://openalex.org/W2159675343","https://openalex.org/W2419507445","https://openalex.org/W2564310132","https://openalex.org/W3040496082","https://openalex.org/W3088419579","https://openalex.org/W3127515714","https://openalex.org/W4214938169","https://openalex.org/W4241692187","https://openalex.org/W4243619412","https://openalex.org/W4251358674","https://openalex.org/W4282555249","https://openalex.org/W4313595333","https://openalex.org/W4376639522","https://openalex.org/W4386075190","https://openalex.org/W4387828526","https://openalex.org/W4415368756"],"related_works":[],"abstract_inverted_index":{"This":[0],"work":[1,75],"studies":[2],"fundamental":[3],"limits":[4],"for":[5,20,35],"recovering":[6],"the":[7,37,53,56,62,68,78,107,110,117,127],"underlying":[8],"correspondence":[9],"among":[10,105],"multiple":[11],"correlated":[12],"random":[13],"graphs.":[14,108,121],"We":[15],"identify":[16],"a":[17,85],"necessary":[18],"condition":[19,39],"any":[21],"algorithm":[22,45,58],"to":[23,49,77],"correctly":[24],"match":[25,51],"all":[26,29,52,106],"nodes":[27],"across":[28],"graphs,":[30,54],"and":[31,65],"propose":[32],"two":[33,91,100],"algorithms":[34,74],"which":[36],"same":[38],"is":[40,94],"also":[41],"sufficient.":[42],"The":[43],"first":[44,59],"employs":[46],"global":[47],"information":[48,79],"simultaneously":[50],"whereas":[55],"second":[57],"partially":[60],"matches":[61],"graphs":[63,92,101],"pairwise":[64],"then":[66],"combines":[67],"partial":[69],"matchings":[70],"by":[71],"transitivity.":[72],"Both":[73],"down":[76],"theoretic":[80],"threshold.":[81],"Our":[82],"analysis":[83],"reveals":[84],"scenario":[86],"where":[87],"exact":[88,103],"matching":[89,104],"between":[90],"alone":[93],"impossible,":[95],"but":[96],"leveraging":[97],"more":[98],"than":[99],"allows":[102],"Along":[109],"way,":[111],"we":[112],"derive":[113],"independent":[114],"results":[115],"about":[116],"k-core":[118],"of":[119],"Erd\u0151s-R\u00e9nyi":[120],"Deferred":[122],"proofs":[123],"are":[124],"available":[125],"in":[126],"preprint,":[128],"arXiv":[129],"2405.12293":[130],"[1].":[131]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}