Related papers: Random Multiplication Approaches Uniform Measure i…
Let $G$ be a finite Abelian group of order $d$. We consider an urn in which, initially, there are labeled balls that generate the group $G$. Choosing two balls from the urn with replacement, observe their labels, and perform a group…
Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…
An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
Consider an urn filled with balls, each labeled with one of several possible collective decisions. Now, let a random voter draw two balls from the urn and pick her more preferred as the collective decision. Relabel the losing ball with the…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…
We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…
We consider a special case of the generalized P\'{o}lya's urn model introduced by Benaim et al (2013). Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete…
This paper studies a very general urn model stimulated by designs in clinical trials, where the number of balls of different types added to the urn at trial n depends on a random outcome directed by the composition at trials 1,2,...,n-1.…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using ``coupling…
Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
In this paper, we consider a multi-drawing urn model with random addition. At each discrete time step, we draw a sample of m balls. According to the composition of the drawn colors, we return the balls together with a random number of balls…