97,010 research outputs found
Integrability of graph combinatorics via random walks and heaps of dimers
We investigate the integrability of the discrete non-linear equation
governing the dependence on geodesic distance of planar graphs with inner
vertices of even valences. This equation follows from a bijection between
graphs and blossom trees and is expressed in terms of generating functions for
random walks. We construct explicitly an infinite set of conserved quantities
for this equation, also involving suitable combinations of random walk
generating functions. The proof of their conservation, i.e. their eventual
independence on the geodesic distance, relies on the connection between random
walks and heaps of dimers. The values of the conserved quantities are
identified with generating functions for graphs with fixed numbers of external
legs. Alternative equivalent choices for the set of conserved quantities are
also discussed and some applications are presented.Comment: 38 pages, 15 figures, uses epsf, lanlmac and hyperbasic
Tropical Geometry of Phylogenetic Tree Space: A Statistical Perspective
Phylogenetic trees are the fundamental mathematical representation of
evolutionary processes in biology. As data objects, they are characterized by
the challenges associated with "big data," as well as the complication that
their discrete geometric structure results in a non-Euclidean phylogenetic tree
space, which poses computational and statistical limitations. We propose and
study a novel framework to study sets of phylogenetic trees based on tropical
geometry. In particular, we focus on characterizing our framework for
statistical analyses of evolutionary biological processes represented by
phylogenetic trees. Our setting exhibits analytic, geometric, and topological
properties that are desirable for theoretical studies in probability and
statistics, as well as increased computational efficiency over the current
state-of-the-art. We demonstrate our approach on seasonal influenza data.Comment: 28 pages, 5 figures, 1 tabl
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
Let be an -node planar graph. In a visibility representation of ,
each node of is represented by a horizontal line segment such that the line
segments representing any two adjacent nodes of are vertically visible to
each other. In the present paper we give the best known compact visibility
representation of . Given a canonical ordering of the triangulated , our
algorithm draws the graph incrementally in a greedy manner. We show that one of
three canonical orderings obtained from Schnyder's realizer for the
triangulated yields a visibility representation of no wider than
. Our easy-to-implement O(n)-time algorithm bypasses the
complicated subroutines for four-connected components and four-block trees
required by the best previously known algorithm of Kant. Our result provides a
negative answer to Kant's open question about whether is a
worst-case lower bound on the required width. Also, if has no degree-three
(respectively, degree-five) internal node, then our visibility representation
for is no wider than (respectively, ).
Moreover, if is four-connected, then our visibility representation for
is no wider than , matching the best known result of Kant and He. As a
by-product, we obtain a much simpler proof for a corollary of Wagner's Theorem
on realizers, due to Bonichon, Sa\"{e}c, and Mosbah.Comment: 11 pages, 6 figures, the preliminary version of this paper is to
appear in Proceedings of the 20th Annual Symposium on Theoretical Aspects of
Computer Science (STACS), Berlin, Germany, 200
The Boardman-Vogt resolution of operads in monoidal model categories
We extend the W-construction of Boardman and Vogt to operads of an arbitrary
monoidal model category with suitable interval, and show that it provides a
cofibrant resolution for well-pointed sigma-cofibrant operads. The standard
simplicial resolution of Godement as well as the cobar-bar chain resolution are
shown to be particular instances of this generalised W-construction
A space-averaged model of branched structures
Many biological systems and artificial structures are ramified, and present a
high geometric complexity. In this work, we propose a space-averaged model of
branched systems for conservation laws. From a one-dimensional description of
the system, we show that the space-averaged problem is also one-dimensional,
represented by characteristic curves, defined as streamlines of the
space-averaged branch directions. The geometric complexity is then captured
firstly by the characteristic curves, and secondly by an additional forcing
term in the equations. This model is then applied to mass balance in a pipe
network and momentum balance in a tree under wind loading.Comment: 10 pages, 11 figure
Join-Reachability Problems in Directed Graphs
For a given collection G of directed graphs we define the join-reachability
graph of G, denoted by J(G), as the directed graph that, for any pair of
vertices a and b, contains a path from a to b if and only if such a path exists
in all graphs of G. Our goal is to compute an efficient representation of J(G).
In particular, we consider two versions of this problem. In the explicit
version we wish to construct the smallest join-reachability graph for G. In the
implicit version we wish to build an efficient data structure (in terms of
space and query time) such that we can report fast the set of vertices that
reach a query vertex in all graphs of G. This problem is related to the
well-studied reachability problem and is motivated by emerging applications of
graph-structured databases and graph algorithms. We consider the construction
of join-reachability structures for two graphs and develop techniques that can
be applied to both the explicit and the implicit problem. First we present
optimal and near-optimal structures for paths and trees. Then, based on these
results, we provide efficient structures for planar graphs and general directed
graphs
BSP-fields: An Exact Representation of Polygonal Objects by Differentiable Scalar Fields Based on Binary Space Partitioning
The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modeling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples
- …