789 research outputs found
Dimension Reduction via Colour Refinement
Colour refinement is a basic algorithmic routine for graph isomorphism
testing, appearing as a subroutine in almost all practical isomorphism solvers.
It partitions the vertices of a graph into "colour classes" in such a way that
all vertices in the same colour class have the same number of neighbours in
every colour class. Tinhofer (Disc. App. Math., 1991), Ramana, Scheinerman, and
Ullman (Disc. Math., 1994) and Godsil (Lin. Alg. and its App., 1997)
established a tight correspondence between colour refinement and fractional
isomorphisms of graphs, which are solutions to the LP relaxation of a natural
ILP formulation of graph isomorphism.
We introduce a version of colour refinement for matrices and extend existing
quasilinear algorithms for computing the colour classes. Then we generalise the
correspondence between colour refinement and fractional automorphisms and
develop a theory of fractional automorphisms and isomorphisms of matrices.
We apply our results to reduce the dimensions of systems of linear equations
and linear programs. Specifically, we show that any given LP L can efficiently
be transformed into a (potentially) smaller LP L' whose number of variables and
constraints is the number of colour classes of the colour refinement algorithm,
applied to a matrix associated with the LP. The transformation is such that we
can easily (by a linear mapping) map both feasible and optimal solutions back
and forth between the two LPs. We demonstrate empirically that colour
refinement can indeed greatly reduce the cost of solving linear programs
Testing axioms for Quantum Mechanics on Probabilistic toy-theories
In Ref. [1] one of the authors proposed postulates for axiomatizing Quantum
Mechanics as a "fair operational framework", namely regarding the theory as a
set of rules that allow the experimenter to predict future events on the basis
of suitable tests, having local control and low experimental complexity. In
addition to causality, the following postulates have been considered: PFAITH
(existence of a pure preparationally faithful state), and FAITHE (existence of
a faithful effect). These postulates have exhibited an unexpected theoretical
power, excluding all known nonquantum probabilistic theories. Later in Ref. [2]
in addition to causality and PFAITH, postulate LDISCR (local discriminability)
and PURIFY (purifiability of all states) have been considered, narrowing the
probabilistic theory to something very close to Quantum Mechanics. In the
present paper we test the above postulates on some nonquantum probabilistic
models. The first model, "the two-box world" is an extension of the
Popescu-Rohrlich model, which achieves the greatest violation of the CHSH
inequality compatible with the no-signaling principle. The second model "the
two-clock world" is actually a full class of models, all having a disk as
convex set of states for the local system. One of them corresponds to the "the
two-rebit world", namely qubits with real Hilbert space. The third model--"the
spin-factor"--is a sort of n-dimensional generalization of the clock. Finally
the last model is "the classical probabilistic theory". We see how each model
violates some of the proposed postulates, when and how teleportation can be
achieved, and we analyze other interesting connections between these postulate
violations, along with deep relations between the local and the non-local
structures of the probabilistic theory.Comment: Submitted to QIP Special Issue on Foundations of Quantum Informatio
A Spectral Assignment Approach for the Graph Isomorphism Problem
In this paper, we propose algorithms for the graph isomorphism (GI) problem
that are based on the eigendecompositions of the adjacency matrices. The
eigenvalues of isomorphic graphs are identical. However, two graphs and
can be isospectral but non-isomorphic. We first construct a graph
isomorphism testing algorithm for friendly graphs and then extend it to
unambiguous graphs. We show that isomorphisms can be detected by solving a
linear assignment problem. If the graphs possess repeated eigenvalues, which
typically correspond to graph symmetries, finding isomorphisms is much harder.
By repeatedly perturbing the adjacency matrices and by using properties of
eigenpolytopes, it is possible to break symmetries of the graphs and
iteratively assign vertices of to vertices of , provided that an
admissible assignment exists. This heuristic approach can be used to construct
a permutation which transforms into if the graphs are
isomorphic. The methods will be illustrated with several guiding examples
Structural graph matching using the EM algorithm and singular value decomposition
This paper describes an efficient algorithm for inexact graph matching. The method is purely structural, that is, it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions: 1) commencing from a probability distribution for matching errors, we show how the problem of graph matching can be posed as maximum-likelihood estimation using the apparatus of the EM algorithm; and 2) we cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows one to efficiently recover correspondence matches using the singular value decomposition. We experiment with the method on both real-world and synthetic data. Here, we demonstrate that the method offers comparable performance to more computationally demanding method
- …