English
Related papers

Related papers: Asymptotics for Markov chain mixture detection

200 papers

Flexible random scale-mixture models provide a framework for capturing a broad range of extremal dependence structures. However, likelihood-based inference under the peaks-over-threshold setting is often computationally infeasible, due to…

Methodology · Statistics 2026-04-10 Muyang Shi , Likun Zhang , Benjamin A. Shaby

Arguing about the equilibrium distribution of continuous-time Markov chains can be vital for showing properties about the underlying systems. For example in biological systems, bistability of a chemical reaction network can hint at its…

Probability · Mathematics 2010-07-20 Tugrul Dayar , Holger Hermanns , David Spieler , Verena Wolf

Sampling from the conditional (or posterior) probability distribution of the latent states of a Hidden Markov Model, given the realization of the observed process, is a non-trivial problem in the context of Markov Chain Monte Carlo. To do…

Statistics Theory · Mathematics 2015-09-29 Sumeetpal S. Singh , Fredrik Lindsten , Eric Moulines

The paper studies large sample asymptotic properties of the Maximum Likelihood Estimator (MLE) for the parameter of a continuous time Markov chain, observed in white noise. Using the method of weak convergence of likelihoods due to…

Probability · Mathematics 2009-06-18 Pavel Chigansky

We prove that if ${(P_x)}_{x\in \mathscr X}$ is a family of probability measures which satisfy the log-Sobolev inequality and whose pairwise chi-squared divergences are uniformly bounded, and $\mu$ is any mixing distribution on $\mathscr…

Probability · Mathematics 2021-03-08 Hong-Bin Chen , Sinho Chewi , Jonathan Niles-Weed

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Data Structures and Algorithms · Computer Science 2021-11-08 Nima Anari , Vishesh Jain , Frederic Koehler , Huy Tuan Pham , Thuy-Duong Vuong

In this article, we introduce mixture representations for likelihood ratio ordered distributions. Essentially, the ratio of two probability densities, or mass functions, is monotone if and only if one can be expressed as a mixture of…

Methodology · Statistics 2023-10-30 Michael Jauch , Andrés F. Barrientos , Víctor Peña , David S. Matteson

We investigate the sharpness of the spectral profile bound presented by Goel et al. and Chen et al. on the $L^{2}$ mixing time of Markov chains on continuous state spaces. We show that the bound provided by Chen et al. is sharp up to a…

Probability · Mathematics 2024-09-18 Elnaz Karimian Sichani , Aaron Smith

We consider whether the asymptotic distributions for the log-likelihood ratio test statistic are expected to be Gaussian or chi-squared. Two straightforward examples provide insight on the difference.

Data Analysis, Statistics and Probability · Physics 2017-12-13 Louis Lyons

This paper introduces constrained mixtures for continuous distributions, characterized by a mixture of distributions where each distribution has a shape similar to the base distribution and disjoint domains. This new concept is used to…

Machine Learning · Statistics 2015-03-29 Conrado S. Miranda , Fernando J. Von Zuben

We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $\beta_m$ (if the sampled parts are…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Ofer Zeitouni , Martin P. W. Zerner

We address the problem of estimating the mixing time of a Markov chain from a single trajectory of observations. Unlike most previous works which employed Hilbert space methods to estimate spectral gaps, we opt for an approach based on…

Probability · Mathematics 2023-09-13 Geoffrey Wolfer

When we use the normal mixture model, the optimal number of the components describing the data should be determined. Testing homogeneity is good for this purpose; however, to construct its theory is challenging, since the test statistic…

Statistics Theory · Mathematics 2019-12-24 Natsuki Kariya , Sumio Watanabe

We investigate absorption, i.e., almost sure convergence to an absorbing state, in time-varying (non-homogeneous) discrete-time Markov chains with finite state space. We consider systems that can switch among a finite set of transition…

Systems and Control · Electrical Eng. & Systems 2020-08-18 Yasin Yazicioglu

We study a likelihood ratio test for the location of the mode of a log-concave density. Our test is based on comparison of the log-likelihoods corresponding to the unconstrained maximum likelihood estimator of a log-concave density and the…

Statistics Theory · Mathematics 2018-06-05 Charles R. Doss , Jon A. Wellner

Testing the equality of the covariance matrices of two high-dimensional samples is a fundamental inference problem in statistics. Several tests have been proposed but they are either too liberal or too conservative when the required…

Statistics Theory · Mathematics 2023-01-04 Jin-Ting Zhang , Jingyi Wang , Tianming Zhu

We characterize absorption-time distributions for birth-death Markov chains with an absorbing boundary. For "extinction-prone" chains (which drift on average toward the absorbing state) the asymptotic distribution is Gaussian, Gumbel, or…

Statistical Mechanics · Physics 2022-06-08 David Hathcock , Steven H. Strogatz

With any symmetric distribution $\mu$ on the real line we may associate a parametric family of noncentral distributions as the distributions of $(X+\delta)^2$, $\delta\not=0$, where $X$ is a random variable with distribution $\mu$. The…

Probability · Mathematics 2022-06-22 Ludwig Baringhaus , Rudolf Grübel

Let $\{W_t\}_{t=1}^{\infty}$ be a finite state stationary Markov chain, and suppose that $f$ is a real-valued function on the state space. If $f$ is bounded, then Gillman's expander Chernoff bound (1993) provides concentration estimates for…

Probability · Mathematics 2019-06-19 Assaf Naor , Shravas Rao , Oded Regev

We present new concentration of measure inequalities for Markov chains, generalising results for chains that are contracting in Wasserstein distance. These are particularly suited to establishing the cut-off phenomenon for suitable chains.…

Probability · Mathematics 2022-05-24 Andrew Barbour , Graham Brightwell , Malwina Luczak