Related papers: Computing bounds for entropy of stationary Z^d Mar…

Making statistical predictions requires tackling two problems: one must assign appropriate probability distributions and then one must calculate a variety of expected values. The method of maximum entropy is commonly used to address the…

We propose an algorithm to estimate the common density $s$ of a stationary process $X_1,...,X_n$. We suppose that the process is either $\beta$ or $\tau$-mixing. We provide a model selection procedure based on a generalization of Mallows'…

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…

Many Gibbs measures with mean field interactions are known to be chaotic, in the sense that any collection of $k$ particles in the $n$-particle system are asymptotically independent, as $n\to\infty$ with $k$ fixed or perhaps $k=o(n)$. This…

Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

Rue and Held (2005) proposed a method for efficiently computing the Gaussian likelihood for stationary Markov random field models, when the data locations fall on a complete regular grid, and the model has no additive error term. The…

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

Strong invariance principles describe the error term of a Brownian approximation of the partial sums of a stochastic process. While these strong approximation results have many applications, the results for continuous-time settings have…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

We prove the large deviation principle for several entropy and cross entropy estimators based on return times and waiting times on shift spaces over finite alphabets. We consider shift-invariant probability measures satisfying some…

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

We consider random perturbations of a topologically transitive local diffeomorphism of a Riemannian manifold. We show that if an absolutely continuous ergodic stationary measures is expanding (all Lyapunov exponents positive), then there is…

We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Let $\{X(\mathbf{t}):\mathbf{t}=(t_1, t_2, \ldots, t_d)\in[0,\infty)^d\}$ be a centered stationary Gaussian field with almost surely continuous sample paths, unit variance and correlation function $r$ satisfying conditions $r(\mathbf{t})<1$…

Approximate Bayesian computation methods are useful for generative models with intractable likelihoods. These methods are however sensitive to the dimension of the parameter space, requiring exponentially increasing resources as this…

Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical…

It is argued that a Gibbsian formula for the space-time distribution of microscopic trajectories of a nonequilibrium system provides a unifying framework for recent results on the fluctuations of the entropy production. The variable entropy…

The particle Gibbs sampler is a Markov chain Monte Carlo (MCMC) algorithm to sample from the full posterior distribution of a state-space model. It does so by executing Gibbs sampling steps on an extended target distribution defined on the…