相关论文: Independence of permutation limits at infinitely m…

A novel way of defining limits in classical statistics is proposed. This is a natural extension of the original Neyman's method, and has the desirable property that only information relevant to the problem is used in making statistical…

We look at geometric limits of large random non-uniform permutations. We mainly consider two theories for limits of permutations: permuton limits, introduced by Hoppen, Kohayakawa, Moreira, Rath, and Sampaio to define a notion of scaling…

We show global uniqueness of the solution to a class of constrained variational problems, using scaling properties. This is used to establish the essential uniqueness of solutions of a large deviations problem in multiple dimensions. The…

Diversities have recently been developed as multiway metrics admitting clear and useful notions of hyperconvexity and tight span. In this note we consider the analytic properties of diversities, in particular the generalizations of uniform…

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…

Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in…

It is known that limit theorems for triangular arrays with identically distributed rows yields convergence of densities rather than just convergence in distribution. We show that this superconvergence result holds -- at least at points at…

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…

Consider a sequence of polynomials of bounded degree evaluated in independent Gaussian, Gamma or Beta random variables. We show that, if this sequence converges in law to a nonconstant distribution, then (i) the limit distribution is…

In this note we prove a large deviation bound on the sum of random variables with the following dependency structure: there is a dependency graph $G$ with a bounded chromatic number, in which each vertex represents a random variable.…

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…

We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…

We consider a random interval splitting process, in which the splitting rule depends on the empirical distribution of interval lengths. We show that this empirical distribution converges to a limit almost surely as the number of intervals…

We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…