Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Richard Arratia"'
Autor:
Richard Arratia, Stephen DeSalvo
Publikováno v:
Random Structures & Algorithms.
This article describes and compares methods for simulating the component counts of random logarithmic combinatorial structures such as permutations and mappings. We exploit the Feller coupling for simulating permutations to provide a very fast method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::993b9d93710f7a0a42adcddcb30c8667
https://www.repository.cam.ac.uk/handle/1810/275984
https://www.repository.cam.ac.uk/handle/1810/275984
Publikováno v:
Bernoulli 24, no. 1 (2018), 433-448
We remove the hypothesis "$S$ is finite" from the BKR inequality for product measures on $S^d$, which raises some issues related to descriptive set theory. We also discuss the extension of the BKR operator and inequality, from 2 events to 2 or more e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f3a681fb620ab23156ae1ababc3c164
https://projecteuclid.org/euclid.bj/1501142450
https://projecteuclid.org/euclid.bj/1501142450
Autor:
Stephen DeSalvo, Richard Arratia
Publikováno v:
Adv. in Appl. Probab. 47, no. 1 (2015), 292-305
Suppose one desires to randomly sample a pair of objects such as socks, hoping to get a matching pair. Even in the simplest situation for sampling, which is sampling with replacement, the innocent phrase "the distribution of the color of a matching p
Autor:
Peter H. Baxendale, Richard Arratia
Publikováno v:
Probability Theory and Related Fields. 162:411-429
Under the assumption that the distribution of a nonnegative random variable $$X$$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to decay at l
Publikováno v:
Statist. Sci. 31, no. 1 (2016), 27-29
This is the final version of the article. It first appeared from the Institute of Mathematical Statistics via http://dx.doi.org/10.1214/15-STS537
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society. 139:1-26
Knopfmacher [13] introduced the idea of an additive arithmetic semigroup as a general setting for an algebraic analogue of number theory. Within his framework, Zhang [19] showed that the asymptotic distribution of the values taken by additive functio
Publikováno v:
Scopus-Elsevier
We introduce a new graph polynomial in two variables. This ``interlace'' polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the significant differences are
Autor:
Stephen DeSalvo, Richard Arratia
We provide completely effective error estimates for Stirling numbers of the first and second kind, denoted by $s(n,m)$ and $S(n,m)$, respectively. These bounds are useful for values of $m \geq n - O(\sqrt{n})$. An application of our Theorem 5 yields,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41a3dc77548b1efde3a405dbf26db994
http://arxiv.org/abs/1404.3007
http://arxiv.org/abs/1404.3007
Publikováno v:
Scopus-Elsevier
Sequencing by hybridization is a method of reconstructing a long DNA string — that is, figuring out its nucleotide sequence — from knowledge of its short substrings. Unique reconstruction is not always possible, and the goal of this paper is to s