Cited in
(66)- Variable length Markov chains
- Convergence to equilibrium for time-inhomogeneous jump diffusions with state-dependent jump intensity
- Using a VOM model for reconstructing potential coding regions in EST sequences
- Chains of infinite order, chains with memory of variable length, and maps of the interval
- Variable length local decoding and alignment-free sequence comparison
- Multiple partition Markov model for B.1.1.7, B.1.351, B.1.617.2, and P.1 variants of SARS-CoV 2 virus
- Efficient and adaptive post-model-selection estimators
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- Phase transition for infinite systems of spiking neurons
- Bayesian analysis of variable-order, reversible Markov chains
- Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons
- Context tree classification and clustering
- Rule generation for categorical time series with Markov assumptions
- Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition
- Perfect simulation of processes with long memory: a ``coupling into and from the past algorithm
- scientific article; zbMATH DE number 7578278 (Why is no real title available?)
- A note on distinguishing random trees populations
- Relevant states and memory in Markov chain bootstrapping and simulation
- Sequential prediction under log-loss with side information
- Loss-guided stability selection
- Context-specific and local independence in Markovian dependence structures
- Exponential inequalities for VLMC empirical trees
- Probability and algorithmics: a focus on some recent developments
- Lossless compression of map contours by context tree modeling of chain codes
- Context trees, variable length Markov chains and dynamical sources
- Online portfolio selection: a survey
- Distributions of pattern statistics in sparse Markov models
- Persistent random walks. I. Recurrence versus transience
- Robust model selection for stochastic processes
- Uncommon suffix tries
- Context tree selection: a unifying view
- Context tree selection and linguistic rhythm retrieval from written texts
- Posterior representations for Bayesian context trees: sampling, estimation and convergence
- Computation of exact probabilities associated with overlapping pattern occurrences
- Four billion years: the story of an ancient protein family
- A copula-based partition Markov procedure
- Sparse Markov chains for sequence data
- On the Mathematical Consequences of Binning Spike Trains
- Stochastically perturbed chains of variable memory
- Divergent perpetuities modulated by regime switches
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- Approximate learning of parsimonious Bayesian context trees
- Local theorems for (multidimensional) additive functionals of semi-Markov chains
- Bootstraps for time series
- Joint estimation of intersecting context tree models
- The power of amnesia: Learning probabilistic automata with variable memory length
- Coupling and perturbation techniques for categorical time series
- Stratified graphical models -- context-specific independence in graphical models
- Nonparametric statistical inference for the context tree of a stationary ergodic process
- Clustering functional data sets by law
- Detecting renewal states in chains of variable length via intrinsic Bayes factors
- Entropic repulsion and lack of the \(g\)-measure property for Dyson models
- Almost Gibbsianness and parsimonious description of the decimated 2d-Ising model
- Partially observed Markov random fields are variable neighborhood random fields
- Variable length memory chains: characterization of stationary probability measures
- Neighborhood radius estimation for variable-neighborhood random fields
- Variable length Markov chain with exogenous covariates
- On-line maximum likelihood prediction with respect to general loss functions
- Entropy estimation of symbol sequences
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
- Recursive learning for sparse Markov models
- Algorithms for learning parsimonious context trees
- Testing statistical hypothesis on random trees and applications to the protein classification problem
- From data to stochastic models
- Non-regular g-measures and variable length memory chains
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
This page was built for publication: A universal data compression system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671882)
