Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Stephen DeSalvo"'
Autor:
Harry Crane, Stephen DeSalvo
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 2, Permutation..., Iss Permutation Patterns (2018)
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a corres
Externí odkaz:
https://doaj.org/article/b064d7de0c8648e6a86b74ed48ba14a2
Autor:
Richard Arratia, Stephen DeSalvo
Publikováno v:
Random Structures & Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::078c52ef8d255233e90a230f0eac98ba
https://doi.org/10.1002/rsa.21132
https://doi.org/10.1002/rsa.21132
Autor:
Stephen DeSalvo, James Y. Zhao
Publikováno v:
Computational Statistics. 35:837-869
We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced $\textit{probabilistic divide-and-conquer}$ technique. A simple exact sampling algorithm is presented for $2\times n$ table
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8aa724a191028fcd8402dcf28da20df6
https://doi.org/10.1007/s00180-019-00899-7
https://doi.org/10.1007/s00180-019-00899-7
Autor:
Stephen DeSalvo
Publikováno v:
Pure Mathematics and Applications. 26:22-45
We demonstrate an approach for exact sampling of certain discrete combinatorial distributions, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabilistic divide-and-conquer (PDC). The approach specializes to exact Bol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::421f719b79430e372542404dab18811c
https://doi.org/10.1515/puma-2015-0020
https://doi.org/10.1515/puma-2015-0020
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::509897fc7cb192550824fda8640fb2f3
https://doi.org/10.1239/aap/1427814592
https://doi.org/10.1239/aap/1427814592
Autor:
Igor Pak, Stephen DeSalvo
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes continuous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a3d76b5d6568188eefa79c33ba54c02
http://arxiv.org/abs/1611.06073
http://arxiv.org/abs/1611.06073
We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of the unifo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::527bd34a7b67f3c5320ed8de52db259b
Autor:
Stephen DeSalvo, Paul K. Newton
Publikováno v:
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 466:1957-1975
We study properties of an ensemble of Sudoku matrices (a special type of doubly stochastic matrix when normalized) using their statistically averaged singular values. The determinants are very nearly Cauchy distributed about the origin. The largest s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45d81f34523c36b0b8d46d124a9bee7f
https://doi.org/10.1098/rspa.2009.0522
https://doi.org/10.1098/rspa.2009.0522
Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
Autor:
Stephen DeSalvo
We provide several algorithms for the exact, uniform random sampling of Latin squares and Sudoku matrices via probabilistic divide-and-conquer (PDC). Our approach divides the sample space into smaller pieces, samples each separately, and combines the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d41050a80d0c496c92e14945d8cee9c9
Autor:
Stephen DeSalvo
We present a probabilistic divide-and-conquer (PDC) method for \emph{exact} sampling of conditional distributions of the form $\mathcal{L}( {\bf X}\, |\, {\bf X} \in E)$, where ${\bf X}$ is a random variable on $\mathcal{X}$, a complete, separable me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b011add7e88b603f0cacb992eaa0415
http://arxiv.org/abs/1411.6698
http://arxiv.org/abs/1411.6698