From almost sure local regularity to almost sure Hausdorff dimension for Gaussian fields
نویسندگان
چکیده
منابع مشابه
Almost sure local limit theorems
Chung and Erdös (1951) are among the first to prove some form of an almost sure local limit theorem (cf. Csáki et al., 1993). Here we propose a formulation of such statements and discuss related problems. Surely, Frits will enjoy them. c ©2001, June 19.
متن کاملAlmost Sure Productivity
We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...
متن کاملBeyond Almost-Sure Termination
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...
متن کاملAlmost Sure Central Limit Theorem for a Nonstationary Gaussian Sequence
Let {Xn; n ≥ 1} be a standardized non-stationary Gaussian sequence, and let denote Sn ∑n k 1 Xk , σn √ Var Sn . Under some additional condition, let the constants {uni; 1 ≤ i ≤ n, n ≥ 1} satisfy ∑n i 1 1−Φ uni → τ as n → ∞ for some τ ≥ 0 and min1≤i≤n uni ≥ c logn , for some c > 0, then, we have limn→∞ 1/ logn ∑n k 1 1/k I{∩i 1 Xi ≤ uki , Sk/σk ≤ x} e−τΦ x almost surely for any x ∈ R, where I A ...
متن کاملAlmost Sure Classification of Densities
Let a class F of densities be given. We draw an i.i.d. sample from a density f which may or may not be in F . After every n, one must make a guess whether f ∈ F or not. A class is almost surely discernible if there exists such a sequence of classification rules such that for any f , we make finitely many errors almost surely. In this paper several results are given that allow one to decide whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Probability and Statistics
سال: 2014
ISSN: 1292-8100,1262-3318
DOI: 10.1051/ps/2013044