Results 21 to 30 of about 90 (88)
On the birthday problem: some generalizations and applications
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 60, Page 3827-3840, 2003., 2003 We study the birthday problem and some possible extensions. We discuss the unimodality of the corresponding exact probability distribution and express the moments and generating functions by means of confluent hypergeometric functions U(−; −; −) which are computable using the software Mathematica.
P. N. Rathie, P. Zörnig
wiley +1 more source
The distribution of m-ary search trees generated by van der Corput sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We study the structure of $m$-ary search trees generated by the van der Corput sequences. The height of the tree is calculated and a generating function approach shows that the distribution of the depths of the nodes is asymptotically normal ...
Wolfgang Steiner
doaj +1 more source
Generalized distributions of order k associated with success runs in Bernoulli trials
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 13, Page 801-815, 2003., 2003 In a sequence of independent Bernoulli trials, by counting multidimensional lattice paths in order to compute the probability of a first‐passage event, we derive and study a generalized negative binomial distribution of order k, type I, which extends to distributions of order k, the generalized negative binomial distribution of Jain and Consul (1971 ...
Gregory A. Tripsiannis +2 more
wiley +1 more source
A zero‐inflated occupancy distribution: exact results and Poisson convergence
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 28, Page 1771-1782, 2003., 2003 We introduce the generalized zero‐inflated allocation scheme of placing n labeled balls into N labeled cells. We study the asymptotic behavior of the number of empty cells when (n, N) belongs to the “right” and “left” domain of attraction. An application to the estimation of characteristics of agreement among a set of raters which independently ...
Nikolai Kolev, Ljuben Mutafchiev
wiley +1 more source
Circular Polya distributions of order k
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 25, Page 1563-1575, 2003., 2003 Two circular Polya distributions of order k are derived by means of generalized urn models and by compounding, respectively, the type I and type II circular binomial distributions of order k of Makri and Philippou (1994) with the beta distribution.
Gregory A. Tripsiannis +1 more
wiley +1 more source
BROOKS’ THEOREM FOR MEASURABLE COLORINGS
Forum of Mathematics, Sigma, 2016 We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $
CLINTON T. CONLEY +2 more
doaj +1 more source
On the local time density of the reflecting Brownian bridge
International Journal of Stochastic Analysis, Volume 13, Issue 2, Page 125-136, 2000., 2000 Expressions for the multi‐dimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac′s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings.
Bernhard Gittenberger, Guy Louchard
wiley +1 more source
Involution factorizations of Ewens random permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceAn involution is a bijection that is its own inverse. Given a permutation $σ$ of $[n],$ let $\mathsf{invol}(σ)$ denote the number of ways $σ$ can be expressed as a composition of two involutions of $[n].$ We prove that the statistic $\mathsf{invol}$ is ...
Charles Burnette
doaj +1 more source
YANG–BAXTER FIELD FOR SPIN HALL–LITTLEWOOD SYMMETRIC FUNCTIONS
Forum of Mathematics, Sigma, 2019 Employing bijectivization of summation identities, we introduce local stochastic moves based on the Yang–Baxter equation for $U_{q}(\widehat{\mathfrak{sl}_{2}})$.
ALEXEY BUFETOV, LEONID PETROV
doaj +1 more source
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of distinct ...
Anant Godbole, Hannah Swickheimer
doaj +1 more source