{"id":"https://openalex.org/W3048596362","doi":"https://doi.org/10.1109/infocomwkshps50562.2020.9163034","title":"Detecting State Transitions of a Markov Source: Sampling Frequency and Age Trade-off","display_name":"Detecting State Transitions of a Markov Source: Sampling Frequency and Age Trade-off","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3048596362","doi":"https://doi.org/10.1109/infocomwkshps50562.2020.9163034","mag":"3048596362"},"language":"en","primary_location":{"id":"doi:10.1109/infocomwkshps50562.2020.9163034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocomwkshps50562.2020.9163034","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","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/A5025956807","display_name":"Jaya Prakash Champati","orcid":"https://orcid.org/0000-0002-5127-8497"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Jaya Prakash Champati","raw_affiliation_strings":["Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041348422","display_name":"Mikael Skoglund","orcid":"https://orcid.org/0000-0002-7926-5081"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Skoglund","raw_affiliation_strings":["Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037402766","display_name":"James Gross","orcid":"https://orcid.org/0000-0001-6682-6559"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"James Gross","raw_affiliation_strings":["Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Information Science and Engineering, EECS, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025956807"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":0.6167,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71016147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T13553","display_name":"Age of Information Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9611999988555908,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10300","display_name":"Congenital Heart Disease Studies","score":0.934499979019165,"subfield":{"id":"https://openalex.org/subfields/2713","display_name":"Epidemiology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7776687741279602},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.7011072635650635},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6671254634857178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6128137111663818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6105450987815857},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5941562652587891},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5413453578948975},{"id":"https://openalex.org/keywords/importance-sampling","display_name":"Importance sampling","score":0.4238196611404419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3150714933872223},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.26850366592407227},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13433751463890076}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7776687741279602},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.7011072635650635},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6671254634857178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6128137111663818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6105450987815857},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5941562652587891},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5413453578948975},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.4238196611404419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3150714933872223},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.26850366592407227},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13433751463890076},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocomwkshps50562.2020.9163034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocomwkshps50562.2020.9163034","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W755194005","https://openalex.org/W1518931405","https://openalex.org/W1964535365","https://openalex.org/W2028329278","https://openalex.org/W2038378248","https://openalex.org/W2055932357","https://openalex.org/W2129617286","https://openalex.org/W2146487252","https://openalex.org/W2808614360","https://openalex.org/W2867820427","https://openalex.org/W2911388033","https://openalex.org/W2963674785","https://openalex.org/W2975733875"],"related_works":["https://openalex.org/W1660242800","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W2130475377"],"abstract_inverted_index":{"We":[0,41,71,105],"consider":[1],"a":[2,22,59,158],"finite-state":[3],"Discrete-Time":[4],"Markov":[5,102,114,130],"Chain":[6],"(DTMC)":[7],"source":[8],"that":[9,116,127,149],"can":[10],"be":[11],"sampled":[12],"for":[13,44,54,68],"detecting":[14,38],"the":[15,18,30,39,45,56,128],"events":[16],"when":[17],"DTMC":[19],"transits":[20],"to":[21,28,81,93,145],"new":[23],"state.":[24],"Our":[25,123],"goal":[26],"is":[27,61,162],"study":[29,72],"trade-off":[31],"between":[32],"sampling":[33,84,90,137,142,155],"frequency":[34,85,91],"and":[35,63,87,112],"staleness":[36,57],"in":[37],"events.":[40],"argue":[42],"that,":[43],"problem":[46],"at":[47],"hand,":[48],"using":[49,108],"Age":[50],"of":[51,58,150],"Information":[52],"(AoI)":[53],"quantifying":[55],"sample":[60],"conservative":[62],"therefore,":[64],"introduce":[65],"age":[66,78,96,160],"penalty":[67,79,97,161],"this":[69],"purpose.":[70],"two":[73],"optimization":[74],"problems:":[75],"minimize":[76,88],"average":[77,83,89,95],"subject":[80,92],"an":[82,94,151],"constraint,":[86],"constraint;":[98],"both":[99],"are":[100,117],"Constrained":[101],"Decision":[103],"Problems.":[104],"solve":[106],"them":[107],"linear":[109],"programming":[110],"approach":[111],"compute":[113],"policies":[115,131],"optimal":[118,135,152],"among":[119],"all":[120],"causal":[121],"policies.":[122],"numerical":[124],"results":[125],"demonstrate":[126],"computed":[129],"not":[132],"only":[133],"outperform":[134],"periodic":[136],"policies,":[138],"but":[139],"also":[140],"achieve":[141],"frequencies":[143],"close":[144],"or":[146],"lower":[147],"than":[148],"clairvoyant":[153],"(non-causal)":[154],"policy,":[156],"if":[157],"small":[159],"allowed.":[163]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}