English
Related papers

Related papers: Random generation under the Ewens distribution

200 papers

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Combinatorics · Mathematics 2026-03-31 Verónica Borrás-Serrano , Isabel Byrne , Anant Godbole , Nathaniel Veimau

We devise survey-weighted pseudo posterior distribution estimators under two-stage informative sampling of both primary clusters and secondary nested units for a one-way analysis of variance (ANOVA) population generating model as a simple…

Methodology · Statistics 2023-05-16 Terrance D. Savitsky , Matthew R. Williams , Sanvesh Srivastava

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…

Discrete Mathematics · Computer Science 2017-09-28 Samantha Petti , Santosh Vempala

For a distribution $p:=\{p_k\}_{k=1}^\infty$ on the positive integers, there are two natural ways to construct a random permutation in $S_n$ or of $\mathbb{N}$ from IID samples from $p$--the $p$-biased construction and the $p$-shifted…

Probability · Mathematics 2021-02-23 Ross G. Pinsky

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

When a beneficial mutation occurs in a population, the new, favored allele may spread to the entire population. This process is known as a selective sweep. Suppose we sample $n$ individuals at the end of a selective sweep. If we focus on a…

Probability · Mathematics 2007-05-23 Jason Schweinsberg , Rick Durrett

Enriching Brownian motion with regenerations from a fixed regeneration distribution $\mu$ at a particular regeneration rate $\kappa$ results in a Markov process that has a target distribution $\pi$ as its invariant distribution. For the…

Computation · Statistics 2024-02-22 Hector McKimm , Andi Q Wang , Murray Pollock , Christian P Robert , Gareth O Roberts

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

Group Theory · Mathematics 2017-10-31 Timothy C. Burness

Let $X$ and $Y$ be independent variance-gamma random variables with zero location parameter; then the exact probability density function of the ratio $X/Y$ is derived. Some basic distributional properties are also derived, including…

Probability · Mathematics 2023-02-27 Robert E. Gaunt , Siqi Li

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Probability · Mathematics 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

Combinatorics · Mathematics 2016-07-05 Megan Bernstein

Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon…

Probability · Mathematics 2024-06-26 Jeannette Janssen , Aaron Smith

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…

Statistics Theory · Mathematics 2026-04-28 Sourav Chatterjee , Persi Diaconis , Susan Holmes

Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast generation of these networks. Existing techniques are…

Data Structures and Algorithms · Computer Science 2015-12-14 Eric Parsonage , Matthew Roughan

The Ewens-Pitman model defines a distribution on random partitions of $\{1,\ldots,n\}$, with parameters $\alpha \in [0,1)$ and $\theta > -\alpha$; the case $\alpha=0$ reduces to the classical Ewens model from population genetics. We…

Probability · Mathematics 2026-01-28 Bernard Bercu , Claudia Contardi , Emanuele Dolera , Stefano Favaro

An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…

Information Theory · Computer Science 2021-01-08 Claude Gravel

The well known Three Gap Theorem states that there are at most three gap sizes in the sequence of fractional parts $\{\alpha n\}_{n<N}$ . It is known that if one averages over {\alpha}, the distribution becomes continuous. We present an…

Number Theory · Mathematics 2015-12-01 Geremías Polanco , Daniel Schultz , Alexandru Zaharescu

The Weibull distribution can be obtained using a power transformation from the standard exponential distribution. In this article, we will consider a symmetrized power transformation of a random variable with the standard normal…

Probability · Mathematics 2024-01-09 Krzysztof Zajkowski

Design of experiments, random search, initialization of population-based methods, or sampling inside an epoch of an evolutionary algorithm use a sample drawn according to some probability distribution for approximating the location of an…

Neural and Evolutionary Computing · Computer Science 2020-04-27 Laurent Meunier , Carola Doerr , Jeremy Rapin , Olivier Teytaud

A classical problem in random number generation is the sampling of elements from a given discrete distribution. Formally, given a set of indices $S = \{1, \dots, n\}$ and sequence of weights $w_1, \dots, w_n \in \mathbb{R}^+$, the task is…

Data Structures and Algorithms · Computer Science 2023-10-19 Daniel Allendorf