Related papers: Polarization and Greedy Energy on the Sphere
In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit. This is done…
In this paper we introduce a model for hard spheres interacting through attractive Riesz type potentials, and we study its thermodynamic limit. We show that the tail energy enforces optimal packing and round macroscopic shapes.
We consider the problem of finding an $N$-point configuration on the sphere $S^d\subset \RR^{d+1}$ with the smallest absolute maximum value over $S^d$ of its total potential. The potential induced by each point ${\bf y}$ in a given…
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
We consider parallel, or low adaptivity, algorithms for submodular function maximization. This line of work was recently initiated by Balkanski and Singer and has already led to several interesting results on the cardinality constraint and…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
We investigate the large time behavior of $N$ particles restricted to a smooth closed curve in $\mathbb{R}^d$ and subject to a gradient flow with respect to Euclidean hyper-singular repulsive Riesz $s$-energy with $s>1.$ We show that…
We prove a large deviation principle for a greedy exploration process on an Erd\"os-R\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes…
In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of…
Given a graph $G=(V,E)$, suppose we are interested in selecting a sequence of vertices $(x_j)_{j=1}^n$ such that $\left\{x_1, \dots, x_k\right\}$ is `well-distributed' uniformly in $k$. We describe a greedy algorithm motivated by potential…
We prove a conjecture of Ambrus, Ball and Erd\'{e}lyi that equally spaced points maximize the minimum of discrete potentials on the unit circle whenever the potential is of the form \sum_{k=1}^n f(d(z,z_k)), where $f:[0,\pi]\to [0,\infty]$…
We study sublinear time algorithms for estimating the size of maximum matching in graphs. Our main result is a $(\frac{1}{2}+\Omega(1))$-approximation algorithm which can be implemented in $O(n^{1+\epsilon})$ time, where $n$ is the number…
Kernel-based methods provide flexible and accurate algorithms for the reconstruction of functions from meshless samples. A major question in the use of such methods is the influence of the samples locations on the behavior of the…
For a positively charged insulated d-dimensional sphere we investigate how the distribution of this charge is affected by proximity to a nearby positive or negative point charge when the system is governed by a Riesz s-potential 1/r^s, s>0,…
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
For a compact set A in Euclidean space we consider the asymptotic behavior of optimal (and near optimal) N-point configurations that minimize the Riesz s-energy (corresponding to the potential 1/t^s) over all N-point subsets of A, where…
We derive the complete asymptotic expansion in terms of powers of $N$ for the Riesz $s$-energy of $N$ equally spaced points on the unit circle as $N\to \infty$. For $s\ge -2$, such points form optimal energy $N$-point configurations with…
We consider the mean-field limit of systems of particles with singular interactions of the type $-\log|x|$ or $|x|^{-s}$, with $0< s<d-2$, and with an additive noise in dimensions $d \geq 3$. We use a modulated-energy approach to prove a…
In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and successful approach. We define the class of "degree sensitive"…
The purpose of this article is to examine the greedy adaptive measurement policy in the context of a linear Guassian measurement model with an optimization criterion based on information gain. In the special case of sequential scalar…