Related papers: Geometry of Permutation Limits

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph structure and not on its weights or the results of prior steps. Each step examines one edge of the…

The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

We study learning of probability distributions characterized by an unknown symmetry direction. Based on an entropic performance measure and the variational method of statistical mechanics we develop exact upper and lower bounds on the…

This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…

We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…

In the paper, we study fluctuations over several ensembles of maximum-entropy random networks. We derive several fluctuation-dissipation relations characterizing susceptibilities of different networks to changes in external fields. In the…

The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of…

We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…

This article gives a new proof that fully connected neural networks with random weights and biases converge to Gaussian processes in the regime where the input dimension, output dimension, and depth are kept fixed, while the hidden layer…

We study first passage percolation on the configuration model (CM) having power-law degrees with exponent $\tau\in [1,2)$. To this end we equip the edges with exponential weights. We derive the distributional limit of the minimal weight of…

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…

We introduce a class of absorption mechanisms and study the behavior of real-valued centered random walks with finite variance that do not get absorbed. In particular, we prove persistence and scaling limit results, which, in many cases of…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$ and to study the asymptotic behaviour as $n\to\infty$. We obtain very precise information on the joint distribution of…