3,562 research outputs found
Subtropical Real Root Finding
We describe a new incomplete but terminating method for real root finding for
large multivariate polynomials. We take an abstract view of the polynomial as
the set of exponent vectors associated with sign information on the
coefficients. Then we employ linear programming to heuristically find roots.
There is a specialized variant for roots with exclusively positive coordinates,
which is of considerable interest for applications in chemistry and systems
biology. An implementation of our method combining the computer algebra system
Reduce with the linear programming solver Gurobi has been successfully applied
to input data originating from established mathematical models used in these
areas. We have solved several hundred problems with up to more than 800000
monomials in up to 10 variables with degrees up to 12. Our method has failed
due to its incompleteness in less than 8 percent of the cases
Statistical Mechanics of Steiner trees
The Minimum Weight Steiner Tree (MST) is an important combinatorial
optimization problem over networks that has applications in a wide range of
fields. Here we discuss a general technique to translate the imposed global
connectivity constrain into many local ones that can be analyzed with cavity
equation techniques. This approach leads to a new optimization algorithm for
MST and allows to analyze the statistical mechanics properties of MST on random
graphs of various types
A Two-loop Test of Buscher's T-duality I
We study the two loop quantum equivalence of sigma models related by
Buscher's T-duality transformation. The computation of the two loop
perturbative free energy density is performed in the case of a certain
deformation of the SU(2) principal sigma model, and its T-dual, using
dimensional regularization and the geometric sigma model perturbation theory.
We obtain agreement between the free energy density expressions of the two
models.Comment: 28 pp, Latex, references adde
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
There has been significant recent interest in parallel graph processing due
to the need to quickly analyze the large graphs available today. Many graph
codes have been designed for distributed memory or external memory. However,
today even the largest publicly-available real-world graph (the Hyperlink Web
graph with over 3.5 billion vertices and 128 billion edges) can fit in the
memory of a single commodity multicore server. Nevertheless, most experimental
work in the literature report results on much smaller graphs, and the ones for
the Hyperlink graph use distributed or external memory. Therefore, it is
natural to ask whether we can efficiently solve a broad class of graph problems
on this graph in memory.
This paper shows that theoretically-efficient parallel graph algorithms can
scale to the largest publicly-available graphs using a single machine with a
terabyte of RAM, processing them in minutes. We give implementations of
theoretically-efficient parallel algorithms for 20 important graph problems. We
also present the optimizations and techniques that we used in our
implementations, which were crucial in enabling us to process these large
graphs quickly. We show that the running times of our implementations
outperform existing state-of-the-art implementations on the largest real-world
graphs. For many of the problems that we consider, this is the first time they
have been solved on graphs at this scale. We have made the implementations
developed in this work publicly-available as the Graph-Based Benchmark Suite
(GBBS).Comment: This is the full version of the paper appearing in the ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 201
Vertex-Coloring with Star-Defects
Defective coloring is a variant of traditional vertex-coloring, according to
which adjacent vertices are allowed to have the same color, as long as the
monochromatic components induced by the corresponding edges have a certain
structure. Due to its important applications, as for example in the
bipartisation of graphs, this type of coloring has been extensively studied,
mainly with respect to the size, degree, and acyclicity of the monochromatic
components.
In this paper we focus on defective colorings in which the monochromatic
components are acyclic and have small diameter, namely, they form stars. For
outerplanar graphs, we give a linear-time algorithm to decide if such a
defective coloring exists with two colors and, in the positive case, to
construct one. Also, we prove that an outerpath (i.e., an outerplanar graph
whose weak-dual is a path) always admits such a two-coloring. Finally, we
present NP-completeness results for non-planar and planar graphs of bounded
degree for the cases of two and three colors
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
We present the first thorough practical study of the Lempel-Ziv-78 and the
Lempel-Ziv-Welch computation based on trie data structures. With a careful
selection of trie representations we can beat well-tuned popular trie data
structures like Judy, m-Bonsai or Cedar
Optimal Vertex Cover for the Small-World Hanoi Networks
The vertex-cover problem on the Hanoi networks HN3 and HN5 is analyzed with
an exact renormalization group and parallel-tempering Monte Carlo simulations.
The grand canonical partition function of the equivalent hard-core repulsive
lattice-gas problem is recast first as an Ising-like canonical partition
function, which allows for a closed set of renormalization group equations. The
flow of these equations is analyzed for the limit of infinite chemical
potential, at which the vertex-cover problem is attained. The relevant fixed
point and its neighborhood are analyzed, and non-trivial results are obtained
both, for the coverage as well as for the ground state entropy density, which
indicates the complex structure of the solution space. Using special
hierarchy-dependent operators in the renormalization group and Monte-Carlo
simulations, structural details of optimal configurations are revealed. These
studies indicate that the optimal coverages (or packings) are not related by a
simple symmetry. Using a clustering analysis of the solutions obtained in the
Monte Carlo simulations, a complex solution space structure is revealed for
each system size. Nevertheless, in the thermodynamic limit, the solution
landscape is dominated by one huge set of very similar solutions.Comment: RevTex, 24 pages; many corrections in text and figures; final
version; for related information, see
http://www.physics.emory.edu/faculty/boettcher
Scaling Limits for Internal Aggregation Models with Multiple Sources
We study the scaling limits of three different aggregation models on Z^d:
internal DLA, in which particles perform random walks until reaching an
unoccupied site; the rotor-router model, in which particles perform
deterministic analogues of random walks; and the divisible sandpile, in which
each site distributes its excess mass equally among its neighbors. As the
lattice spacing tends to zero, all three models are found to have the same
scaling limit, which we describe as the solution to a certain PDE free boundary
problem in R^d. In particular, internal DLA has a deterministic scaling limit.
We find that the scaling limits are quadrature domains, which have arisen
independently in many fields such as potential theory and fluid dynamics. Our
results apply both to the case of multiple point sources and to the
Diaconis-Fulton smash sum of domains.Comment: 74 pages, 4 figures, to appear in J. d'Analyse Math. Main changes in
v2: added "least action principle" (Lemma 3.2); small corrections in section
4, and corrected the proof of Lemma 5.3 (Lemma 5.4 in the new version);
expanded section 6.
A Full Characterization of Quantum Advice
We prove the following surprising result: given any quantum state rho on n
qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of
two-qubit interactions), such that any ground state of H can be used to
simulate rho on all quantum circuits of fixed polynomial size. In terms of
complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which
supersedes the previous result of Aaronson that BQP/qpoly is contained in
PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in
power to untrusted quantum advice combined with trusted classical advice.
Proving our main result requires combining a large number of previous tools --
including a result of Alon et al. on learning of real-valued concept classes, a
result of Aaronson on the learnability of quantum states, and a result of
Aharonov and Regev on "QMA+ super-verifiers" -- and also creating some new
ones. The main new tool is a so-called majority-certificates lemma, which is
closely related to boosting in machine learning, and which seems likely to find
independent applications. In its simplest version, this lemma says the
following. Given any set S of Boolean functions on n variables, any function f
in S can be expressed as the pointwise majority of m=O(n) functions f1,...,fm
in S, such that each fi is the unique function in S compatible with O(log|S|)
input/output constraints.Comment: We fixed two significant issues: 1. The definition of YQP machines
needed to be changed to preserve our results. The revised definition is more
natural and has the same intuitive interpretation. 2. We needed properties of
Local Hamiltonian reductions going beyond those proved in previous works
(whose results we'd misstated). We now prove the needed properties. See p. 6
for more on both point
The 3-SAT problem with large number of clauses in -replica symmetry breaking scheme
In this paper we analyze the structure of the UNSAT-phase of the
overconstrained 3-SAT model by studying the low temperature phase of the
associated disordered spin model. We derive the Replica Symmetry
Broken equations for a general class of disordered spin models which includes
the Sherrington - Kirkpatrick model, the Ising -spin model as well as the
overconstrained 3-SAT model as particular cases. We have numerically solved the
Replica Symmetry Broken equations using a pseudo-spectral code down to
and including zero temperature. We find that the UNSAT-phase of the
overconstrained 3-SAT model is of the -RSB kind: in order to get a
stable solution the replica symmetry has to be broken in a continuous way,
similarly to the SK model in external magnetic field.Comment: 19 pages, 7 figures; some section improved; iopart styl
- …