{"id":"https://openalex.org/W4390873446","doi":"https://doi.org/10.1109/tit.2024.3353769","title":"Shared Information for a Markov Chain on a Tree","display_name":"Shared Information for a Markov Chain on a Tree","publication_year":2024,"publication_date":"2024-01-15","ids":{"openalex":"https://openalex.org/W4390873446","doi":"https://doi.org/10.1109/tit.2024.3353769"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2024.3353769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3353769","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5070842739","display_name":"Sagnik Bhattacharya","orcid":"https://orcid.org/0000-0003-4408-6902"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sagnik Bhattacharya","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0003-4408-6902","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102896474","display_name":"Prakash Narayan","orcid":"https://orcid.org/0000-0002-0710-6305"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prakash Narayan","raw_affiliation_strings":["Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-0710-6305","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.2704,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.79456907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"70","issue":"7","first_page":"4655","last_page":"4666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9959999918937683,"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.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7014393210411072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6506476402282715},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4759892225265503},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4626831114292145},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4152781367301941},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.41244441270828247},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.3326668441295624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26728805899620056},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.183656245470047},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1684236228466034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13124540448188782}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7014393210411072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6506476402282715},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4759892225265503},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4626831114292145},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4152781367301941},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.41244441270828247},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3326668441295624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26728805899620056},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.183656245470047},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1684236228466034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13124540448188782}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2024.3353769","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2024.3353769","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1358819756","display_name":null,"funder_award_id":"CCF 2310203","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5998144091","display_name":null,"funder_award_id":"CCF 1910497","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":45,"referenced_works":["https://openalex.org/W638400246","https://openalex.org/W1507653385","https://openalex.org/W1516274429","https://openalex.org/W1570963478","https://openalex.org/W1579548224","https://openalex.org/W1969116803","https://openalex.org/W1976853087","https://openalex.org/W1989151402","https://openalex.org/W1994497608","https://openalex.org/W2014912629","https://openalex.org/W2020577110","https://openalex.org/W2023933519","https://openalex.org/W2084970147","https://openalex.org/W2095439994","https://openalex.org/W2101985079","https://openalex.org/W2114771311","https://openalex.org/W2137784959","https://openalex.org/W2141432745","https://openalex.org/W2152625085","https://openalex.org/W2154832352","https://openalex.org/W2156094048","https://openalex.org/W2157316805","https://openalex.org/W2163166770","https://openalex.org/W2176114858","https://openalex.org/W2405543475","https://openalex.org/W2523917704","https://openalex.org/W2570092323","https://openalex.org/W2883862410","https://openalex.org/W2950148142","https://openalex.org/W2963822511","https://openalex.org/W3104163746","https://openalex.org/W3107093895","https://openalex.org/W4206530644","https://openalex.org/W4236362309","https://openalex.org/W4246219036","https://openalex.org/W4250954493","https://openalex.org/W4289655214","https://openalex.org/W4300166158","https://openalex.org/W4302366875","https://openalex.org/W4386072003","https://openalex.org/W4388323202","https://openalex.org/W6630737652","https://openalex.org/W6632992360","https://openalex.org/W6638427790","https://openalex.org/W6758137010"],"related_works":["https://openalex.org/W2027903142","https://openalex.org/W3166133680","https://openalex.org/W2989366387","https://openalex.org/W2592341669","https://openalex.org/W2794873331","https://openalex.org/W2075517632","https://openalex.org/W2735859191","https://openalex.org/W190459708","https://openalex.org/W2376290921","https://openalex.org/W4252142810"],"abstract_inverted_index":{"Shared":[0],"information":[1],"is":[2,47,73],"a":[3,18,22,25,31,45,51,62,86],"measure":[4],"of":[5,34,38,81],"mutual":[6],"dependence":[7],"among":[8],"multiple":[9],"jointly":[10],"distributed":[11],"random":[12],"variables":[13],"with":[14,24],"finite":[15],"alphabets.":[16],"For":[17],"Markov":[19,42,53],"chain":[20,43],"on":[21,44,56],"tree":[23,46],"given":[26],"joint":[27,71],"distribution,":[28],"we":[29,76],"give":[30],"new":[32],"proof":[33],"an":[35],"explicit":[36],"characterization":[37,83],"shared":[39,92],"information.":[40],"The":[41],"shown":[48],"to":[49,84],"possess":[50],"global":[52],"property":[54,60],"based":[55],"graph":[57],"separation;":[58],"this":[59,82],"plays":[61],"key":[63],"role":[64],"in":[65],"our":[66],"proofs.":[67],"When":[68],"the":[69,78],"underlying":[70],"distribution":[72],"not":[74],"known,":[75],"exploit":[77],"special":[79],"form":[80],"provide":[85],"multiarmed":[87],"bandit":[88],"algorithm":[89],"for":[90],"estimating":[91],"information,":[93],"and":[94],"analyze":[95],"its":[96],"error":[97],"performance.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}