Independent and identically distributed pseudo-random samples
Ivan Kramosil (1987)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Infinite pseudo-random sequences of high algorithmic complexity”
Independent and identically distributed pseudo-random samples
Random walks on finite groups with few random generators.
Pak, Igor (1999)
Electronic Journal of Probability [electronic only]
Similarity:
Subexponential tail asymptotics for a random walk with randomly placed one-way nodes
Nina Gantert (2002)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
How many intervals cover a point in random dyadic covering?
Fan, Aihua, Kahane, J. P. (2001)
Portugaliae Mathematica. Nova Série
Similarity:
A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.
Iksanov, Alex, Möhle, Martin (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Large deviations for voter model occupation times in two dimensions
G. Maillard, T. Mountford (2009)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We study the decay rate of large deviation probabilities of occupation times, up to time , for the voter model : ℤ×[0, ∞)→{0, 1} with simple random walk transition kernel, starting from a Bernoulli product distribution with density ∈(0, 1). In [ (1988) 401–413], Bramson, Cox and Griffeath showed that the decay rate order lies in [log(), log()]. In this paper, we establish the true decay rates depending on the level. We show that the decay rates are log() when the deviation...