{"id":"https://openalex.org/W3196785762","doi":"https://doi.org/10.1109/isit45174.2021.9517897","title":"A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs","display_name":"A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3196785762","doi":"https://doi.org/10.1109/isit45174.2021.9517897","mag":"3196785762"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5077115606","display_name":"Payam Delgosha","orcid":"https://orcid.org/0000-0003-0266-9237"},"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":"Payam Delgosha","raw_affiliation_strings":["University of Illinois,CS Department,Urbana-Champaign, Urbana,IL,61801"],"affiliations":[{"raw_affiliation_string":"University of Illinois,CS Department,Urbana-Champaign, Urbana,IL,61801","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013689450","display_name":"Venkat Anantharam","orcid":"https://orcid.org/0000-0002-6214-7927"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkat Anantharam","raw_affiliation_strings":["University of California, Berkeley,EECS Department,Berkeley,CA,94720"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley,EECS Department,Berkeley,CA,94720","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077115606"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.2907,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55996564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2792","last_page":"2797"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9977999925613403,"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.9977999925613403,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9970999956130981,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962000250816345,"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/lossless-compression","display_name":"Lossless compression","score":0.7965930104255676},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.7245696783065796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6394007802009583},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5528202652931213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5164709091186523},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.47349104285240173},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.45411327481269836},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.45344266295433044},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3904549777507782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36836355924606323},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29947519302368164},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1674603819847107},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.11844280362129211}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.7965930104255676},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.7245696783065796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6394007802009583},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5528202652931213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5164709091186523},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.47349104285240173},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.45411327481269836},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.45344266295433044},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3904549777507782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36836355924606323},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29947519302368164},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1674603819847107},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11844280362129211},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9517897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8006853621","display_name":null,"funder_award_id":"CNS-1527846,CCF-1618145,CCF-1901004,CIF-2007965,CCF-0939370","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"},{"id":"https://openalex.org/F4320307873","display_name":"William and Flora Hewlett Foundation","ror":"https://ror.org/04hd1y677"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W273178449","https://openalex.org/W327409173","https://openalex.org/W568673721","https://openalex.org/W1872905819","https://openalex.org/W1959142945","https://openalex.org/W1994727615","https://openalex.org/W2005437133","https://openalex.org/W2057754290","https://openalex.org/W2082773934","https://openalex.org/W2107391404","https://openalex.org/W2110596924","https://openalex.org/W2128242038","https://openalex.org/W2131348552","https://openalex.org/W2132565565","https://openalex.org/W2165114349","https://openalex.org/W2170661743","https://openalex.org/W2589006582","https://openalex.org/W2744813654","https://openalex.org/W2963294092","https://openalex.org/W2964326681","https://openalex.org/W2975464350","https://openalex.org/W3022315036","https://openalex.org/W3033055443","https://openalex.org/W3080175874","https://openalex.org/W3098141631","https://openalex.org/W3101333414","https://openalex.org/W3105212187","https://openalex.org/W3105785125","https://openalex.org/W3193902159","https://openalex.org/W4245577611","https://openalex.org/W4297750574","https://openalex.org/W6641261531","https://openalex.org/W6681283835","https://openalex.org/W6778956866"],"related_works":["https://openalex.org/W2091883426","https://openalex.org/W2174948646","https://openalex.org/W3173235360","https://openalex.org/W2024017047","https://openalex.org/W4318256793","https://openalex.org/W2594370889","https://openalex.org/W2390720471","https://openalex.org/W2051410394","https://openalex.org/W1600789676","https://openalex.org/W2134327945"],"abstract_inverted_index":{"Graphical":[0],"data":[1,26,44],"arises":[2],"naturally":[3],"in":[4,53,69,80],"several":[5],"modern":[6],"applications,":[7,41],"including":[8],"but":[9,91],"not":[10],"limited":[11],"to":[12,93,124],"internet":[13],"graphs,":[14],"social":[15],"networks,":[16],"genomics":[17],"and":[18,104,140],"proteomics.":[19],"The":[20],"typically":[21],"large":[22],"size":[23],"of":[24,31,51,66,74,84],"graphical":[25,43],"argues":[27],"for":[28,36,137,145],"the":[29,42,49,54,64,72,82,100,105,132,141],"importance":[30],"designing":[32],"universal":[33,116],"compression":[34,118],"methods":[35],"such":[37],"data.":[38],"In":[39,110],"most":[40],"is":[45,86,121],"sparse,":[46],"meaning":[47],"that":[48],"number":[50,65,73,83],"edges":[52,75,85],"graph":[55],"scales":[56,76],"more":[57],"slowly":[58],"than":[59,89],"<tex>$n^{2}$</tex>,":[60],"where":[61],"<tex>$n$</tex>":[62],"denotes":[63],"vertices.":[67],"Although":[68],"some":[70],"applications":[71],"linearly":[77],"with":[78,96],"<tex>$n$</tex>,":[79],"others":[81],"much":[87],"smaller":[88],"<tex>$n^{2}$</tex>":[90],"appears":[92],"scale":[94],"superlinearly":[95],"<tex>$n$</tex>.":[97],"We":[98,127],"call":[99],"former":[101],"sparse":[102,108,138,142,147],"graphs":[103,139],"latter":[106],"heavy-tailed":[107,146],"graphs.":[109,148],"this":[111,129],"paper":[112],"we":[113],"introduce":[114],"a":[115],"lossless":[117],"method":[119],"which":[120],"simultaneously":[122],"applicable":[123],"both":[125],"classes.":[126],"do":[128],"by":[130],"employing":[131],"local":[133],"weak":[134],"convergence":[135],"framework":[136,144],"graphon":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}