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

Let a word be a sequence of $n$ i.i.d. integer random variables. The perimeter $P$ of the word is the number of edges of the word, seen as a polyomino. In this paper, we present a probabilistic approach to the computation of the moments of…

$\newcommand{\eps}{\varepsilon}$ In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path…

We prove that if $p\geq 1$ and $-1\leq r\leq p-1$ then the binomial sequence $\binom{np+r}{n}$, $n=0,1,...$, is positive definite and is the moment sequence of a probability measure $\nu(p,r)$, whose support is contained in…

Let $(X_1,X_2,...)$ be a random partition of the unit interval $[0,1]$, i.e. $X_i\geq0$ and $\sum_{i\geq1} X_i=1$, and let $(\varepsilon_1,\varepsilon_2,...)$ be i.i.d. Bernoulli random variables of parameter $p \in (0,1)$. The Bernoulli…

The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result…

The polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. The class includes the uniform and trapezoidal distributions, and is an alternative to the beta…

Let $h$ be a fixed non-zero integer. For every $t\in \mathbb{R}_+$ and every prime $p$, consider the angles between rays from an observer located at the point $(-tJ_p^2,0)$ on the real axis towards the set of all integral solutions $(x,y)$…

Let $M(n, k, p)$ denote the maximum probability of the event $X_1 = X_2 = \cdots = X_n=1$ under a $k$-wise independent distribution whose marginals are Bernoulli random variables with mean $p$. A long-standing question is to calculate $M(n,…

We study asymptotic properties of the following Markov system of $N \geq 3$ points in~$[0,1]$. At each time step, the point farthest from the current centre of mass, multiplied by a constant $p>0$, is removed and replaced by an independent…

Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

On the square lattice raindrops fall on an edge with midpoint $x$ at rate $\|x\|_\infty^{-\alpha}$. The edge becomes open when the first drop falls on it. Let $\rho(x,t)$ be the probability that the edge with midpoint $x=(x_1,x_2)$ is open…

Given $p \in (0,1)$, we let $Q_p= Q_p^d$ be the random subgraph of the $d$-dimensional hypercube $Q^d$ where edges are present independently with probability $p$. It is well known that, as $d \rightarrow \infty$, if $p>\frac12$ then with…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

It is shown that there is a constant A and a density one subset S of the positive integers, such that for all q in S there is some 1<=p<q, (p, q)=1, so that p/q has all its partial quotients bounded by A.

Counting permutations of $[n]$ by the number of records, i.e. left-to-right maxima, is a classic problem in combinatorial enumeration. In the first volume of ``The Art of Computer Programming", Donald Knuth demonstrated its relevance for…

We consider $p$-orientations, which are defined to be orientations of $d$-regular graphs such that every vertex either has in-degree $p$ or out-degree $p$. These generalise the orientations considered in Jaeger's conjecture, where $d=4p+1$.…

Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…

We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as \emph{online sprinkling}. As an illustrative application of this method, we show that for any fixed integer $k\geq 3$, the binomial…

In this paper we propose a new generation of probability laws based on the generalized Beta prime distribution to estimate the relative accuracy between two Lagrange finite elements $P_{k_1}$ and $P_{k_2}, (k_1<k_2)$. Since the relative…