Related papers: Monotone Subsequences in Locally Uniform Random Pe…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…
A permutation is \it separable \rm if it can be obtained from the singleton permutation by iterating direct sums and skew sums. Equivalently, it is separable if and only it avoids the patterns 2413 and 3142. Under the uniform probability on…
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…
Vershik and Kerov gave asymptotical bounds for the maximal and the typical dimensions of irreducible representations of symmetric groups $S_n$. It was conjectured by G. Olshanski that the maximal and the typical dimensions of the isotypic…
In this paper, we establish a local limit theorem for linear fields of random variables constructed from independent and identically distributed innovations each with finite second moment. When the coefficients are absolutely summable we do…
Let ${\varPi}_n$ be the set of convex polygonal lines $\varGamma$ with vertices on $\mathbb {Z}_+^2$ and fixed endpoints $0=(0,0)$ and $n=(n_1,n_2)$. We are concerned with the limit shape, as $n\to\infty$, of "typical" $\varGamma\in…
We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…
We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting…
We consider the random lasing from a weakly scattering medium and demonstrate that the distribution of the threshold gain over the ensemble of statistically independent finite-size samples is universal. Universality stems from the facts…
We consider an $N$-soliton solution of the focusing nonlinear Schr\"{o}dinger equations. We give conditions for the synchronous collision of these $N$ solitons. When the solitons velocities are well separated and the solitons have equal…
We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to infinity is the Poisson(1) branching process conditioned to survive forever. An extension to "almost"…
We find a new monotone increasing quantity along smooth solutions to the inverse mean curvature flow in $\mathbb R^n$. As an application, we derive a sharp geometric inequality for mean convex, star-shaped hypersurfaces which relates the…
Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…
We consider random genus-0 hyperbolic surfaces $\mathcal{S}_n$ with $n + 1$ punctures, sampled according to the Weil-Petersson measure. We show that, after rescaling the metric by $n^{-1/4}$, the surface $\mathcal{S}_n$ converges in…
We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely forcible. Every permuton can be associated with a graphon…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
The minimal surfaces meeting in triples with equal angles along a common boundary naturally arise from soap films and other physical phenomenon. They are also the natural extension of the usual minimal surface. In this paper, we consider…
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…