Related papers: On the geometry of random polytopes

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…

Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…

Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…

Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the…

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Let $S$ be the multiplicative semigroup of $q\times q$ matrices with positive entries such that every row and every column contains a strictly positive element. Denote by $(X_n)_{n\geq1}$ a sequence of independent identically distributed…

For a family X of k-subsets of the set 1,...,n, let |X| be the cardinality of X and let Gamma(X,mu) be the expected maximum weight of a subset from X when the weights of 1,...,n are chosen independently at random from a symmetric…

Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…

Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n} (i.e., the number of one-dimensional faces of P_{d,n}…

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its expectation by at least \lambda \var(X)^{1/2} is at most…