{"id":"https://openalex.org/W2962991128","doi":"https://doi.org/10.1109/isit.2018.8437567","title":"Typicality Matching for Pairs of Correlated Graphs","display_name":"Typicality Matching for Pairs of Correlated Graphs","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2962991128","doi":"https://doi.org/10.1109/isit.2018.8437567","mag":"2962991128"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5008196853","display_name":"Farhad Shirani","orcid":"https://orcid.org/0000-0003-1316-3899"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Farhad Shirani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New York University New York, New York"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New York University New York, New York","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010950688","display_name":"Siddharth Garg","orcid":"https://orcid.org/0000-0002-6158-9512"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddharth Garg","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New York University New York, New York"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New York University New York, New York","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084526367","display_name":"Elza Erkip","orcid":"https://orcid.org/0000-0001-8718-8648"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elza Erkip","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New York University New York, New York"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New York University New York, New York","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008196853"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79758556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"15","issue":null,"first_page":"221","last_page":"225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9973999857902527,"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.9973999857902527,"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.9961000084877014,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9939000010490417,"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/matching","display_name":"Matching (statistics)","score":0.7005856037139893},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.552398681640625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5165797472000122},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.511905312538147},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5057318210601807},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48044511675834656},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4363166391849518},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4290933907032013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42008328437805176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39005374908447266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3850128650665283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2949492335319519},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25695961713790894},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0731235146522522}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7005856037139893},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.552398681640625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5165797472000122},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.511905312538147},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5057318210601807},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48044511675834656},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4363166391849518},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4290933907032013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42008328437805176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39005374908447266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3850128650665283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2949492335319519},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25695961713790894},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0731235146522522}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.6499999761581421,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W1549664537","https://openalex.org/W1581425276","https://openalex.org/W1865107109","https://openalex.org/W1996536854","https://openalex.org/W2013863451","https://openalex.org/W2051748083","https://openalex.org/W2052728310","https://openalex.org/W2068789164","https://openalex.org/W2103012681","https://openalex.org/W2129406249","https://openalex.org/W2131258513","https://openalex.org/W2135678015","https://openalex.org/W2139789442","https://openalex.org/W2245073910","https://openalex.org/W2252481082","https://openalex.org/W2271033212","https://openalex.org/W2345151282","https://openalex.org/W2573337754","https://openalex.org/W2594456393","https://openalex.org/W2769874548","https://openalex.org/W2905110430","https://openalex.org/W2953110595","https://openalex.org/W2962991128","https://openalex.org/W2963003280","https://openalex.org/W2963551335","https://openalex.org/W3143219376","https://openalex.org/W4233413206","https://openalex.org/W4251358674","https://openalex.org/W4299499864","https://openalex.org/W4299605355","https://openalex.org/W6679993304","https://openalex.org/W6691243976","https://openalex.org/W6793127252"],"related_works":["https://openalex.org/W4213150077","https://openalex.org/W2369410163","https://openalex.org/W2059018062","https://openalex.org/W2604585036","https://openalex.org/W2078477160","https://openalex.org/W1989103179","https://openalex.org/W1991172810","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W4388347373"],"abstract_inverted_index":{"In":[0],"this":[1,22],"paper,":[2],"the":[3,71,75,79,88,93,97,101,105,115],"problem":[4],"of":[5,8,21,28,36,45,74,78,104,117,119,121,127],"matching":[6,19,50,57],"pairs":[7],"correlated":[9,81],"random":[10,122],"graphs":[11],"with":[12],"multi-valued":[13],"edge":[14,102],"attributes":[15],"is":[16,51,110],"considered.":[17],"Graph":[18],"problems":[20],"nature":[23],"arise":[24],"in":[25],"several":[26],"settings":[27],"practical":[29],"interest":[30],"including":[31],"social":[32],"network":[33],"de-anonymization,":[34],"study":[35],"biological":[37],"data,":[38],"and":[39],"web":[40],"graphs.":[41,82,107],"An":[42],"achievable":[43,89],"region":[44,90],"graph":[46],"parameters":[47],"for":[48],"successful":[49],"derived":[52],"by":[53,69],"analyzing":[54],"a":[55],"new":[56],"algorithm":[58,67],"that":[59,87,124],"we":[60],"refer":[61],"to":[62,100],"as":[63],"typicality":[64,73,116],"matching.":[65],"The":[66,108],"operates":[68],"investigating":[70],"joint":[72],"adjacency":[76],"matrices":[77],"two":[80,106],"Our":[83],"main":[84],"result":[85,109],"shows":[86],"depends":[91],"on":[92,112,114],"mutual":[94],"information":[95],"between":[96],"variables":[98,123],"corresponding":[99],"probabilities":[103],"based":[111],"bounds":[113],"permutations":[118],"sequences":[120],"might":[125],"be":[126],"independent":[128],"interest.":[129]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}