Related papers: Length Distributions in Loop Soups
We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…
We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
Previously it has been shown that some classes of mixing dynamical systems have limiting return times distributions that are almost everywhere Poissonian. Here we study the behaviour of return times at periodic points and show that the…
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
We study the analogue of Poisson ensembles of Markov loops ('loop soups') in the setting of one-dimensional diffusions. We give a detailed description of the corresponding intensity measure. The properties of this measure on loops lead us…
Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…
It was demonstrated that the lattice simulation of $B$-meson light-cone distribution amplitude (LCDA) is feasible via the quasi-distribution amplitude (quasi-DA) in large momentum effective theory (LaMET). The structures of logarithmic…
Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered…
The existence and limits of metastable droplets have been calculated using finite-system renormalization-group theory, for q-state Potts models in spatial dimension d=3. The dependence of the droplet critical sizes on magnetic field,…
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the…
In this paper we introduce a new lifetime distribution by compounding exponential and Poisson-Lindley distributions, named exponential Poisson-Lindley distribution. Several properties are derived, such as density, failure rate, mean…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The random walk problem is studied in two and three dimensions in the presence of a random distribution of static traps. An efficient Monte Carlo method, based on a mapping onto a polymer model, is used to measure the survival probability…
It is well known that, in the Boltzmann-Grad limit, the distribution of the free path length in the Lorentz gas with disordered scatterer configuration has an exponential density. If, on the other hand, the scatterers are located at the…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
We study the statistics of level widths of a quantum dot with extended contacts in the absence of time-reversal symmetry. The widths are determined by the amplitude of the wavefunction averaged over the contact area. The distribution…
Learning joint probability distributions on n random variables requires exponential sample size in the generic case. Here we consider the case that a temporal (or causal) order of the variables is known and that the (unknown) graph of…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
The loop $O(n)$ model is a family of probability measures on collections of non-intersecting loops on the hexagonal lattice, parameterized by a loop-weight $n$ and an edge-weight $x$. Nienhuis predicts that, for $0 \leq n \leq 2$, the model…