Related papers: Cycle structure of random permutations with cycle …
We characterize the distributions of short cycles in a large metabolic network previously shown to have small world characteristics and a power law degree distribution. Compared with three classes of random networks, including Erdoes-Renyi…
We show that very simple continued fractions can be obtained for the ordinary generating functions enumerating permutations or D-permutations with a large number of independent statistics, when each cycle is given a weight $-1$. The proof…
We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…
In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
The dynamics of elongated inertial particles in an extensional flow is studied numerically by performing simulations of freely jointed bead-rod chains. The coil-stretch transition and the tumbling instability are characterized as a function…
In this paper, we study the fluctuations of sums of random variables with distribution defined as a mixture of light-tail and truncated heavy-tail distributions. We focus on the case when both the mixing coefficient and the truncation level…
In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…
We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…
We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…
In probability theory, there is a tendency to treat one random variable with a given distribution as being just as good as any other. By and large this is fine because probability is (mostly) concerned with distributional properties of…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
In many insurance contexts, dependence between risks of a portfolio may arise from their frequencies. We investigate a dependent risk model in which we assume the vector of count variables to be a tree-structured Markov random field with…
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…
In this paper we consider Markov chains with transition rates that depend on a small parameter $\varepsilon$. Under a mild assumption on the asymptotics of these transition rates, we describe the behavior of the chain at various…
We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]
We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…