English
Related papers

Related papers: On typical encodings of multivariate ergodic sourc…

200 papers

This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…

Information Theory · Computer Science 2014-04-28 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

This paper investigates the Gaussian quasi-likelihood estimation of an exponentially ergodic multidimensional Markov process, which is expressed as a solution to a L\'{e}vy driven stochastic differential equation whose coefficients are…

Statistics Theory · Mathematics 2013-08-14 Hiroki Masuda

Regularized system identification is the major advance in system identification in the last decade. Although many promising results have been achieved, it is far from complete and there are still many key problems to be solved. One of them…

Systems and Control · Electrical Eng. & Systems 2023-04-05 Yue Ju , Biqiang Mu , Lennart Ljung , Tianshi Chen

We establish asymptotic normality of weighted sums of periodograms of a stationary linear process where weights depend on the sample size. Such sums appear in numerous statistical applications and can be regarded as a discretized versions…

Statistics Theory · Mathematics 2013-12-18 Liudas Giraitis , Hira L. Koul

We continue the investigation of the spectral theory and exponential asymptotics of Markov processes, following Kontoyiannis and Meyn (2003). We introduce a new family of nonlinear Lyapunov drift criteria, characterizing distinct subclasses…

Probability · Mathematics 2007-05-23 Ioannis Kontoyiannis , S. P. Meyn

Performance accuracy of the Euclidean Distance Discriminant rule (EDDR) is studied in the high-dimensional asymptotic framework which allows the dimensionality to exceed sample size. Under mild assumptions on the traces of the covariance…

Statistics Theory · Mathematics 2014-03-04 H. Watanabe , M. Hyodo , T. Seo , T. Pavlenko

We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the…

Information Theory · Computer Science 2011-04-05 Paul M. B. Vitányi

We study the ergodic properties of a class of controlled stochastic differential equations (SDEs) driven by $\alpha$-stable processes which arise as the limiting equations of multiclass queueing models in the Halfin-Whitt regime that have…

Probability · Mathematics 2019-07-22 Ari Arapostathis , Hassan Hmedi , Guodong Pang , Nikola Sandrić

The main goal of this paper is to develop an estimate for the entropy of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We present here the detailed analytical study of the entropy for the…

Statistical Mechanics · Physics 2019-08-01 S. S. Melnik , O. V. Usatenko

In this article we prove a Generalized Asypmtotic Equipartition Property for Networked Data Structures modelled as coloured random graphs. The main techniques in this article remains large deviation principles for suitably defined empirical…

Information Theory · Computer Science 2017-12-19 K. Doku-Amponsah

We construct multiperiodic processes -- a simple example of stationary ergodic (but not mixing) processes over natural numbers that enjoy the vanishing entropy rate under a mild condition. Multiperiodic processes are supported on randomly…

Information Theory · Computer Science 2026-01-21 Łukasz Dębowski

The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We extend…

Information Theory · Computer Science 2007-07-13 Maxim Raginsky

We make the first steps towards an understanding of the ergodic properties of a rational map defined over a complete algebraically closed non-archimedean field. For such a rational map R, we construct a natural invariant probability measure…

Dynamical Systems · Mathematics 2014-02-26 Charles Favre , Juan Rivera-Letelier

We study the limiting behavior of multiple ergodic averages involving several not necessarily commuting measure preserving transformations. We work on two types of averages, one that uses iterates along combinatorial parallelepipeds, and…

Dynamical Systems · Mathematics 2011-02-09 Qing Chu , Nikos Frantzikinakis

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

Mathematical Physics · Physics 2025-12-02 Pierluigi Contucci , Claudio Giberti , Godwin Osabutey , Cecilia Vernia

Given a factor code $\pi$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, if $\pi$ is finite-to-one there is an invariant called the degree of $\pi$ which is defined the number of preimages of a typical…

Dynamical Systems · Mathematics 2013-11-26 Mahsa Allahbakhshi , Anthony Quas

Channels with noisy duplications have recently been used to model the nanopore sequencer. This paper extends some foundational information-theoretic results to this new scenario. We prove the asymptotic equipartition property (AEP) for…

Information Theory · Computer Science 2024-05-10 Brendon McBain , James Saunderson , Emanuele Viterbo

In [17] the author and A. Vershik have shown that for $\be=\frac12(1+\sqrt5)$ and the alphabet $\{0,1\}$ the infinite Bernoulli convolution ($=$ the Erd\"os measure) has a property similar to the Lebesgue measure. Namely, it is…

Dynamical Systems · Mathematics 2007-05-23 Nikita Sidorov

We consider parametric inference for an ergodic and stationary diffusion process, when the data are high-frequency observations of the integral of the diffusion process. Such data are obtained via certain measurement devices, or if…

Statistics Theory · Mathematics 2026-02-09 Emil S. Jørgensen , Michael Sørensen

We prove the convergence at an exponential rate towards the invariant probability measure for a class of solutions of stochastic differential equations with finite delay. This is done, in this non-Markovian setting, using the cluster…

Probability · Mathematics 2016-07-11 Laure Pédèches
‹ Prev 1 4 5 6 7 8 10 Next ›