相关论文: Greedy energy points with external fields

For a symmetric kernel $k:X\times X \to \mathbb{R}\cup\{+\infty\}$ on a locally compact Hausdorff space $X$, we investigate the asymptotic behavior of greedy $k$-energy points $\{a_{i}\}_{1}^{\infty}$ for a compact subset $A\subset X$ that…

This paper establishes a connection between a problem in Potential Theory and Mathematical Physics, arranging points so as to minimize an energy functional, and a problem in Combinatorics and Number Theory, constructing 'well-distributed'…

For a parameter $\lambda>0$, we investigate greedy $\lambda$-energy sequences $(a_{n})_{n=0}^{\infty}$ on the unit sphere $S^{d}\subset\mathbb{R}^{d+1}$, $d\geq 1$, satisfying the defining property that each $a_{n}$, $n\geq 1$, is a point…

The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent…

For the Riesz and logarithmic energies, we consider a greedy sequence $(a_n)_{n=0}^\infty$ of points on the unit circle $S^1$ constructed in such a way that for every integer $N\geq 2$, the energy of the configuration…

In this work we investigate greedy energy sequences on the unit circle for the logarithmic and Riesz potentials. By definition, if $(a_n)_{n=0}^{\infty}$ is a greedy $s$-energy sequence on the unit circle, the Riesz potential…

For the Riesz and logarithmic potentials, we consider greedy energy sequences $(a_n)_{n=0}^\infty$ on the unit circle $S^1$, constructed in such a way that for every $n\geq 1$, the discrete potential generated by the first $n$ points…

$\newcommand{\eps}{\varepsilon}$ In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path…

An increasing sequence $(x_i)_{i=1}^n$ of positive integers is an $n$-term Egyptian underapproximation of $\theta \in (0,1]$ if $\sum_{i=1}^n \frac{1}{x_i} < \theta$. A greedy algorithm constructs an $n$-term underapproximation of $\theta$.…

There are many ways to upsample functions from multivariate scattered data locally, using only a few neighbouring data points of the evaluation point. The position and number of the actually used data points is not trivial, and many cases…

We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…

We study the problem of identifying the causal relationship between two discrete random variables from observational data. We recently proposed a novel framework called entropic causality that works in a very general functional model but…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…

In this paper we investigate the asymptotic behavior of the Riesz $s$-energy of the first $N$ points of a greedy $s$-energy sequence on the unit circle, for all values of $s$ in the range $0\leq s<\infty$ (identifying as usual the case…

Results on two different settings of asymptotic behavior of approximation characteristics of individual functions are presented. First, we discuss the following classical question for sparse approximation. Is it true that for any individual…

Inverse imaging problems rely on limited and indirect measurements, making reconstruction highly dependent on both regularization and sample locations. We introduce a novel greedy framework for the optimal selection of indirect measurements…

Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a…

In this paper, we consider a subset selection problem in a spatial field where we seek to find a set of k locations whose observations provide the best estimate of the field value at a finite set of prediction locations. The measurements…

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…

For certain dynamical systems it is possible to significantly simplify the study of stability by means of the center manifold theory. This theory allows to isolate the complicated asymptotic behavior of the system close to a non-hyperbolic…