Related papers: Polarization and Greedy Energy on the Sphere
We study {\sc greedy} routing over $n$ nodes placed in a ring, with the \emph{distance} between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social…
In a recent article, Alishahi and Zamani discuss the spherical ensemble, a rotationally invariant determinantal point process on the 2-sphere. In this paper we extend this process in a natural way to the 2d-dimensional sphere. We prove that…
We study properties of the $\alpha$-Green kernel $g_D^\alpha$ of order $0<\alpha\leqslant2$ for a domain $D\subset\mathbb R^n$, $n\geqslant3$. This kernel is associated with the $\alpha$-Riesz kernel $|x-y|^{\alpha-n}$, $x,y\in\mathbb R^n$,…
A lot of recent activity in the theory of cluster algebras has been directed towards various constructions of "natural" bases in them. One of the approaches to this problem was developed several years ago by P.Sherman - A.Zelevinsky who…
Ranking and selection (R&S) aims to select the best alternative with the largest mean performance from a finite set of alternatives. Recently, considerable attention has turned towards the large-scale R&S problem which involves a large…
A fundamental open problem in learning theory is to characterize the best-case teaching dimension $\operatorname{TS}_{\min}$ of a concept class $\mathcal{C}$ with finite VC dimension $d$. Resolving this problem will, in particular, settle…
We investigate the asymptotic behavior, as $N$ grows, of the largest minimal pairwise distance of $N$ points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal…
We study probability measures that minimize the Riesz energy with respect to the geodesic distance $\vartheta (x,y)$ on projective spaces $\mathbb{FP}^d$ (such energies arise from the 1959 conjecture of Fejes T\'oth about sums of non-obtuse…
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for…
We extend some rate of convergence results of greedy quantization sequences already investigated in arXiv:1409.0732 [math.PR]. We show, for a more general class of distributions satisfying a certain control, that the quantization error of…
We combine hydrodynamic and modulated energy techniques to study the large deviations of systems of particles with pairwise singular repulsive interactions and additive noise. Specifically, we examine periodic Riesz interactions indexed by…
Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly…
In this paper we make a comparison between certain probabilistic and deterministic point sets and show that some deterministic constructions (spherical $t$-designs) are better or as good as probabilistic ones. We find asymptotic equalities…
We analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of…
We study the problem of $k$-center clustering with outliers in arbitrary metrics and Euclidean space. Though a number of methods have been developed in the past decades, it is still quite challenging to design quality guaranteed algorithm…
We consider Riesz-type nonlocal interaction energies over polygons. We prove the analog of the Riesz inequality in this discrete setting for triangles and quadrilaterals, and obtain that among all $N$-gons with fixed area, the nonlocal…
In a digraph $D$,a quasi-kernel is an independent set $Q$ such that for every vertex $u$, there is a vertex $v \in Q$ satisfying $\text{dist}(v,u)\leq 2$. In 1974 Chv\'atal and Lov\'asz showed every digraph contains a quasi-kernel. In 1976,…
Let $\Lambda$ be a lattice in ${\bf R}^d$ with positive co-volume. Among $\Lambda$-periodic $N$-point configurations, we consider the minimal renormalized Riesz $s$-energy $\mathcal{E}_{s,\Lambda}(N)$. While the dominant term in the…
The greedy spanner is a high-quality spanner: its total weight, edge count and maximal degree are asymptotically optimal and in practice significantly better than for any other spanner with reasonable construction time. Unfortunately, all…
The greedy algorithm adapted from Kruskal's algorithm is an efficient and folklore way to produce a $k$-spanner with girth at least $k+2$. The greedy algorithm has shown to be `existentially optimal', while it's not `universally optimal'…