English
Related papers

Related papers: An Extremal Inequality for Long Markov Chains

200 papers

The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure and the parameters of the Gaussian distribution on the…

Machine Learning · Statistics 2010-05-06 Vincent Y. F. Tan , Animashree Anandkumar , Alan S. Willsky

We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…

Probability · Mathematics 2018-10-31 Harsha Honnappa , Raghu Pasupathy , Prateek Jaiswal

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

Statistics Theory · Mathematics 2017-05-08 Kai Zhang

We consider rate-distortion with two decoders, each with distinct side information. This problem is well understood when the side information at the decoders satisfies a certain degradedness condition. We consider cases in which this…

Information Theory · Computer Science 2016-12-13 Sinem Unal , Aaron B. Wagner

We study the maximal correlation coefficient $R(X,Y)$ between two stochastic processes $X$ and $Y$. In the case when $(X,Y)$ is a random walk, we find $R(X,Y)$ using the Cs\'{a}ki-Fischer identity and the lower semicontinuity of the map…

Probability · Mathematics 2026-04-02 Yinshan Chang , Qinwei Chen

For a bivariate random vector (X,Y), symmetry conditions are presented that yield stochastic orderings among |X|, |Y|, |max(X,Y)|, and | min(X, Y)|. Partial extensions of these results for multivariate random vectors (X1,...,Xn) are also…

Statistics Theory · Mathematics 2012-06-22 Yindeng Jiang , Michael D. Perlman

We construct examples of degree-two U- and V-statistics of $n$ i.i.d.~heavy-tailed random vectors in $\mathbb{R}^{d(n)}$, whose $\nu$-th moments exist for ${\nu > 2}$, and provide tight bounds on the error of approximating both statistics…

Statistics Theory · Mathematics 2024-06-19 Kevin Han Huang , Peter Orbanz

Recently, Chernozhukov, Chetverikov, and Kato [Ann. Statist. 42 (2014) 1564--1597] developed a new Gaussian comparison inequality for approximating the suprema of empirical processes. This paper exploits this technique to devise sharp…

Statistics Theory · Mathematics 2017-05-30 Fang Han , Sheng Xu , Wen-Xin Zhou

We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of…

Information Theory · Computer Science 2015-06-16 Sanket Satpathy , Paul Cuff

We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region…

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

This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier studies, as the coding…

Information Theory · Computer Science 2025-01-27 Ioannis Papoutsidakis , George C. Alexandropoulos

A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random…

Information Theory · Computer Science 2016-07-29 Yinfei Xu , Jun Chen , Qiao Wang

In two phase materials, each phase having a non-local response in time, it has been found that for some driving fields the response somehow untangles at specific times, and allows one to directly infer useful information about the geometry…

Mathematical Physics · Physics 2021-01-06 Ornella Mattei , Graeme W. Milton , Mihai Putinar

Multivariate extreme value distributions are a common choice for modelling multivariate extremes. In high dimensions, however, the construction of flexible and parsimonious models is challenging. We propose to combine bivariate max-stable…

Methodology · Statistics 2024-12-25 Shuang Hu , Zuoxiang Peng , Johan Segers

This paper characterizes the second-order coding rates for lossy source coding with side information available at both the encoder and the decoder. We first provide non-asymptotic bounds for this problem and then specialize the…

Information Theory · Computer Science 2014-10-13 Sy-Quoc Le , Vincent Y. F. Tan , Mehul Motani

We develop a martingale approximation approach to studying the limiting behavior of quadratic forms of Markov chains. We use the technique to examine the asymptotic behavior of lag-window estimators in time series and we apply the results…

Probability · Mathematics 2011-08-16 Yves F. Atchade , Matias D. Cattaneo

We describe various sets of conditional independence relationships, sufficient for qualitatively comparing non-vanishing squared partial correlations of a Gaussian random vector. These sufficient conditions are satisfied by several…

Statistics Theory · Mathematics 2018-10-16 Sanjay Chaudhuri

In the distributed coding of correlated sources, the problem of characterizing the joint probability distribution of a pair of random variables satisfying an n-letter Markov chain arises. The exact solution of this problem is intractable.…

Information Theory · Computer Science 2016-11-18 W. Kang , S. Ulukus

The classical approach to multivariate extreme value modelling assumes that the joint distribution belongs to a multivariate domain of attraction. This requires each marginal distribution be individually attracted to a univariate extreme…

Statistics Theory · Mathematics 2012-10-12 Sidney Resnick , David Zeber

The exponential strong converse for a coding problem states that, if a coding rate is beyond the theoretical limit, the correct probability converges to zero exponentially. For the lossy source coding with side-information, also known as…

Information Theory · Computer Science 2025-04-24 Shun Watanabe