Related papers: Random Young diagrams in a Rectangular Box

Upper exponential inequalities for the tail probabilities of the centered and normalized number of triangles in the Erd\"{o}s-R\'{e}nyi graph are obtained, where the probability of every edge is fixed. The result is formulated in terms of…

We consider the random deposition of objects of variable width and height over a line. The successive additions of these structures create a random interface. We focus on the regime of heavy tailed distributions of the structure width. When…

We study limit shapes in two equivalent models: the six-vertex model in the $c\to0$ limit and the random Mallows permutation with restricted permutation matrix. We give the Euler-Lagrange equation for the limit shape and show how to solve…

For each certain "nice" piecewise linear function $f:[0,1] \to [0,1]$, we consider a family of growing Young diagrams $\{\lambda(f,N)\}_{N=1}^{\infty}$ by enlarging the region under the graph of $f$. We compute asymptotic formulas for the…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

We characterize Riemannian orbifolds with an upper curvature bound in the Alexandrov sense as reflectofolds, i.e. Riemannian orbifolds all of whose local groups are generated by reflections, with the same upper bound on the sectional…

We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…

Characteristic structures such as canals and ridges --intermode traces-- emerge in the spacetime representation of the probability distribution of a particle in a one-dimensional box. We show that the corresponding propagator already…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

We study the fluctuations of eigenvalues from a class of Wigner random matrices that generalize the Gaussian orthogonal ensemble. We begin by considering an $n \times n$ matrix from the Gaussian orthogonal ensemble (GOE) or Gaussian…

The statistical mechanics of polymer loops entangled in the two-dimensional array of randomly distributed obstacles of infinite length is discussed. The area of the loop projected to the plane perpendicular to the obstacles is used as a…

We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…

In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…

We consider the extreme value statistics of correlated random variables that arise from a Langevin equation. Recently, it was shown that the extreme values of the Ornstein-Uhlenbeck process follow a different distribution than those…

We consider uniform random domino tilings of the restricted Aztec diamond which is obtained by cutting off an upper triangular part of the Aztec diamond by a horizontal line. The restriction line asymptotically touches the arctic circle…

The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…

Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random…