Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[کتاب][B] Combinatorics of compositions and words
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel
Research Directions Focusing on a very active area of research in the last decade …
Research Directions Focusing on a very active area of research in the last decade …
Local limit theorems for finite and infinite urn models
HK Hwang, S Janson - 2008 - projecteuclid.org
Local limit theorems for finite and infinite urn models Page 1 The Annals of Probability 2008,
Vol. 36, No. 3, 992–1022 DOI: 10.1214/07-AOP350 © Institute of Mathematical Statistics, 2008 …
Vol. 36, No. 3, 992–1022 DOI: 10.1214/07-AOP350 © Institute of Mathematical Statistics, 2008 …
Rounding of continuous random variables and oscillatory asymptotics
S Janson - 2006 - projecteuclid.org
We study the characteristic function and moments of the integer-valued random variable⌊
X+ α⌋, where X is a continuous random variables. The results can be regarded as exact …
X+ α⌋, where X is a continuous random variables. The results can be regarded as exact …
Trickle-down processes and their boundaries
S Evans, R Grübel, A Wakolbinger - 2012 - projecteuclid.org
It is possible to represent each of a number of Markov chains as an evolving sequence of
connected subsets of a directed acyclic graph that grow in the following way: initially, all …
connected subsets of a directed acyclic graph that grow in the following way: initially, all …
Asymptotics of the moments of extreme-value related distribution functions
G Louchard, H Prodinger - Algorithmica, 2006 - Springer
The asymptotic cost of many algorithms and combinatorial structures is related to the
extreme-value Gumbel distribution exp (-exp (-x)). The following list is not exhaustive: Trie …
extreme-value Gumbel distribution exp (-exp (-x)). The following list is not exhaustive: Trie …
On the variance of the number of occupied boxes
LV Bogachev, AV Gnedin, YV Yakubovich - Advances in Applied …, 2008 - Elsevier
We consider the occupancy problem where balls are thrown independently at infinitely many
boxes with fixed positive frequencies. It is well known that the random number of boxes …
boxes with fixed positive frequencies. It is well known that the random number of boxes …
A distributed algorithm to find hamiltonian cycles in random graphs
In this paper, we present a distributed algorithm to find Hamiltonian cycles in G(n,p) graphs.
The algorithm works in a synchronous distributed setting. It finds a Hamiltonian cycle in …
The algorithm works in a synchronous distributed setting. It finds a Hamiltonian cycle in …
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
G Louchard, H Prodinger… - Discrete Mathematics & …, 2005 - dmtcs.episciences.org
We consider a sequence of n geometric random variables and interpret the outcome as an
urn model. For a given parameter m, we treat several parameters like what is the largest urn …
urn model. For a given parameter m, we treat several parameters like what is the largest urn …
[HTML][HTML] Gap-free compositions and gap-free samples of geometric random variables
P Hitczenko, A Knopfmacher - Discrete Mathematics, 2005 - Elsevier
We study the asymptotic probability that a random composition of an integer n is gap-free,
that is, that the sizes of parts in the composition form an interval. We show that this problem …
that is, that the sizes of parts in the composition form an interval. We show that this problem …
[PDF][PDF] Locally restricted compositions I. Restricted adjacent differences
EA Bender, ER Canfield - the electronic journal of combinatorics, 2005 - emis.de
We study compositions of the integer $ n $ in which the first part, successive differences, and
the last part are constrained to lie in prescribed sets ${\cal L, D, R} $, respectively. A simple …
the last part are constrained to lie in prescribed sets ${\cal L, D, R} $, respectively. A simple …