High performance subgraph mining in molecular compounds

Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques particularly relevant. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiver-initiated, load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where the approach attains close-to linear speedup in a network of workstations

Kleene Algebras and Semimodules for Energy Problems

With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during transitions. Uncovering a close connection between energy problems and reachability and B\"uchi acceptance for semiring-weighted automata, we show that these generalized energy problems are decidable. We also provide complexity results for important special cases

Quantum and random walks as universal generators of probability distributions

Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a bell-shaped one in the second case. Here I show how one can impose any desired stochastic behavior (compatible with the continuity equation for the probability function) on both systems by the appropriate choice of time- and site-dependent coins. This implies, in particular, that one can devise quantum walks that show diffusive spreading without loosing coherence, as well as random walks that exhibit the characteristic fast propagation of a quantum particle driven by a Hadamard coin.Comment: 8 pages, 2 figures; revised and enlarged versio

Disordered locality in loop quantum gravity states

We show that loop quantum gravity suffers from a potential problem with non-locality, coming from a mismatch between micro-locality, as defined by the combinatorial structures of their microscopic states, and macro-locality, defined by the metric which emerges from the low energy limit. As a result, the low energy limit may suffer from a disordered locality characterized by identifications of far away points. We argue that if such defects in locality are rare enough they will be difficult to detect.Comment: 11 pages, 4 figures, revision with extended discussion of result

Quasi-Exact Solvability and the direct approach to invariant subspaces

We propose a more direct approach to constructing differential operators that preserve polynomial subspaces than the one based on considering elements of the enveloping algebra of sl(2). This approach is used here to construct new exactly solvable and quasi-exactly solvable quantum Hamiltonians on the line which are not Lie-algebraic. It is also applied to generate potentials with multiple algebraic sectors. We discuss two illustrative examples of these two applications: an interesting generalization of the Lam\'e potential which posses four algebraic sectors, and a quasi-exactly solvable deformation of the Morse potential which is not Lie-algebraic.Comment: 17 pages, 3 figure

Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

Quantum Inozemtsev model, quasi-exact solvability and N-fold supersymmetry

Inozemtsev models are classically integrable multi-particle dynamical systems related to Calogero-Moser models. Because of the additional q^6 (rational models) or sin^2(2q) (trigonometric models) potentials, their quantum versions are not exactly solvable in contrast with Calogero-Moser models. We show that quantum Inozemtsev models can be deformed to be a widest class of partly solvable (or quasi-exactly solvable) multi-particle dynamical systems. They posses N-fold supersymmetry which is equivalent to quasi-exact solvability. A new method for identifying and solving quasi-exactly solvable systems, the method of pre-superpotential, is presented.Comment: LaTeX2e 28 pages, no figure

A class of Calogero type reductions of free motion on a simple Lie group

The reductions of the free geodesic motion on a non-compact simple Lie group G based on the $G_+ \times G_+$ symmetry given by left- and right multiplications for a maximal compact subgroup $G_+ \subset G$ are investigated. At generic values of the momentum map this leads to (new) spin Calogero type models. At some special values the `spin' degrees of freedom are absent and we obtain the standard $BC_n$ Sutherland model with three independent coupling constants from SU(n+1,n) and from SU(n,n). This generalization of the Olshanetsky-Perelomov derivation of the $BC_n$ model with two independent coupling constants from the geodesics on $G/G_+$ with G=SU(n+1,n) relies on fixing the right-handed momentum to a non-zero character of $G_+$. The reductions considered permit further generalizations and work at the quantized level, too, for non-compact as well as for compact G.Comment: shortened to 13 pages in v2 on request of Lett. Math. Phys. and corrected some spelling error