Related papers: On the LSL for random fields
We propose a computational method to obtain series expansions in powers of time for general dynamical systems described by a set of hierarchical rate equations. The method is generally applicable to problems in both equilibrium and…
We consider dynamical systems on a finite measure space fulfilling a spectral gap property and Birkhoff sums of a non-negative, non-integrable observable. For such systems we generalize strong laws of large numbers for intermediately…
Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…
We provide a sufficient condition for the bounded law of the iterated logarithms for strictly stationary random fields expressable as a functional of i.i.d. random fields when the summation is done on rectangles. The study is done via the…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
In this article, we study the local behaviour of the multiple polylogarithm functions at integer points, in the $s$-aspect. This is done by writing a Laurent type expansion at integer points, involving certain power series and rational…
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
In this paper we show how to extend the Sample-Path Large Deviation Principle for the urn model of Hill, Lane and Sudderth to the case in which the increment of the urn is not a binary variable. In particular, we sketch how to modify the…
The arm of this paper is to establish the strong law of large numbers (SLLN) of $m$-dependent random variables under the framework of sub-linear expectations. We establish the SLLN for a sequence of independent, but not necessarily…
We compare alternative computing strategies for solving the constrained lasso problem. As its name suggests, the constrained lasso extends the widely-used lasso to handle linear constraints, which allow the user to incorporate prior…
We give sufficient conditions for the bounded law of the iterated logarithms for strictly stationary random fields when the summation is done on rectangle. The study is done by the control of an appropriated maximal function. The case of…
Infinite-dimensional Lie algebras are introduced, which are only partially graded, and are specified by indices lying on cyclotomic rings. They may be thought of as generalizations of the Onsager algebra, but unlike it, or its sl(n)…
In this paper, we further explore the local-to-global approach for expansion of simplicial complexes that we call local spectral expansion. Specifically, we prove that local expansion in the links imply the global expansion phenomena of…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
This paper is part of a series of papers in which the asymptotic theory and appropriate symbolic computer code are developed to compute the asymptotic expansion of the solution of an n-th order ordinary differential equation. The paper…
We use Levy processes to generate joint prior distributions, and therefore penalty functions, for a location parameter as p grows large. This generalizes the class of local-global shrinkage rules based on scale mixtures of normals,…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
In his 1996 paper, Talagrand highlighted that the Law of Large Numbers (LLN) for independent random variables can be viewed as a geometric property of multidimensional product spaces. This phenomenon is known as the concentration of…