Related papers: Stability and convergence of the string method for…
We study the design of sampling trajectories for stable sampling and the reconstruction of bandlimited spatial fields using mobile sensors. The spectrum is assumed to be a symmetric convex set. As a performance metric we use the path…
In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…
Point particles fall freely along geodesics; strings do not. In string theory all probes of spacetime structure, including photons, are extended objects and therefore always subject to tidal forces. We illustrate how string theory modifies…
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…
We investigate the Hagedorn transitions of string networks with Y-junctions as may occur, for example, with (p,q) cosmic superstrings. In a simplified model with three different types of string, the partition function reduces to three…
We present the results of the first principle calculations of the energy bands in graphene and their symmetry classification. The valence bands and four lowest conduction bands are classified according to their symmetry at the points…
In this paper we find curves minimizing the elastic energy among curves whose length is fixed and whose ends are pinned. Applying the shooting method, we can identify all critical points explicitly and determine which curve is the global…
This talk considers possible lessons of string theory for low energy physics. These are of two types. First, assuming that string theory is the correct underlying theory of all interactions, we ask whether there are any generic predictions…
In the semi-streaming model, an algorithm must process any $n$-vertex graph by making one or few passes over a stream of its edges, use $O(n \cdot \text{polylog }n)$ words of space, and at the end of the last pass, output a solution to the…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
We consider the following Lane-Emden system with Neumann boundary conditions \[ -\Delta u= |v|^{q-1}v \text{ in } \Omega,\qquad -\Delta v= |u|^{p-1}u \text{ in } \Omega,\qquad \partial_\nu u=\partial_\nu v=0 \text{ on } \partial \Omega, \]…
The string corrections to the Riemann Curvature tensor are found to first order in the string slope parameter, here proportional to $\g$. This is done for D=10 supergravity, the presumed low energy limit of string theory. We follow the…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
The ground state of string theory may lie at a point of ``maximally enhanced symmetry", at which all of the moduli transform under continuous or discrete symmetries. This hypothesis, along with the hypotheses that the theory at high…
We study the minimum spanning tree problem on the complete graph $K_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent copy of the random variable $U^\gamma$ where $\gamma\leq 1$ and $U$ is the uniform…
We motivate a relation between dark energy and the scale of new physics in weakly coupled string theory. This mixing between infrared and ultraviolet physics leads to a unique corner for real-world phenomenology: barring fine-tunings, we…
In minimum power network design problems we are given an undirected graph $G=(V,E)$ with edge costs $\{c_e:e \in E\}$. The goal is to find an edge set $F\subseteq E$ that satisfies a prescribed property of minimum power $p_c(F)=\sum_{v \in…
We report a new algorithm for constructing pathways between local minima that involve a large number of intervening transition states on the potential energy surface. A significant improvement in efficiency has been achieved by changing the…
In this paper we show that approximation can help reduce the space used for self-stabilization. In the classic \emph{state model}, where the nodes of a network communicate by reading the states of their neighbors, an important measure of…
Recall that Janson showed that if the edges of the complete graph $K_n$ are assigned exponentially distributed independent random weights, then the expected length of a shortest path between a fixed pair of vertices is asymptotically equal…