English
Related papers

Related papers: Monotone Subsequences in Locally Uniform Random Pe…

200 papers

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

Probability · Mathematics 2012-10-26 Shankar Bhamidi , Remco van der Hofstad , Gerard Hooghiemstra

Let I_1,...,I_n be independent but not necessarily identically distributed Bernoulli random variables, and let X_n=\sum_{j=1}^nI_j. For \nu in a bounded region, a local central limit theorem expansion of P(X_n=EX_n+\nu) is developed to any…

Statistics Theory · Mathematics 2007-06-13 Richard Arratia , Larry Goldstein , Bryan Langholz

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…

Combinatorics · Mathematics 2015-06-03 József Balogh , Ping Hu , Bernard Lidický , Oleg Pikhurko , Balázs Udvari , Jan Volec

We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…

Combinatorics · Mathematics 2024-08-13 David Bevan , Dan Threlfall

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Probability · Mathematics 2021-12-22 Jacopo Borga

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

Combinatorics · Mathematics 2007-05-23 Jinho Baik , Percy Deift , Kurt Johansson

We study wave maps with values in S^d, defined on the future light cone {|x| <= t}, with prescribed data at the boundary {|x| = t}. Based on the work of Keel and Tao, we prove that the problem is well-posed for locally absolutely continuous…

Analysis of PDEs · Mathematics 2022-06-29 Zdzisław Brzeźniak , Jacek Jendrej

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

Combinatorics · Mathematics 2026-03-12 Torben Donzelmann , Martina Juhnke , Benedikt Rednoß , Christoph Thäle

We have computed the spectral number variances of an extended random matrix ensemble predicted by Guhr's supersymmetry formula, showing a non-monotone increase of the curves that arises from an "overshoot" of the two-level correlation…

Condensed Matter · Physics 2007-05-23 Hiroshi Hasegawa , Baowen Li , Jian-Zhong Ma , Bambi Hu

Given a sequence of $s$-uniform hypergraphs $\{H_n\}_{n \geq 1}$, denote by $T_p(H_n)$ the number of edges in the random induced hypergraph obtained by including every vertex in $H_n$ independently with probability $p \in (0, 1)$. Recent…

Probability · Mathematics 2019-04-02 Somabha Mukherjee , Bhaswar B. Bhattacharya

We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…

Probability · Mathematics 2013-01-23 Omer Angel , Nicolas Curien

We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…

Combinatorics · Mathematics 2018-01-10 Joshua Cooper

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

In this paper, we shall try to deduce asymptotic behaviour of component spectrum of random $n \times n$ magical squares with line sum $r \in \mathbb{N}$, which can also be identified as $r$-regular bipartite graphs on $2n$ vertices, chosen…

Probability · Mathematics 2024-10-15 Souvik Ray

We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…

Combinatorics · Mathematics 2019-10-10 Mohamed Slim Kammoun , Mylène Maïda

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Combinatorics · Mathematics 2007-05-23 Sergey Avgustinovich , Sergey Kitaev

We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…

Probability · Mathematics 2009-02-23 Kevin Fleming , Nicholas Pippenger

We give conditions under which nonuniformly expanding maps exhibit lower bounds of polynomial type for the decay of correlations and for a large class of observables. We show that if the Lasota-Yorke type inequality for the transfer…

Dynamical Systems · Mathematics 2017-09-28 Huyi Hu , Sandro Vaienti

The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…

Combinatorics · Mathematics 2024-06-21 Folkmar Bornemann

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

Probability · Mathematics 2023-12-19 Paul Thévenin , Stephan Wagner