On random convex chains, orthogonal polynomials, PF sequences and probabilistic limit theorems

preprint2020arXivOpen access

Abstract

Let TT be the triangle in the plane with vertices (0,0)(0,0), (0,1)(0,1) and (0,1)(0,1). The convex hull of (0,1)(0,1), (1,0)(1,0) and nn independent random points uniformly distributed in TT is the random convex chain TnT_n. A three-term recursion for the probability generating function GnG_n of the number f0(Tn)f_0(T_n) of vertices of TnT_n is proved. Via the link to orthogonal polynomials it is shown that GnG_n has precisely nn distinct real roots in (−∞,0](-\infty,0] and that the sequence pk(n):=P(f0(Tn)=k)p_k^{(n)}:=\mathbb{P}(f_0(T_n)=k), k=1,…,nk=1,\ldots,n, is a Polya frequency (PF) sequence. A selection of probabilistic consequences of this surprising and remarkable fact are discussed in detail.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.