Related papers: Union of Random Minkowski Sums and Network Vulnera…
Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…
We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines…
We consider the asymptotic behavior as $n\to\infty$ of the spectra of random matrices of the form \[\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)),\] where for each $n$ the random variables $Z_{nk}$ are i.i.d. standard Gaussian…
In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by…
Let us define, for a compact set $A \subset \mathbb{R}^n$, the Minkowski averages of $A$: $$ A(k) = \left\{\frac{a_1+\cdots +a_k}{k} : a_1, \ldots, a_k\in A\right\}=\frac{1}{k}\Big(\underset{k\ {\rm times}}{\underbrace{A + \cdots +…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…
The anti-concentration phenomenon in probability theory has been intensively studied in recent years, with applications across many areas of mathematics. In most existing works, the ambient probability space is a product space generated by…
The complexity of the algorithm Radix Selection is considered for independent data generated from a Markov source. The complexity is measured by the number of bucket operations required and studied as a stochastic process indexed by the…
We study the joint probability density of the eigenvalues of a product of rectangular real, complex or quaternion random matrices in a unified way. The random matrices are distributed according to arbitrary probability densities, whose only…
In the literature, the Minkowski-sum and the metric-sum of compact sets are highlighted. While the first is associative, the latter is not. But the major drawback of the Minkowski combination is that, by increasing the number of summands,…
We consider the family of convex bodies obtained from an origin symmetric convex body $K$ by multiplication with diagonal matrices, by forming Minkowski sums of the transformed sets, and by taking limits in the Hausdorff metric. Support…
The projector onto the Minkowski sum of closed convex sets is generally not equal to the sum of individual projectors. In this work, we provide a complete answer to the question of characterizing the instances where such an equality holds.…
Disordered hyperuniform many-particle systems are recently discovered exotic states of matter, characterized by a complete suppression of normalized infinite-wavelength density fluctuations and lack of conventional long-range order. Here,…
We consider the situation when a learner faces a set of unknown discrete distributions $(p_k)_{k\in \mathcal K}$ defined over a common alphabet $\mathcal X$, and can build for each distribution $p_k$ an individual high-probability…
There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{K_n},P_n)$ defined on a set $\mathcal{V}_n$…
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phenomena on complex networks. Using insights and analytical results from network science, we discuss how the structure of contacts affects the…
We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…
We study the expected number of zeros of $$P_n(z)=\sum_{k=0}^n\eta_kp_k(z),$$ where $\{\eta_k\}$ are complex-valued i.i.d standard Gaussian random variables, and $\{p_k(z)\}$ are polynomials orthogonal on the unit disk. When…