155 research outputs found
Graph Algebras for Bigraphs
Binding bigraphs are a graphical formalism intended to be a meta-model for mobile, concurrent and communicating systems. In this paper we present an algebra of typed graph terms which correspond precisely to binding bigraphs over a given signature. As particular cases, pure bigraphs and local bigraphs are described by two sublanguages which can be given a simple syntactic characterization.
Moreover, we give a formal connection between these languages and Synchronized Hyperedge Replacement algebras and the hierarchical graphs used in Architectural Design Rewriting. This allows to transfer results and constructions among formalisms which have been developed independently, e.g., the systematic definition of congruent bisimulations for SHR graphs via the IPO construction
Subfactors of index less than 5, part 1: the principal graph odometer
In this series of papers we show that there are exactly ten subfactors, other
than subfactors, of index between 4 and 5. Previously this
classification was known up to index . In the first paper we give
an analogue of Haagerup's initial classification of subfactors of index less
than , showing that any subfactor of index less than 5 must appear
in one of a large list of families. These families will be considered
separately in the three subsequent papers in this series.Comment: 36 pages (updated to reflect that the classification is now complete
Explicit construction of Ramanujan bigraphs
We construct explicitly an infinite family of Ramanujan graphs which are
bipartite and biregular. Our construction starts with the Bruhat-Tits building
of an inner form of . To make the graphs finite, we take
successive quotients by infinitely many discrete co-compact subgroups of
decreasing size.Comment: 10 page
Algebras for Tree Decomposable Graphs
Complex problems can be sometimes solved efficiently via recursive decomposition strategies. In this line, the tree decomposition approach equips problems modelled as graphs with tree-like parsing structures. Following Milner’s flowgraph algebra, in a previous paper two of the authors introduced a strong network algebra to represent open graphs (up to isomorphism), so that homomorphic properties of open graphs can be computed via structural recursion. This paper extends this graphical-algebraic foundation to tree decomposable graphs. The correspondence is shown: (i) on the algebraic side by a loose network algebra, which relaxes the restriction reordering and scope extension axioms of the strong one; and (ii) on the graphical side by Milner’s binding bigraphs, and elementary tree decompositions. Conveniently, an interpreted loose algebra gives the evaluation complexity of each graph decomposition. As a key contribution, we apply our results to dynamic programming (DP). The initial statement of the problem is transformed into a term (this is the secondary optimisation problem of DP). Noting that when the scope extension axiom is applied to reduce the scope of the restriction, then also the complexity is reduced (or not changed), only so-called canonical terms (in the loose algebra) are considered. Then, the canonical term is evaluated obtaining a solution which is locally optimal for complexity. Finding a global optimum remains an NP-hard problem
- …