English
Related papers

Related papers: Monotone Subsequences in Locally Uniform Random Pe…

200 papers

Continuous-time Mallows processes are processes of random permutations of the set $\{1, \ldots, n\}$ whose marginal at time $t$ is the Mallows distribution with parameter $t$. Recently Corsini showed that there exists a unique Markov…

Probability · Mathematics 2024-04-15 Radosław Adamczak , Michał Kotowski

We prove asymptotic 0-1 Laws satisfied by diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane, and the upper boundary is called the shape. For various types, we show that, as the…

Number Theory · Mathematics 2020-11-10 Walter Bridges

Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…

Combinatorics · Mathematics 2019-04-05 Miklos Bona , Rebecca Smith

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

Differential Geometry · Mathematics 2017-05-17 Bram Petri

In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…

Combinatorics · Mathematics 2026-03-05 Maurício Collares , Joseph Doolittle , Joshua Erde

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

Probability · Mathematics 2022-09-07 Remco van der Hofstad , Pim van der Hoorn , Neeladri Maitra

A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…

Probability · Mathematics 2021-12-22 Jacopo Borga , Enrica Duchi , Erik Slivken

Consider the random quadratic form $T_n=\sum_{1 \leq u < v \leq n} a_{uv} X_u X_v$, where $((a_{uv}))_{1 \leq u, v \leq n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal, and $X_1,$ $X_2, \ldots, X_n$ are i.i.d.…

Probability · Mathematics 2019-12-30 Bhaswar B. Bhattacharya , Somabha Mukherjee , Sumit Mukherjee

We propose and experimentally test a method to fabricate patterns of steep, sharp features on surfaces, by exploiting the nonlinear dynamics of uniformly ion bombarded surfaces. We show via theory, simulation, and experiment, that the…

Materials Science · Physics 2017-02-08 Joy C. Perkinson , Michael J. Aziz , Michael P. Brenner , Miranda Holmes-Cerfon

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…

Probability · Mathematics 2025-09-16 Jérémie Bettinelli , Grégory Miermont

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…

Information Theory · Computer Science 2020-01-22 Farhad Shirani , Siddharth Garg , Elza Erkip

We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…

Probability · Mathematics 2023-06-22 Omer Angel , Alexander E. Holroyd , Tom Hutchcroft , Avi Levy

In this paper we consider uniformly random lozenge tilings of arbitrary domains approximating (after suitable normalization) a closed, simply-connected subset of $\mathbb{R}^2$ with piecewise smooth, simple boundary. We show that the local…

Probability · Mathematics 2023-10-02 Amol Aggarwal

Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the ``ordered'' and ``chaotic'' distribution of such pairs by solving the eigenvalue…

chao-dyn · Physics 2015-06-24 Antonio Bonelli , Stefano Ruffo

We construct a new family of random permutons, called skew Brownian permuton, which describes the limits of several models of random constrained permutations. This family is parametrized by two real parameters. For a specific choice of the…

Probability · Mathematics 2025-09-10 Jacopo Borga

We introduce a large class of random Young diagrams which can be regarded as a natural one-parameter deformation of some classical Young diagram ensembles; a deformation which is related to Jack polynomials and Jack characters. We show that…

Probability · Mathematics 2022-12-12 Maciej Dołęga , Piotr Śniady

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

Probability · Mathematics 2017-08-23 Nguyen Tuan Minh , Stanislav Volkov

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…

Probability · Mathematics 2014-06-17 Nicholas F. Travers

We consider a sequence of random variables $(R_n)$ defined by the recurrence $R_n=Q_n+M_nR_{n-1}$, $n\ge1$, where $R_0$ is arbitrary and $(Q_n,M_n)$, $n\ge1$, are i.i.d. copies of a two-dimensional random vector $(Q,M)$, and $(Q_n,M_n)$ is…

Statistics Theory · Mathematics 2011-07-15 Paweł Hitczenko , Jacek Wesołowski