2,002 research outputs found
On the Quest for an Acyclic Graph
The paper aims at finding acyclic graphs under a given set of
constraints. More specifically, given a propositional formula
? over edges of a fixed-size graph, the objective is to find a model of
? that corresponds to a graph that is acyclic. The paper proposes several encodings of the
problem and compares them in an experimental evaluation using stateof-the-art
SAT solvers
Kruskal's Tree Theorem for Acyclic Term Graphs
In this paper we study termination of term graph rewriting, where we restrict
our attention to acyclic term graphs. Motivated by earlier work by Plump we aim
at a definition of the notion of simplification order for acyclic term graphs.
For this we adapt the homeomorphic embedding relation to term graphs. In
contrast to earlier extensions, our notion is inspired by morphisms. Based on
this, we establish a variant of Kruskal's Tree Theorem formulated for acyclic
term graphs. In proof, we rely on the new notion of embedding and follow
Nash-Williams' minimal bad sequence argument. Finally, we propose a variant of
the lexicographic path order for acyclic term graphs.Comment: In Proceedings TERMGRAPH 2016, arXiv:1609.0301
Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
In this paper we consider variational problems involving 1-dimensional
connected sets in the Euclidean plane, such as the classical Steiner tree
problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal
partition problems and provide a variational approximation through
Modica-Mortola type energies proving a -convergence result. We also
introduce a suitable convex relaxation and develop the corresponding numerical
implementations. The proposed methods are quite general and the results we
obtain can be extended to -dimensional Euclidean space or to more general
manifold ambients, as shown in the companion paper [11].Comment: 30 pages, 5 figure
Learning the structure of Bayesian Networks: A quantitative assessment of the effect of different algorithmic schemes
One of the most challenging tasks when adopting Bayesian Networks (BNs) is
the one of learning their structure from data. This task is complicated by the
huge search space of possible solutions, and by the fact that the problem is
NP-hard. Hence, full enumeration of all the possible solutions is not always
feasible and approximations are often required. However, to the best of our
knowledge, a quantitative analysis of the performance and characteristics of
the different heuristics to solve this problem has never been done before.
For this reason, in this work, we provide a detailed comparison of many
different state-of-the-arts methods for structural learning on simulated data
considering both BNs with discrete and continuous variables, and with different
rates of noise in the data. In particular, we investigate the performance of
different widespread scores and algorithmic approaches proposed for the
inference and the statistical pitfalls within them
Monads with arities and their associated theories
After a review of the concept of "monad with arities" we show that the
category of algebras for such a monad has a canonical dense generator. This is
used to extend the correspondence between finitary monads on sets and Lawvere's
algebraic theories to a general correspondence between monads and theories for
a given category with arities. As application we determine arities for the free
groupoid monad on involutive graphs and recover the symmetric simplicial nerve
characterisation of groupoids.Comment: New introduction; Section 1 shortened and redispatched with Section
2; Subsections on symmetric operads (3.14) and symmetric simplicial sets
(4.17) added; Bibliography complete
- …