English
Related papers

Related papers: An Extremal Inequality for Long Markov Chains

200 papers

We consider the distributed source coding system of $L$ correlated Gaussian sources $Y_i,i=1,2,...,L$ which are noisy observations of correlated Gaussian remote sources $X_k, k=1,2,...,K$. We assume that $Y^{L}={}^{\rm t}(Y_1,Y_2,$ $...,…

Information Theory · Computer Science 2011-02-21 Yasutada Oohama

Let $S_N$ be the sum of vector-valued functions defined on a finite Markov chain. An analogue of the Bernstein--Hoeffding inequality is derived for the probability of large deviations of $S_N$ and relates the probability to the spectral gap…

Probability · Mathematics 2009-09-29 Vladislav Kargin

A Markov tree is a probabilistic graphical model for a random vector indexed by the nodes of an undirected tree encoding conditional independence relations between variables. One possible limit distribution of partial maxima of samples from…

Methodology · Statistics 2021-01-19 Stefka Asenova , Gildas Mazo , Johan Segers

Joint models are well suited to modelling linked data from laboratories and health registers. However, there are few examples of joint models that allow for (a) multiple markers, (b) multiple survival outcomes (including terminal events,…

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders,…

Information Theory · Computer Science 2009-11-13 Soheil Mohajer , Chao Tian , Suhas N. Diggavi

The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…

Information Theory · Computer Science 2009-05-19 Narayana Santhanam , Martin J. Wainwright

We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov process on the infinite-dimensional boundary…

Probability · Mathematics 2013-03-04 Alexei Borodin , Grigori Olshanski

Extreme value statistics (EVS) concerns the study of the statistics of the maximum or the minimum of a set of random variables. This is an important problem for any time-series and has applications in climate, finance, sports, all the way…

Statistical Mechanics · Physics 2020-10-12 Satya N. Majumdar , Arnab Pal , Gregory Schehr

This paper establishes an upper bound for the Kolmogorov distance between the maximum of a high-dimensional vector of smooth Wiener functionals and the maximum of a Gaussian random vector. As a special case, we show that the maximum of…

Statistics Theory · Mathematics 2019-02-07 Yuta Koike

Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…

Methodology · Statistics 2024-03-12 William K. Schwartz , Sonja Petrović , Hemanshu Kaul

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be mutually independent centered Gaussian processes with almost surely continuous sample paths. We derive the exact asymptotics of $$ P\left(\exists_{t \in [0,T]} \forall_{i=1 ... n} X_i(t)> u \right) $$…

Probability · Mathematics 2015-05-26 Krzysztof Dȩbicki , Enkelejd Hashorva , Lanpeng Ji , Kamil Tabiś

Under general multivariate regular variation conditions, the extreme Value-at-Risk of a portfolio can be expressed as an integral of a known kernel with respect to a generally unknown spectral measure supported on the unit simplex. The…

Statistics Theory · Mathematics 2020-03-09 Robert Yuen , Stilian Stoev , Dan Cooley

Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…

Artificial Intelligence · Computer Science 2013-01-14 Tal El-Hay , Nir Friedman

We show the variational convergence of an irreversible Markov jump process describing a finite stochastic particle system to the solution of a countable infinite system of deterministic time-inhomogeneous quadratic differential equations…

Analysis of PDEs · Mathematics 2025-07-08 Jasper Hoeksema , Chun Yin Lam , André Schlichting

In this article, we obtain a super-exponential rate of convergence in total variation between the traces of the first $m$ powers of an $n\times n$ random unitary matrices and a $2m$-dimensional Gaussian random variable. This generalizes…

Probability · Mathematics 2020-02-06 Kurt Johansson , Gaultier Lambert

A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In our model, the conditional probability that the i-th symbol in the chain equals zero (or unity) is a linear function…

Data Analysis, Statistics and Probability · Physics 2007-05-23 O. V. Usatenko , V. A. Yampol'skii

This paper studies the estimation of low-rank Markov chains from empirical trajectories. We propose a non-convex estimator based on rank-constrained likelihood maximization. Statistical upper bounds are provided for the Kullback-Leiber…

Machine Learning · Statistics 2018-07-20 Xudong Li , Mengdi Wang , Anru Zhang

Markov Chains with variable length are useful stochastic models for data compression that avoid the curse of dimensionality faced by that full Markov Chains. In this paper we introduce a Variable Length Markov Chain whose transition…

Methodology · Statistics 2020-01-01 Adriano Zanin Zambom , Seonjin Kim , Nancy Lopes Garcia

Max-linear Bayesian networks have emerged as highly applicable models for causal inference via extreme value data. However, conditional independence (CI) for max-linear Bayesian networks behaves differently than for classical Gaussian…

Statistics Theory · Mathematics 2021-06-16 Carlos Améndola , Ben Hollering , Seth Sullivant , Ngoc Tran

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim
‹ Prev 1 3 4 5 6 7 10 Next ›