Related papers: Stability and convergence of the string method for…

This paper deals with the large-scale behaviour of nonlinear minimum-cost flow problems on random graphs. In such problems, a random nonlinear cost functional is minimised among all flows (discrete vector-fields) with a prescribed net flux…

In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…

We give an algorithm that takes a directed graph $G$ undergoing $m$ edge insertions with lengths in $[1, W]$, and maintains $(1+\epsilon)$-approximate shortest path distances from a fixed source $s$ to all other vertices. The algorithm is…

In [Bonito et al., J. Comput. Phys. (2022)], a local discontinuous Galerkin method was proposed for approximating the large bending of prestrained plates, and in [Bonito et al., IMA J. Numer. Anal. (2023)] the numerical properties of this…

We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs…

A strategy for finding transition paths connecting two stable basins is presented. The starting point is the Hamilton principle of stationary action; we show how it can be transformed into a minimum principle through the addition of…

Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…

In the low-energy limit, string theory has two remarkable symmetries, O(d,d+p) and SL(2,R). We illustrate the use of these transformations as techniques to generate new solutions by applying them to the Taub--NUT metric.

In the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and…

We present a minimal model for the Universe evolution fully extracted from effective String Theory. By linking this model with a minimal but well established observational information, we prove that it gives realistic predictions on early…

Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…

The quantization of the transverse motion energy in the continuous potentials of atomic strings and planes can take place under passage of fast charged particles through crystals. The energy levels for electron moving in axial channeling…

We consider an initial and boundary value problem the one dimensional wave equation with damping concentrated at an interior point. We prove a result of a logarithmic decay of the energy of a system with homogeneous Dirichlet boundary…

We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset…

In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path. The path may be shortest route in practical life, either physical or electronic medium. The scenario is to represents…

In spirit of the principle of least action, which means that when a perturbation is applied to a physical system its reaction is such that it modifies its state to "agree" with the perturbation by "minimal" change of its initial state. In…

Transition states and minimum energy paths are essential to understand and predict chemical reactivity. Double-ended methods represent a standard approach for their determination. We introduce a new double-ended method that optimizes…

The weak law of large numbers implies that, under mild assumptions on the source, the Renyi entropy per produced symbol converges (in probability) towards the Shannon entropy rate. This paper quantifies the speed of this convergence for…

This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity…

We consider in this work the problem of minimizing the von Neumann entropy under the constraints that the density of particles, the current, and the kinetic energy of the system is fixed at each point of space. The unique minimizer is a…