Related papers: Countable Partially Exchangeable Mixtures
A sequence of random variables is called \textit{exchangeable} if its joint distribution is invariant under permutations of indices. The original formulation of de Finetti's theorem roughly says that any exchangeable sequence of…
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
In the context of multilevel longitudinal data, where sample units are collected in clusters, an important aspect that should be accounted for is the unobserved heterogeneity between sample units and between clusters. For this aim we…
We give under weak assumptions a complete combinatorial characterization of identifiability for linear mixtures of finite alphabet sources, with unknown mixing weights and unknown source signals, but known alphabet. This is based on a…
A model for the phenomenological description of tick-by-tick share prices in a stock exchange is introduced. It is based on mixtures of compound Poisson processes. Preliminary results based on Monte Carlo simulation show that this model can…
We describe a simple method that can be used to sample the rare fluctuations of discrete-time Markov chains. We focus on the case of Markov chains with well-defined steady-state measures, and derive expressions for the large-deviation rate…
We consider a finite mixture model with varying mixing probabilities. Linear regression models are assumed for observed variables with coefficients depending on the mixture component the observed subject belongs to. A modification of the…
Let us consider a pair signal-observation ((xn,yn),n 0) where the unobserved signal (xn) is a Markov chain and the observed component is such that, given the whole sequence (xn), the random variables (yn) are independent and the conditional…
We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected…
Mixture models provide a flexible representation of heterogeneity in a finite number of latent classes. From the Bayesian point of view, Markov Chain Monte Carlo methods provide a way to draw inferences from these models. In particular,…
We analyze marked poset polytopes and generalize a result due to Hibi and Li, answering whether the marked chain polytope is unimodular equivalent to the marked order polytope. Both polytopes appear naturally in the representation theory of…
Adaptive Markov chains are an important class of Monte Carlo methods for sampling from probability distributions. The time evolution of adaptive algorithms depends on past samples, and thus these algorithms are non-Markovian. Although there…
We investigate the supports of extremal martingale measures with pre-specified marginals in a two-period setting. First, we establish in full generality the equivalence between the extremality of a given measure $Q$ and the denseness in…
Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…
Almost isomorphism is an equivalence relation on countable state Markov shifts which provides a strong version of Borel conjugacy; still, for mixing SPR shifts, entropy is a complete invariant of almost isomorphism. In this paper, we…
In this work we obtain mixing (and in some cases sharp mixing rates) for a reasonable large class of invertible systems preserving an infinite measure. The examples considered here are the invertible analogue of both Markov and non Markov…
We introduce a definition of pressure for almost-additive sequences of continuous functions defined over (non-compact) countable Markov shifts. The variational principle is proved. Under certain assumptions we prove the existence of Gibbs…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
We prove that for certain actions of a discrete countable residually finite amenable group acting on a compact metric space with specification property, periodic measures are dense in the set of invariant measures.