The SMC′ is a highly accurate approximation to the ancestral recombination graph
Two sequentially Markov coalescent models (SMC and SMC′) are available as tractable
approximations to the ancestral recombination graph (ARG). We present a Markov process …
approximations to the ancestral recombination graph (ARG). We present a Markov process …
Thermodynamic formalism in neuronal dynamics and spike train statistics
The Thermodynamic Formalism provides a rigorous mathematical framework for studying
quantitative and qualitative aspects of dynamical systems. At its core, there is a variational …
quantitative and qualitative aspects of dynamical systems. At its core, there is a variational …
The Wasserstein distance of order 1 for quantum spin systems on infinite lattices
G De Palma, D Trevisan - Annales Henri Poincaré, 2023 - Springer
We propose a generalization of the Wasserstein distance of order 1 to quantum spin
systems on the lattice Z d, which we call specific quantum W 1 distance. The proposal is …
systems on the lattice Z d, which we call specific quantum W 1 distance. The proposal is …
Identifying the coupling structure in complex systems through the optimal causation entropy principle
Inferring the coupling structure of complex systems from time series data in general by
means of statistical and information-theoretic techniques is a challenging problem in applied …
means of statistical and information-theoretic techniques is a challenging problem in applied …
[HTML][HTML] Context tree selection: A unifying view
A Garivier, F Leonardi - Stochastic processes and their applications, 2011 - Elsevier
Context tree models have been introduced by Rissanen in [25] as a parsimonious
generalization of Markov models. Since then, they have been widely used in applied …
generalization of Markov models. Since then, they have been widely used in applied …
Stochastic chains with memory of variable length
A Galves, E Löcherbach - arXiv preprint arXiv:0804.2050, 2008 - arxiv.org
Stochastic chains with memory of variable length constitute an interesting family of
stochastic chains of infinite order on a finite alphabet. The idea is that for each past, only a …
stochastic chains of infinite order on a finite alphabet. The idea is that for each past, only a …
Probabilistic prediction and context tree identification in the goalkeeper game
In this article we address two related issues on the learning of probabilistic sequences of
events. First, which features make the sequence of events generated by a stochastic chain …
events. First, which features make the sequence of events generated by a stochastic chain …
Markov approximation and consistent estimation of unbounded probabilistic suffix trees
We consider infinite order chains whose transition probabilities depend on a finite suffix of
the past. These suffixes are of variable length and the set of the lengths of all suffix is …
the past. These suffixes are of variable length and the set of the lengths of all suffix is …
Coupling and perturbation techniques for categorical time series
L Truquet - 2020 - projecteuclid.org
Coupling and perturbation techniques for categorical time series Page 1 Bernoulli 26(4), 2020,
3249–3279 https://doi.org/10.3150/20-BEJ1225 Coupling and perturbation techniques for …
3249–3279 https://doi.org/10.3150/20-BEJ1225 Coupling and perturbation techniques for …
Exponential inequalities for empirical unbounded context trees
A Galves, F Leonardi - In and out of equilibrium 2, 2008 - Springer
In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of
a version of the algorithm Context, when the underlying tree is not necessarily bounded. The …
a version of the algorithm Context, when the underlying tree is not necessarily bounded. The …