相关论文: Stability and convergence of the string method for…

The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…

We investigate the minimum conductivity of graphene within a quasiclassical approach taking into account electron-hole coherence effects which stem from the chiral nature of low energy excitations. Relying on an analytical solution of the…

We derive stringy symmetries with conserved charges of arbitrarily high spins from the decoupling of two types of zero-norm states in the old covariant first quantized (OCFQ) spectrum of open bosonic string. These symmetries are valid to…

We use the low energy effective theory of string theory to investigate condensations of closed string tachyons propagating in the bulk. The c-function is related to the total energy of the system via the effective action. A possible…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

If the fundamental mass scale of superstring theory is as low as few TeVs, the massive modes of vibrating strings, Regge excitations, will be copiously produced at the Large Hadron Collider (LHC). We discuss the complementary signals of low…

In the minimum $k$-edge-connected spanning subgraph ($k$-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to $k-1$ edge failures. This is a central problem in network design, and a natural generalization of the…

There is evidence that string theory possesses a large discretuum of stable and/or metastable ground states, with zero or four supersymmetries in four dimensions. I discuss critically the nature of this evidence. Assuming this "landscape"…

We show that adaptive least-squares finite element methods driven by the canonical least-squares functional converge under weak conditions on PDE operator, mesh-refinement, and marking strategy. Contrary to prior works, our plain…

We examine recent claims of a large set of flux compactification solutions of string theory. We conclude that the arguments for AdS solutions are plausible. The analysis of meta-stable dS solutions inevitably leads to situations where long…

In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and…

Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes? That is, with respect to a fixed latent decision-making system (e.g., a…

Besides the string scale, string theory has no parameter except some quantized flux values; and the string theory Landscape is generated by scanning over discrete values of all the flux parameters present. We propose that a typical…

Minimum energy paths for transitions such as atomic and/or spin rearrangements in thermalized systems are the transition paths of largest statistical weight. Such paths are frequently calculated using the nudged elastic band method, where…

This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the…

We study minimum energy configurations of $N$ particles in $\R^3$ of charge -1 (`electrons') in the potential of $M$ particles of charges $Z_\alpha>0$ (`atomic nuclei'). In a suitable large-N limit, we determine the asymptotic electron…

We study the existence and regularity of energy-minimizing harmonic almost complex structures. We have proved results similar to the theory of harmonic maps, notably the classical results of Schoen-Uhlenbeck and recent advance by…

We present an analytic model specifically designed to address the long standing issue of small scale structure on cosmic string networks. The model is derived from the microscopic string equations, together with a few motivated assumptions.…

This work studies the location estimation problem for a mixture of two rotation invariant log-concave densities. We demonstrate that Least Squares EM, a variant of the EM algorithm, converges to the true location parameter from a randomly…

We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich,…