29,579 research outputs found
The Need, Benefits, and Demonstration of a Minimization Principle for Excited States
It is shown that the standard methods of computing excited states in
truncated spaces must yield wave functions that, beyond truncation, are in
principle veered away from the exact, and a remedy is demonstrated via a
presented functional, F, obeying a minimization principle for excited
states. It is further demonstrated that near avoided crossings, between two
MCSCF 'flipped roots' the wave function that leads to the excited state has the
lowest F.Comment: 4 pages, 1 figure, International Conference of Computational Methods
in Sciences and Engineering - 2015 / Computational Chemistry, 20-23 March
2015, Athens, GREEC
Solving the 3d Ising Model with the Conformal Bootstrap II. c-Minimization and Precise Critical Exponents
We use the conformal bootstrap to perform a precision study of the operator
spectrum of the critical 3d Ising model. We conjecture that the 3d Ising
spectrum minimizes the central charge c in the space of unitary solutions to
crossing symmetry. Because extremal solutions to crossing symmetry are uniquely
determined, we are able to precisely reconstruct the first several Z2-even
operator dimensions and their OPE coefficients. We observe that a sharp
transition in the operator spectrum occurs at the 3d Ising dimension
Delta_sigma=0.518154(15), and find strong numerical evidence that operators
decouple from the spectrum as one approaches the 3d Ising point. We compare
this behavior to the analogous situation in 2d, where the disappearance of
operators can be understood in terms of degenerate Virasoro representations.Comment: 55 pages, many figures; v2 - refs and comments added, to appear in a
special issue of J.Stat.Phys. in memory of Kenneth Wilso
Geometric Crossing-Minimization - A Scalable Randomized Approach
We consider the minimization of edge-crossings in geometric drawings of graphs G=(V, E), i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Daniel Bienstock, 1991]. Crossing-minimization, in general, is a popular theoretical research topic; see Vrt\u27o [Imrich Vrt\u27o, 2014]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Marcel Radermacher et al., 2018] is limited to the crossing-minimization in geometric graphs with less than 200 edges. The described heuristics base on the primitive operation of moving a single vertex v to its crossing-minimal position, i.e., the position in R^2 that minimizes the number of crossings on edges incident to v.
In this paper, we introduce a technique to speed-up the computation by a factor of 20. This is necessary but not sufficient to cope with graphs with a few thousand edges. In order to handle larger graphs, we drop the condition that each vertex v has to be moved to its crossing-minimal position and compute a position that is only optimal with respect to a small random subset of the edges. In our theoretical contribution, we consider drawings that contain for each edge uv in E and each position p in R^2 for v o(|E|) crossings. In this case, we prove that with a random subset of the edges of size Theta(k log k) the co-crossing number of a degree-k vertex v, i.e., the number of edge pairs uv in E, e in E that do not cross, can be approximated by an arbitrary but fixed factor delta with high probability. In our experimental evaluation, we show that the randomized approach reduces the number of crossings in graphs with up to 13 000 edges considerably. The evaluation suggests that depending on the degree-distribution different strategies result in the fewest number of crossings
Design of Sequences with Good Folding Properties in Coarse-Grained Protein Models
Background: Designing amino acid sequences that are stable in a given target
structure amounts to maximizing a conditional probability. A straightforward
approach to accomplish this is a nested Monte Carlo where the conformation
space is explored over and over again for different fixed sequences, which
requires excessive computational demand. Several approximate attempts to remedy
this situation, based on energy minimization for fixed structure or high-
expansions, have been proposed. These methods are fast but often not accurate
since folding occurs at low .
Results: We develop a multisequence Monte Carlo procedure, where both
sequence and conformation space are simultaneously probed with efficient
prescriptions for pruning sequence space. The method is explored on
hydrophobic/polar models. We first discuss short lattice chains, in order to
compare with exact data and with other methods. The method is then successfully
applied to lattice chains with up to 50 monomers, and to off-lattice 20-mers.
Conclusions: The multisequence Monte Carlo method offers a new approach to
sequence design in coarse-grained models. It is much more efficient than
previous Monte Carlo methods, and is, as it stands, applicable to a fairly wide
range of two-letter models.Comment: 23 pages, 7 figure
Exact and fixed-parameter algorithms for metro-line crossing minimization problems
A metro-line crossing minimization problem is to draw multiple lines on an
underlying graph that models stations and rail tracks so that the number of
crossings of lines becomes minimum. It has several variations by adding
restrictions on how lines are drawn. Among those, there is one with a
restriction that line terminals have to be drawn at a verge of a station, and
it is known to be NP-hard even when underlying graphs are paths. This paper
studies the problem in this setting, and propose new exact algorithms. We first
show that a problem to decide if lines can be drawn without crossings is solved
in polynomial time, and propose a fast exponential algorithm to solve a
crossing minimization problem. We then propose a fixed-parameter algorithm with
respect to the multiplicity of lines, which implies that the problem is FPT.Comment: 19 pages, 15 figure
3D simulations of Einstein's equations: symmetric hyperbolicity, live gauges and dynamic control of the constraints
We present three-dimensional simulations of Einstein equations implementing a
symmetric hyperbolic system of equations with dynamical lapse. The numerical
implementation makes use of techniques that guarantee linear numerical
stability for the associated initial-boundary value problem. The code is first
tested with a gauge wave solution, where rather larger amplitudes and for
significantly longer times are obtained with respect to other state of the art
implementations. Additionally, by minimizing a suitably defined energy for the
constraints in terms of free constraint-functions in the formulation one can
dynamically single out preferred values of these functions for the problem at
hand. We apply the technique to fully three-dimensional simulations of a
stationary black hole spacetime with excision of the singularity, considerably
extending the lifetime of the simulations.Comment: 21 pages. To appear in PR
Complexity of Discrete Energy Minimization Problems
Discrete energy minimization is widely-used in computer vision and machine
learning for problems such as MAP inference in graphical models. The problem,
in general, is notoriously intractable, and finding the global optimal solution
is known to be NP-hard. However, is it possible to approximate this problem
with a reasonable ratio bound on the solution quality in polynomial time? We
show in this paper that the answer is no. Specifically, we show that general
energy minimization, even in the 2-label pairwise case, and planar energy
minimization with three or more labels are exp-APX-complete. This finding rules
out the existence of any approximation algorithm with a sub-exponential
approximation ratio in the input size for these two problems, including
constant factor approximations. Moreover, we collect and review the
computational complexity of several subclass problems and arrange them on a
complexity scale consisting of three major complexity classes -- PO, APX, and
exp-APX, corresponding to problems that are solvable, approximable, and
inapproximable in polynomial time. Problems in the first two complexity classes
can serve as alternative tractable formulations to the inapproximable ones.
This paper can help vision researchers to select an appropriate model for an
application or guide them in designing new algorithms.Comment: ECCV'16 accepte
- …