Related papers: Universal limits of substitution-closed permutatio…
Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…
We recently introduced a new universal family of permutons, depending on two parameters, called skew Brownian permuton. For some specific choices of the parameters, the skew Brownian permuton coincides with some previously studied…
We consider a singularly perturbed semilinear boundary value problem of a general form that allows various types of turning points. A solution decomposition is derived that separates the potential exponential boundary layer terms. The…
A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…
This paper describes the quality of convergence to an infinitely divisible law relative to free multiplicative convolution. We show that convergence in distribution for products of identically distributed and infinitesimal free random…
The problem of neutral fermions subject to an inversely linear potential is revisited. It is shown that an infinite set of bound-state solutions can be found on the condition that the fermion is embedded in an additional uniform background…
In a classic paper Schr\"oder posed four combinatorial problems about the number of certain types of bracketings of words and sets. Here we address what these bracketings look like on average. For each of the four problems we prove that a…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…
Motivated by the work of Lov\'asz and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. Based on separable real trees,…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
We prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
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…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
Scaling limits of critical percolation models show major differences between low and high dimensional models. The article discusses the formulation of the continuum limit for the former case. A mathematical framework is proposed for the…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…