Causal Set Dynamics: A Toy Model

We construct a quantum measure on the power set of non-cyclic oriented graphs of N points, drawing inspiration from 1-dimensional directed percolation. Quantum interference patterns lead to properties which do not appear to have any analogue in classical percolation. Most notably, instead of the single phase transition of classical percolation, the quantum model displays two distinct crossover points. Between these two points, spacetime questions such as "does the network percolate" have no definite or probabilistic answer.Comment: 28 pages incl. 5 figure

GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs

We present a prototype of a software tool for exploration of multiple combinatorial optimisation problems in large real-world and synthetic complex networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial Explorer), provides a unified framework for scalable computation and presentation of high-quality suboptimal solutions and bounds for a number of widely studied combinatorial optimisation problems. Efficient representation and applicability to large-scale graphs and complex networks are particularly considered in its design. The problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering, minimum dominating set, as well as the longest simple cycle problem. Suboptimal solutions and intervals for optimal objective values are estimated using scalable heuristics. The tool is designed with extensibility in mind, with the view of further problems and both new fast and high-performance heuristics to be added in the future. GraphCombEx has already been successfully used as a support tool in a number of recent research studies using combinatorial optimisation to analyse complex networks, indicating its promise as a research software tool

Usnea indet

Lichen