On the public citation graph

The optimal error exponent for Markov order estimation

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpa.3160280206openalex-snapshot
Asymptotic evaluation of certain markov process expectations for large time, II
inferredcites →https://doi.org/10.1017/s0021900200048294openalex-snapshot
Determination of the order of a Markov chain by Akaike's information criterion
inferredcites →https://doi.org/10.1109/18.108249openalex-snapshot
Estimating the number of states of a finite-state source
inferredcites →https://doi.org/10.1109/18.256497openalex-snapshot
Strongly consistent code-based identification and order estimation for constrained finite-state model classes
inferredcites →https://doi.org/10.1109/18.32134openalex-snapshot
Asymptotically optimal classification for multiple tests with empirically observed statistics
inferredcites →https://doi.org/10.1109/18.335958openalex-snapshot
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
inferredcites →https://doi.org/10.1109/18.42210openalex-snapshot
On the estimation of the order of a Markov chain and universal data compression
inferredcites →https://doi.org/10.1109/18.53762openalex-snapshot
A large deviations approach to error exponents in source coding and hypothesis testing
inferredcites →https://doi.org/10.1109/tit.1981.1056355openalex-snapshot
Efficient universal noiseless source codes
inferredcites →https://doi.org/10.1109/tit.1981.1056377openalex-snapshot
The error exponent for the noiseless encoding of finite ergodic Markov sources
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
inferredcites →https://doi.org/10.1112/blms/26.5.508openalex-snapshot
LARGE DEVIATIONS TECHNIQUES AND APPLICATIONS
inferredcites →https://doi.org/10.1214/aoms/1177705136openalex-snapshot
Statistical Methods in Markov Chains
inferredcites →https://doi.org/10.2307/2346299openalex-snapshot
Statistical Inference Regarding Markov Chain Models

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-32253-7_1openalex-snapshot
Statistical Methods Based on Universal Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_29openalex-snapshot
Consistency of Feature Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-7643-8786-0_12openalex-snapshot
Exponential Inequalities for Empirical Unbounded Context Trees
inferred← citeshttps://doi.org/10.1007/s00574-006-0027-9openalex-snapshot
Convergence rates for Markov chain order estimates using EDC criterion
inferred← citeshttps://doi.org/10.1016/j.jspi.2005.01.012openalex-snapshot
Exponential bounds for the probability of wrong determination of the order of a Markov chain by using the EDC criterion
inferred← citeshttps://doi.org/10.1016/j.spa.2011.05.001openalex-snapshot
Neighborhood radius estimation for variable-neighborhood random fields
inferred← citeshttps://doi.org/10.1016/j.spa.2011.06.012openalex-snapshot
Context tree selection: A unifying view
inferred← citeshttps://doi.org/10.1109/18.335958openalex-snapshot
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
inferred← citeshttps://doi.org/10.1109/18.720546openalex-snapshot
The method of types [information theory]
inferred← citeshttps://doi.org/10.1109/allerton.2010.5706977openalex-snapshot
Scaling laws for learning high-dimensional Markov forest distributions
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184870openalex-snapshot
New methods for the statistical analysis of Hidden Markov Models
inferred← citeshttps://doi.org/10.1109/isit.2000.866401openalex-snapshot
Asymptotics of the Bayesian estimator of hidden Markov models
inferred← citeshttps://doi.org/10.1109/isit.2001.935879openalex-snapshot
A competitive Neyman-Pearson approach to universal hypothesis testing with applications
inferred← citeshttps://doi.org/10.1109/isit.2010.5513580openalex-snapshot
Divergence of information-criterion based Markov order estimators for infinite memory processes
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360728openalex-snapshot
Source identification and compression of mixture data from finite observations
inferred← citeshttps://doi.org/10.1109/rsp.2006.4openalex-snapshot
A Prototyping Tool for Analysis and Modeling of Video Transmission Traces over IP Networks
inferred← citeshttps://doi.org/10.1109/tit.2002.1003850openalex-snapshot
Order estimation for a special class of hidden Markov sources and binary renewal processes
inferred← citeshttps://doi.org/10.1109/tit.2002.800478openalex-snapshot
A competitive Neyman-Pearson approach to universal hypothesis testing with applications
inferred← citeshttps://doi.org/10.1109/tit.2003.809574openalex-snapshot
Optimal error exponents in hidden markov models order estimation
inferred← citeshttps://doi.org/10.1109/tit.2005.862078openalex-snapshot
Error exponents for AR order testing
inferred← citeshttps://doi.org/10.1109/tit.2007.909092openalex-snapshot
Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory
inferred← citeshttps://doi.org/10.1109/tit.2014.2334594openalex-snapshot
Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes
inferred← citeshttps://doi.org/10.1142/9789812837172_0008openalex-snapshot
APPLICATIONS OF UNIVERSAL SOURCE CODING TO STATISTICAL ANALYSIS OF TIME SERIES
inferred← citeshttps://doi.org/10.1145/1401890.1401964openalex-snapshot
Efficient ticket routing by resolution sequence mining
inferred← citeshttps://doi.org/10.1214/009053606000000344openalex-snapshot
Testing the order of a model
inferred← citeshttps://doi.org/10.1214/09-bjps033openalex-snapshot
Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
inferred← citeshttps://doi.org/10.1214/11-sts371openalex-snapshot
Estimation in Discrete Parameter Models
inferred← citeshttps://doi.org/10.1214/aos/1015957472openalex-snapshot
The consistency of the BIC Markov order estimator
inferred← citeshttps://doi.org/10.23919/ecc.2003.7085054openalex-snapshot
Adaptive encoding and prediction of hidden Markov processes
inferred← citeshttps://doi.org/10.30757/alea.v21-42openalex-snapshot
Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates
inferred← citeshttps://doi.org/10.3150/12-bej468openalex-snapshot
Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
inferred← citeshttps://doi.org/10.3233/jid-2009-13101openalex-snapshot
HIERARCHICAL MORPHOLOGICAL COMPOSITION OF WEB HOSTING SYSTEM
inferred← citeshttps://doi.org/10.3233/jid-2009-13102openalex-snapshot
ANALYSIS, MODELING AND SIMULATION OF NETWORK TRACES FOR VIDEO TRANSMISSION OVER IP NETWORKS
inferred← citeshttps://doi.org/10.48550/arxiv.0804.2050openalex-snapshot
Stochastic chains with memory of variable length
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7607openalex-snapshot
Universal Compression of a Mixture of Parametric Sources with Side Information
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.