Related papers: Stability and convergence of the string method for…
The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close enough" to the constrained minimum value. These notions can…
This paper discusses the shortest path problem in a general directed graph with $n$ nodes and $K$ cost scenarios (objectives). In order to choose a solution, the min-max criterion is applied. The min-max version of the problem is hard to…
In this paper, we study the entanglement entropy in string theory in the simplest setup of dividing the nine dimensional space into two halves. This corresponds to the leading quantum correction to the horizon entropy in string theory on…
We investigate a Poisson-Nernst-Planck type system in three spatial dimensions where the strength of the electric drift depends on a possibly small parameter and the particles are assumed to diffuse quadratically. On grounds of the global…
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different cost per unit of energy. Traversing a given road segment…
We review our work on the minimal length uncertainty relation as suggested by perturbative string theory. We discuss simple phenomenological implications of the minimal length uncertainty relation and then argue that the combination of the…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
Using the method developed by Callan and Thorlacius, we study the low energy effective geometry on a two-dimensional string lattice by examining the energy-momentum relations of the low energy propagation modes on the lattice. We show that…
The parametric shortest path problem is to find the shortest paths in graph where the edge costs are of the form w_ij+lambda where each w_ij is constant and lambda is a parameter that varies. The problem is to find shortest path trees for…
The volumetric stretch energy has been widely applied to the computation of volume-/mass-preserving parameterizations of simply connected tetrahedral mesh models. However, this approach still lacks theoretical support. In this paper, we…
In this paper, we investigate energy-minimizing curves with fixed endpoints $p$ and $q$ in a constrained space. We prove that when one of the endpoints, say $p$, is fixed, the set of points $q$ for which the energy-minimizing curve is not…
Algorithms for convex feasibility find or approximate a point in the intersection of given closed convex sets. Typically there are only finitely many convex sets, but the case of infinitely many convex sets also has some applications. In…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
We study numerically the minimum energy path and energy barriers for dislocation nucleation in a two-dimensional atomistic model of strained epitaxial layers on a substrate with lattice misfit. Stress relaxation processes from coherent to…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cache-efficient, but only on static road networks. We show how to augment it to the time-dependent…
Quantum field theory of a damped vibrating string as the simplest dissipative scalar field investigated by its coupling with an infinit number of Klein-Gordon fields as the environment by introducing a minimal coupling method. Heisenberg…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large…
In this paper we study the asymptotic behavior of minimal energy solutions to the Lane-Emden system $-\Delta u = v^p$ and $-\Delta v = u^q$ on bounded domains as the index $(p,q)$ approaches to the critical hyperbola from below. Precisely,…