Results 11 to 20 of about 48 (48)
The Largest Component in Critical Random Intersection Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, through the coupling and martingale method, we prove the order of the largest component in some critical random intersection graphs is n23$n^{{2 \over 3}}$ with high probability and the width of scaling window around the critical ...
Wang Bin, Wang Longmin, Xiang Kainan
doaj +1 more source
Variance and Covariance of Several Simultaneous Outputs of a Markov Chain [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded.
Sara Kropf
doaj +1 more source
Extended Fibonacci numbers and polynomials with probability applications
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 50, Page 2681-2693, 2004., 2004 The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and polynomials are obtained.
Demetrios L. Antzoulakos
wiley +1 more source
A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES
Forum of Mathematics, Sigma, 2019 Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of $n$ without $k$ consecutive parts.
DANIEL M. KANE, ROBERT C. RHOADES
doaj +1 more source
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
Forum of Mathematics, Pi, 2016 We prove that proper coloring distinguishes between block factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a block factor if it ...
ALEXANDER E. HOLROYD, THOMAS M. LIGGETT
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2007 Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches.
Mireille Bousquet-Mélou, Yann Ponty
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
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
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