8 hasil untuk "Devroye, Luc"
Menampilkan 1–8 · 0,39 detik · RSS
-
Artikel Jurnal Teks lengkap
Remote Sampling with Applications to General Entanglement Simulation
We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann’s rejection algorithm is turned into a distributed sampling communication protocol. We study the expected number of bits communicated among…
-
Preprint Teks lengkap
A note on the exact simulation of a random eigenvalue of a GUE matrix
We develop a simple algorithm to generate random variables described by densities equaling squared Hermite functions. As an application, we show how to generate a randomly chosen eigenvalue of a matrix from the Gaussian Unitary Ensemble ({\textsc{gue}}) in sub-linear expected time.
-
Preprint Teks lengkap
On the volume of the elliptope and related metric polytopes
In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ vertices. The cut polytope is contained in each of the other three, which, for optimization purposes…
-
Artikel Jurnal Teks lengkap
Tree Height and the Asymptotic Mean of the Colijn–Plazzotta Rank of Unlabeled Binary Rooted Trees
The Colijn–Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank f(t) of a tree t is closely related to its height h, the maximal path length from a leaf to the root. We consider the rank [Formula: see text] of a random n-leaf…
-
Preprint Teks lengkap
A study of centrality measures in random recursive trees
We investigate the behaviour of five classical centrality measures--Jordan, rumor, betweenness, degree, and closeness centralities--in the setting of uniform random recursive trees. Motivated by applications in network archaeology, we focus on two fundamental questions: (i) the birth index (time of…
-
Preprint Teks lengkap
Perfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution.
-
Buku Teks lengkap
Lectures on the nearest neighbor method
This text presents a wide-ranging and rigorous overview of nearest neighbor methods, one of the most important paradigms in machine learning. Now in one self-contained volume, this book systematically covers key statistical, probabilistic, combinatorial and geometric ideas for understanding…