Related papers: Normal forms of random braids
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
We consider a random link, which is defined as the closure of a braid obtained from a random walk on the braid group. For such a random link, the expected value for the number of components was calculated by Jiming Ma. In this paper, we…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
The projected normal distribution, also known as the angular Gaussian distribution, is obtained by dividing a multivariate normal random variable $\mathbf{x}$ by its norm $\sqrt{\mathbf{x}^T \mathbf{x}}$. The resulting random variable…
In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:…
The probability distribution for the free energy of directed polymers in random media (DPRM) with uncorrelated noise in $d=1+1$ dimensions satisfies the Tracy-Widom distribution. We inquire if and how this universal distribution is modified…
Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and…
Cauchy's formula was originally established for random straight paths crossing a body $B \subset \mathbb{R}^{n}$ and basically relates the average chord length through $B$ to the ratio between the volume and the surface of the body itself.…
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…
We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…
We study the limiting distribution of particles at the frontier of a branching random walk. The positions of these particles can be viewed as the lowest energies of a directed polymer in a random medium in the mean-field case. We show that…
We study the asymptotic behavior of the maximum interpoint distance of random points in a $d$-dimensional set with a unique diameter and a smooth boundary at the poles. Instead of investigating only a fixed number of $n$ points as $n$ tends…
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to…