Random-number functions and CALL routines generate streams of random numbers from an initial starting point, called a seed, that either the user or the computer clock supplies. A seed must be a ...

Let P = (pjk) be the transition matrix of an ergodic, finite Markov chain with no cyclically moving sub-classes. For each possible transition (j, k), let Hjk(x) be a distribution function admitting a ...

If random variables in one set are defined as explicit functions of random variables in a second set, Taylor series expansion (the delta method) may be used to prove the asymptotic normality of the ...

Random analytic functions are a fundamental object of study in modern complex analysis and probability theory. These functions, often defined through power series with random coefficients, exhibit ...