Related papers: Extremal random beta polytopes

The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.

The random beta-transformation K is isomorphic to a full shift. This relation gives an invariant measure for K that yields the Bernoulli convolution by projection. We study the local dimension of the invariant measure for K for special…

Schreiber and Yukich [Ann. Probab. 36 (2008) 363-396] establish an asymptotic representation for random convex polytope geometry in the unit ball $\mathbb{B}^d, d\geq2$, in terms of the general theory of stabilizing functionals of Poisson…

We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…

We consider an extended version of Horn's problem: given two orbits $\mathcal{O}_\alpha$ and $\mathcal{O}_\beta$ of a linear representation of a compact Lie group, let $A\in \mathcal{O}_\alpha$, $B\in \mathcal{O}_\beta$ be independent and…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull…

Let C = C(l_1, ..., l_n) be the n-dimensional orthogonal cross-polytope whose axes are of length l_1,..., l_n. Subject to the condition \sum l_i^2 = 1, the mean width of C is minimised when l_i = 1/sqrt{n} for every i, and it is maximised…

In this paper we consider elliptical random vectors X in R^d,d>1 with stochastic representation A R U where R is a positive random radius independent of the random vector U which is uniformly distributed on the unit sphere of R^d and A is a…

We give asymptotic large deviations estimates for the volume inside a domain U of the zero set of a random polynomial of degree N, or more generally, of a holomorphic section of the N-th power of a positive line bundle on a compact Kaehler…

The intrinsic volumes of a convex body are fundamental invariants that capture information about the average volume of the projection of the convex body onto a random subspace of fixed dimension. The intrinsic volumes also play a central…

We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…

Given a real number beta > 1, the spectrum of beta is a well studied dynamical object. In this article we show the existence of a certain measure on the spectrum of beta related to the distribution of random polynomials in beta, and discuss…

Consider the task of generating samples from a tilted distribution of a random vector whose underlying distribution is unknown, but samples from it are available. This finds applications in fields such as finance and climate science, and in…

We consider two models of random cones together with their duals. Let $Y_1,\dots,Y_n$ be independent and identically distributed random vectors in $\mathbb R^d$ whose distribution satisfies some mild condition. The random cones $G_{n,d}^A$…

The concept of typical and weighted typical spherical faces for tessellations of the $d$-dimensional unit sphere, generated by $n$ independent random great hyperspheres distributed according to a non-degenerate directional distribution, is…

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…

The asymptotic volume of the polytope of symmetric stochastic matrices can be determined by asymptotic enumeration techniques as in the case of the Birkhoff polytope. These methods can be extended to polytopes of symmetric stochastic…

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…