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

We study the small vibrations of an axially travelling string with a dashpoint damping at one end. The string is modelled by a wave equation in a time-dependent interval with two endpoints moving at a constant speed $v$. For the undamped…

We introduce a spectral embedding algorithm for finding proximal relationships between nodes in signed graphs, where edges can take either positive or negative weights. Adopting a physical perspective, we construct a Hamiltonian which is…

The low energy effective action of string theory depends strongly on the process of compactification and the localization of fields in extra dimensions. Explicit string constructions towards the minimal supersymmetric standard model (MSSM)…

The low energy physics as predicted by strings can be expressed in two (conformally related) different variables, usually called {\em frames}. The problem is raised as to whether it is physically possible in some situations to tell one from…

This paper investigates the problem of computing the shortest path between two states under resource constraints in environments with resource-replenishment regions. Namely, the length of the path is limited by a budget that can be restored…

We study the construction of the minimum cost spanning geometric graph of a given rooted point set $P$ where each point of $P$ is connected to the root by a path that satisfies a given property. We focus on two properties, namely the…

Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\over 2} \log n$ when $n\to \infty$.…

Let \begin{equation*} S_{0}=0,\quad S_{n}=X_{1}+...+X_{n},\ n\geq 1, \end{equation*} be a random walk whose increments belong without centering to the domain of attraction of a stable law with scaling constants $a_{n}$, that provide…

Let X_1, ..., X_n be a sequence of n classical random variables and consider a sample of r positions selected at random. Then, except with (exponentially in r) small probability, the min-entropy of the sample is not smaller than, roughly, a…

A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for…

We show that K-energy minimizing movements agree with smooth solutions to Calabi flow as long as the latter exist. As corollaries we conclude that in a general Kahler class long time solutions of Calabi flow minimize both K-energy and…

It is known that string theory compactifications leading to low energy effective theories with different chiral matter content ({\it e.g.} different numbers of standard model generations) are connected through phase transitions, described…

We discuss a semi-implicit numerical scheme that allows for minimizing the bending energy of curves within certain isotopy classes. To this end we consider a weighted sum of the bending energy and the tangent-point functional. Based on…

Two string-like solutions to the equations of motion of the low-energy effective action for the heterotic string are found, each a source of electric and magnetic fields. The first carries an electric current equal to the electric charge…

In a recent paper `The equi-energy sampler with applications statistical inference and statistical mechanics' [Ann. Stat. 34 (2006) 1581--1619], Kou, Zhou & Wong have presented a new stochastic simulation method called the equi-energy (EE)…

We study the problem of finding the cycle of minimum cost-to-time ratio in a directed graph with $ n $ nodes and $ m $ edges. This problem has a long history in combinatorial optimization and has recently seen interesting applications in…

Low-energy reflectivity of electrons from single- and multi-layer graphene is examined both theoretically and experimentally. A series of minima in the reflectivity over the energy range of 0 - 8 eV are found, with the number of minima…

We generalize the string method, originally designed for the study of thermally activated rare events, to the calculation of quantum tunneling rates. This generalization is based on the analogy between quantum mechanics and statistical…

In this paper, we propose a novel minimum gravitational potential energy (MPE)-based algorithm for global point set registration. The feature descriptors extraction algorithms have emerged as the standard approach to align point sets in the…

We study the problem of finding the shortest path with increasing chords in a simple polygon. A path has increasing chords if and only if for any points a, b, c, and d that lie on the path in that order, |ad| >= |bc|. In this paper we show…