Results 131 to 140 of about 26,394 (176)
Some of the next articles are maybe not open access.

ITERATED LOGARITHM SPEED OF RETURN TIMES

Bulletin of the Australian Mathematical Society, 2017
In a general setting of an ergodic dynamical system, we give a more accurate calculation of the speed of the recurrence of a point to itself (or to a fixed point). Precisely, we show that for a certain $\unicode[STIX]{x1D709}$ depending on the dimension of the space, $\liminf _{n\rightarrow +\infty }(n\log \log n)^{\unicode[STIX]{x1D709}}d(T^{n}x,x)=0$
openaire   +1 more source

Iterative methods for logarithmic subtraction

Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003, 2004
The logarithmic number system (LNS) offers much better performance (in terms of power, speed and area) than floating point for multiplication, division, powers and roots. Moderate-precision addition (of like signs) in LNS generally can be done with table lookup followed by interpolation, whose implementation can be as, or more, efficient than the ...
openaire   +1 more source

Iterated logarithms of entire functions

Israel Journal of Mathematics, 1978
We characterize those sequences {f n} of entire functions satisfyingf n=exp(f n+1) for alln.
openaire   +2 more sources

Laws of the iterated logarithm for iterated Wiener processes

Journal of Theoretical Probability, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Y., Pierre-Loti-Viaud, D., Shi, Z.
openaire   +2 more sources

The Law of Iterated Logarithm

1994
Let the kernel Φ have the rank r = 1 and satisfy the conditions $$Eg_1^2 < \infty ,E|\Phi {|^{4/3}} < \infty $$ (9.1.1)
V. S. Koroljuk, Yu. V. Borovskich
openaire   +1 more source

On the law of the iterated logarithm. I

Indagationes Mathematicae (Proceedings), 1955
Die Verff. beweisen den folgenden Satz: Es sei \(n_1 < n_2 < \cdots\) eine unendliche Folge von positiven Zahlen mit \(n_{\nu+1}/n_\nu \geq q>1 \; (\nu =1,2,...)\). Für fast alle reellen \(x\) ist dann \(\limsup_{N \to \infty} (N \log\log N )^{-1/2} \left|\sum_{\nu=1}^N \exp 2 \pi i n_\nu x \right| =1\).
Erdős, Pál, Gál, István Sándor
openaire   +2 more sources

The law of iterated logarithm for logarithmic combinatorial assemblies

Lithuanian Mathematical Journal, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A new law of iterated logarithm

Acta Mathematica Hungarica, 1990
The authors study the limit behaviour as \(t\to \infty\) of the process \[ \xi(t)=\sup \{s :\;e\leq s\leq t,\quad W(s)\geq (2s \log \log s)^{1/2}\}, \] where \(W(t)\) is a Wiener process. The main result is the following Theorem: \[ \liminf_{t\to \infty}[\frac{\log \log t)^{1/2}}{(\log \log \log t)\cdot \log t}]\log \frac{\xi (t)}{t}=-C\quad a.s ...
Erdős, Paul, Révész, P.
openaire   +1 more source

The Limit Law of the Iterated Logarithm

Journal of Theoretical Probability, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Law of Iterated Logarithm for Parabolic SPDEs

1999
We prove a version of Strassen’s functional law of iterated logarithm for a family of parabolic SPDEs. The lack of scaling due to the Green function makes it impossible to reduce the proof to the comparison of one single process at several times.
Millet, Annie, Chenal, Fabien
openaire   +2 more sources

Home - About - Disclaimer - Privacy