English
Related papers

Related papers: Entropy Rate Bounds via Second-Order Statistics

200 papers

Entropy estimation, due in part to its connection with mutual information, has seen considerable use in the study of time series data including causality detection and information flow. In many cases, the entropy is estimated using…

Statistics Theory · Mathematics 2019-08-06 Alexander L Young , David B Dunson

The spectral density function describes the second-order properties of a stationary stochastic process on $\mathbb{R}^d$. This paper considers the nonparametric estimation of the spectral density of a continuous-time stochastic process…

Statistics Theory · Mathematics 2023-02-07 Rafail Kartsioukas , Stilian Stoev , Tailen Hsing

The selection of an equilibrium state by maximising the entropy of a system, subject to certain constraints, is often powerfully motivated as an exercise in logical inference, a procedure where conclusions are reached on the basis of…

Statistical Mechanics · Physics 2015-12-03 Ian J. Ford

We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of…

Chaotic Dynamics · Physics 2011-12-13 Taichi Haruna , Kohei Nakajima

We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…

Computational Geometry · Computer Science 2025-08-29 David Eppstein , Michael T. Goodrich , Abraham M. Illickan , Claire A. To

Stochastic blockmodels are generative network models where the vertices are separated into discrete groups, and the probability of an edge existing between two vertices is determined solely by their group membership. In this paper, we…

Statistical Mechanics · Physics 2013-11-12 Tiago P. Peixoto

Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomness; the statistical complexity gives the cost of predicting the process. We calculate, for the first time, the entropy rate and statistical…

Statistical Mechanics · Physics 2017-09-13 S. E. Marzen , J. P. Crutchfield

We obtain two-sided bounds for the density of stochastic processes satisfying a weak H\"ormander condition. In particular we consider the cases when the support of the density is not the whole space and when the density has various…

Probability · Mathematics 2012-12-14 Chiara Cinti , Stephane Menozzi , Sergio Polidoro

This paper introduces a new concept of stochastic dependence among many random variables which we call conditional neighborhood dependence (CND). Suppose that there are a set of random variables and a set of sigma algebras where both sets…

Statistics Theory · Mathematics 2018-06-06 Ji Hyung Lee , Kyungchul Song

Entropy production in stochastic mechanical systems is examined here with strict bounds on its rate. Stochastic mechanical systems include pure diffusions in Euclidean space or on Lie groups, as well as systems evolving on phase space for…

Mathematical Physics · Physics 2022-01-12 Gregory S. Chirikjian

For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…

Systems and Control · Electrical Eng. & Systems 2020-04-13 Mahendra Singh Tomar , Christoph Kawan , Pushpak Jagtap , Majid Zamani

The interrelationships of the fundamental biological processes natural selection, mutation, and stochastic drift are quantified by the entropy rate of Moran processes with mutation, measuring the long-run variation of a Markov process. The…

Dynamical Systems · Mathematics 2014-01-14 Marc Harper

The conditional mean is a fundamental and important quantity whose applications include the theories of estimation and rate-distortion. It is also notoriously difficult to work with. This paper establishes novel bounds on the differential…

Information Theory · Computer Science 2022-11-23 Arda Atalik , Alper Köse , Michael Gastpar

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

Information Theory · Computer Science 2017-01-04 Günther Koliander , Georg Pichler , Erwin Riegler , Franz Hlawatsch

A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stationary. We use the quasi-stationary property in order to…

Information Theory · Computer Science 2009-06-15 Ido Tal , Ron M. Roth

We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that…

Discrete Mathematics · Computer Science 2010-07-16 Jan Vondrak

We study a distributed consensus-based stochastic gradient descent (SGD) algorithm and show that the rate of convergence involves the spectral properties of two matrices: the standard spectral gap of a weight matrix from the network…

Optimization and Control · Mathematics 2016-09-02 Avleen S. Bijral , Anand D. Sarwate , Nathan Srebro

We analyze the stochastic thermodynamics of systems with continuous space of states. The evolution equation, the rate of entropy production, and other results are obtained by a continuous time limit of a discrete time formulation. We point…

Statistical Mechanics · Physics 2020-08-27 Mário J. de Oliveira

The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distributions, which is defined by some linear requirements. In this…

Information Theory · Computer Science 2009-09-29 Ido Tal , Ron M. Roth

Tight bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources are derived. A pattern of a sequence is a sequence of integer indices with each index representing the order of…

Information Theory · Computer Science 2007-11-14 Gil I. Shamir