Related papers: Block size in Geometric(p)-biased permutations

Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq…

We study the diffusion process in the presence of stochastic resetting inside a two-dimensional wedge of top angle $\alpha$, bounded by two infinite absorbing edges. In the absence of resetting, the second moment of the first-passage time…

We consider the asymmetric simple exclusion process (ASEP) on the integers in which the initial density at a site (the probability that it is occupied) is given by a periodic function on the positive integers. (When the function is constant…

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

A disordered solid, such as an athermal jammed packing of soft spheres, exists in a rugged potential-energy landscape in which there are a myriad of stable configurations that defy easy enumeration and characterization. Nevertheless, in…

Let $p$ be a prime and let $K$ be a finite extension of the field ${\bf Q}_p$ of $p$-adic numbers such that the group ${}_pK^\times$ has order $p$. The ${\bf F}_p$-space $K^\times\!/K^{\times p}$ carries a natural filtration coming from the…

We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an…

Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…

In this paper we consider the problem of embedding almost-spanning, bounded degree graphs in a random graph. In particular, let $\Delta\geq 5$, $\varepsilon > 0$ and let $H$ be a graph on $(1-\varepsilon)n$ vertices and with maximum degree…

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…

It is well known that, under some assumptions, the limit distribution of random block matrices and their partial transposition converges to the distributions of random variables in some noncommutative probability space. Using free…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

For $a \neq 1$ and $p$ prime, we define numbers of the form $pa^2$ to be Square-Prime (SP) Numbers. For example, 75 = 3 $\cdot$ 25; 108 = 3 $\cdot$ 36; 45 = 5 $\cdot$ 9. These numbers are listed in the OEIS as A228056. We study the…

For stationary KPZ growth in 1+1 dimensions the height fluctuations are governed by the Baik-Rains distribution. Using the totally asymmetric single step growth model, alias TASEP, we investigate height fluctuations for a general class of…

We introduce the theater model, which is the simplest variant of directed random sequential adsorption in one dimension with point source and steric interactions. Particles enter sequentially an initially empty row of $L$ sites and adsorb…

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

The current/height fluctuation statistics of Kardar-Parisi-Zhang (KPZ) universality in 1+1 dimensions are sensitive to the initial state. We find that the averages over the initial states exhibit universal and scale-invariant patterns when…

Extended geometric distribution is defined and its mixture is characterized by the property of having completely monotone probability sequence. Also, convolution equations and probability generating functions are used to characterize…

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…

We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no…