Related papers: Convex hulls of several multidimensional Gaussian …

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

The intrinsic volumes of Gaussian polytopes are considered. A lower variance bound for these quantities is proved, showing that, under suitable normalization, the variances converge to strictly positive limits. The implications of this…

We show that the expected value of the mean width of a random polytope generated by $N$ random vectors ($n\leq N\leq e^{\sqrt n}$) uniformly distributed in an isotropic convex body in $\R^n$ is of the order $\sqrt{\log N} L_K$. This…

Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.

We consider the sequence of independent centered Gaussian random elements of a separable Banach space and their consecutive closed convex hulls. If inicial elements converge weakly to some limite, then, as shown in Davydov- Paulauskas…

This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…

We recall fundamental aspects of the pluriclosed flow equation and survey various existence and convergence results, and the various analytic techniques used to establish them. Building on this, we formulate a precise conjectural…

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…

We prove the four-dimensional Gaussian random vector maximum conjecture. This conjecture asserts that among all centered Gaussian random vectors $X=(X_1,X_2,X_3,X_4)$ with $E[X_i^2]=1$, $1\le i\le 4$, the expectation…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

We compute the exponential decay of the probability that a given multi-dimensional random walk stays in a convex cone up to time $n$, as $n$ goes to infinity. We show that the latter equals the minimum, on the dual cone, of the Laplace…

The paper deals with multivariate Gaussian random fields defined over generalized product spaces that involve the hypertorus. The assumption of Gaussianity implies the finite dimensional distributions to be completely specified by the…

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

The beta polytope $P_{n,d}^\beta$ is the convex hull of $n$ i.i.d. random points distributed in the unit ball of $\mathbb{R}^d$ according to a density proportional to $(1-\lVert{x}\rVert^2)^{\beta}$ if $\beta>-1$ (in particular, $\beta=0$…

We show bounds on tail probabilities for quadratic forms in sub-gaussian non-necessarily independent random variables. Our main tool will be estimates of the Luxemburg norms of such forms. This will allow us to formulate the above-mentioned…

In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…