A limit theorem for difference operators

1973 ◽  
pp. 244-252
Author(s):  
A. I. Žukov
Keyword(s):  
Limit Theorem ◽  
Difference Operators

scholarly journals Quenched local limit theorem for random walks among time-dependent ergodic degenerate weights

2021 ◽  
Vol 179 (3-4) ◽  
pp. 1145-1181 ◽  
Author(s):  
Sebastian Andres ◽  
Alberto Chiarini ◽  
Martin Slowik
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Local Limit Theorem ◽  
Time Dependent ◽  
Moment Condition ◽  
Difference Operators ◽  
Random Conductance Model ◽  
Local Central Limit Theorem ◽  
Random Conductance

AbstractWe establish a quenched local central limit theorem for the dynamic random conductance model on $${\mathbb {Z}}^d$$ Z d only assuming ergodicity with respect to space-time shifts and a moment condition. As a key analytic ingredient we show Hölder continuity estimates for solutions to the heat equation for discrete finite difference operators in divergence form with time-dependent degenerate weights. The proof is based on De Giorgi’s iteration technique. In addition, we also derive a quenched local central limit theorem for the static random conductance model on a class of random graphs with degenerate ergodic weights.

Efficiency, Sufficiency, and Optimality

2017 ◽  
Author(s):  
Amos Golan
Keyword(s):  
Limit Theorem ◽  
Computational Efficiency ◽  
The Other ◽  
Information Compression ◽  
Information Theoretic ◽  
Conditional Limit Theorem ◽  
Concept Of Information ◽  
Conditional Limit

In this chapter I provide additional rationalization for using the info-metrics framework. This time the justifications are in terms of the statistical, mathematical, and information-theoretic properties of the formalism. Specifically, in this chapter I discuss optimality, statistical and computational efficiency, sufficiency, the concentration theorem, the conditional limit theorem, and the concept of information compression. These properties, together with the other properties and measures developed in earlier chapters, provide logical, mathematical, and statistical justifications for employing the info-metrics framework.

scholarly journals On the Markov Transition Kernels for First Passage Percolation on the Ladder

2011 ◽  
Vol 48 (02) ◽  
pp. 366-388 ◽  
Author(s):  
Eckhard Schlemm
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Asymptotic Variance ◽  
Almost Sure Convergence ◽  
First Passage Percolation ◽  
First Passage ◽  
Percolation Problem ◽  
Vertex Set ◽  
Step Transition

We consider the first passage percolation problem on the random graph with vertex set N x {0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edge weights. We provide a central limit theorem for the first passage times l n between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of l n / n as n → ∞. We use generating function techniques to compute the n-step transition kernels of a closely related Markov chain which can be used to explicitly calculate the asymptotic variance in the central limit theorem.

Sign in / Sign up

Export Citation Format

Share Document