Related papers: Random generation with cycle type restrictions

This paper describes a bounded generation result concerning the minimal natural number $K$ such that for $Q(C_2,2R):=\{A\varepsilon_{\phi}(2x)A^{-1}|x\in R,A\in{\rm Sp}_4(R),\phi\in C_2\}$, one has $N_{C_2,2R}=\{X_1\cdots X_K|\forall 1\leq…

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

We present a new computational scheme, GRIP (Geometric Random Inner Products), for testing the quality of random number generators. The GRIP formalism utilizes geometric probability techniques to calculate the average scalar products of…

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…

We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

We show that for the product of two fixed point free conjugacy classes, the average number of cycles is always very similar. Specifically, our main result is that for a randomly chosen pair of fixed point free permutations of cycle types…

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…

This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

The characters $\chi(\pi)$ of $S_n$ that depend only on the number of cycles of $\pi$ are completely determined.

For a fixed integer $m\ge 1$, let $\mathcal{A}_n^{(m)}$ be the set of permutations $\pi\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1}-\pi_i|\le m$ for all $i$. Here, a pattern $132$ means three indices…

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

Random graph generation is an important tool for studying large complex networks. Despite abundance of random graph models, constructing models with application-driven constraints is poorly understood. In order to advance state-of-the-art…

Let $\pi$ be a cyclic permutation that can be expressed in its one-line form as $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and in its standard cycle form as $\pi = (c_1,c_2, ..., c_n)$ where $c_1=1$. Archer et al. introduced the notion of…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…