相关论文: Stability and convergence of the string method for…
We study curves of marginal stability (CMS) in five-dimensional N=1 E_N theories compactified on a circle using the D3-brane probe realization. In this realization, BPS states correspond to string webs in the affine E_N 7-brane background…
What is the shortest path between two data points lying in a high-dimensional space? While the answer is trivial in Euclidean geometry, it becomes significantly more complex when the data lies on a curved manifold -- requiring a Riemannian…
We consider, in a string theory framework, physical processes of phenomenological interest in models with a low string scale. The amplitudes we study involve tree-level virtual gravitational exchange, divergent in a field-theoretical…
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach…
We obtain systematic approximations for the modes of vibration of a string of variable density, which is held fixed at its ends. These approximations are obtained iteratively applying three theorems which are proved in the paper and which…
We present a modified version of the nudged elastic band (NEB) algorithm to find minimum energy paths con-necting two known configurations. We show that replacing the harmonic band-energy term with a discretized version of the…
We consider a sparse Erd\H{o}s--R\'{e}nyi graph $\mathcal{G}(n,\lambda/n)$ where each edge is independently assigned a random signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and…
How systems transit between different stable states under external perturbation is an important practical issue. We discuss here how a recently-developed energy optimization method for identifying the minimal disturbance necessary to reach…
Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…
We developed a source detection algorithm based on the Minimal Spanning Tree (MST), that is a graph-theoretical method useful for finding clusters in a given set of points. This algorithm is applied to gamma-ray bidimensional images where…
Many models of physics beyond the Standard Model predict minicharged particles to which current and near future low-energy experiments are highly sensitive. Such minicharges arise generically from kinetic-mixing in theories containing at…
We present concrete solutions with accelerated expansion in string theory, requiring a small, tractable list of stress energy sources. We explain how this construction (and others in progress) evades previous no go theorems for simple…
The paper addresses the problem of distributed filtering with guaranteed convergence properties using minimum-energy filtering and $H_\infty$ filtering methodologies. A linear state space plant model is considered observed by a network of…
We consider the approximation of minimal geodesics between two closed sets in $\mathbb{R}^D$ endowed with a smooth Riemannian metric. The continuous problem is formulated as the minimization of the energy functional over piecewise smooth…
This paper considers the \textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\log \log \log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this…
Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f\) and let~\(K_n\) be the complete graph formed by joining each pair of nodes by a straight line…
Energy-efficient machine learning models that can run directly on edge devices are of great interest in IoT applications, as they can reduce network pressure and response latency, and improve privacy. An effective way to obtain…
Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$ and $t$ inside $P$ have been well studied. Both these kinds of paths are simple…
We propose the reliability constrained k-rooted minimum spanning forest, a relevant optimization problem whose aim is to find a k-rooted minimum cost forest that connects given customers to a number of supply vertices, in such a way that a…
Efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line…