Results 21 to 30 of about 1,308 (81)
A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES
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
The random interchange process on the hypercube [PDF]
We prove the occurrence of a phase transition accompanied by the emergence of cycles of diverging lengths in the random interchange process on the hypercube.Comment: 8 ...
Kotecký, Roman +2 more
core +2 more sources
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
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
Lower bounds for bootstrap percolation on Galton-Watson trees [PDF]
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in terms of ...
Gunderson, Karen, Przykucki, Michał
core +2 more sources
On the birthday problem: some generalizations and applications
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]
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
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
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
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

