Almost sure lower bounds for a model problem for multiplicative chaos in number theory
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملAlmost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples
Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...
متن کاملOn Almost-Sure Bounds for the LMS Algorithm
Almost-sure (as.) bounds for linear, constant-gain, generd pseudo-stationarity and dependence conditions on the driving data { J ~ k , k = 1 , 2 , 3 ,... }, { Y k , l i = 0 , 1 , 2 ,... } as. convergence and r a t s of a.s. convergence (as the algorithm gain c + 0) are established for the LMS algorithm second-order stochastic processes defined on a common probability space. A basic problem of a...
متن کاملsome lower bounds for the $l$-intersection number of graphs
for a set of non-negative integers~$l$, the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$. the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملA Note for Extension of Almost Sure Central Limit Theory
for any continuity point x of H . Several papers have dealt with logarithmic limit theorems of this kind and the above relation has been extended in various directions. Fahrner and Stadtmüller [5] gave an almost sure version of a maximum limit theorem. Berkes and Horváth [2] obtained a strong approximation for the logarithmic average of sample extremes. Berkes and Csáki [1] showed that not only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2022
ISSN: ['2041-7942', '0025-5793']
DOI: https://doi.org/10.1112/mtk.12170