Results 11 to 16 of about 18 (16)
Revisiting linearly extended discrete functions
The authors introduced a new family of cryptographic schemes in a previous research article, which includes many practical encryption schemes, such as the Feistel family. Given a finite field of order qq, any n>m≥0n\gt m\ge 0, the authors described a new
Gravel Claude, Panario Daniel
doaj +1 more source
Central Limit Theorem for Random “Contractive” Functions on Interval
We use the approach from Czudek and Szarek (see [1]) to prove the central limit theorem for a stationary Markov chain generated by an iterative function system for a family of increasing, injective functions on [0, 1] with “contractive” properties.
Block Maciej +2 more
doaj +1 more source
Every complex Hénon map is exponentially mixing of all orders and satisfies the CLT
We show that the measure of maximal entropy of every complex Hénon map is exponentially mixing of all orders for Hölder observables. As a consequence, the Central Limit Theorem holds for all Hölder observables.
Fabrizio Bianchi, Tien-Cuong Dinh
doaj +1 more source
Prime numbers in typical continued fraction expansions. [PDF]
Schindler TI, Zweimüller R.
europepmc +1 more source
Mixing of fast random walks on dynamic random permutations. [PDF]
Avena L +3 more
europepmc +1 more source
Subexponential lower bounds for <i>f</i>-ergodic Markov processes. [PDF]
Brešar M, Mijatović A.
europepmc +1 more source

