Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis (Extended)

This extended paper presents 1) a novel hierarchy and recursion extension to the process tree model; and 2) the first, recursion aware process model discovery technique that leverages hierarchical information in event logs, typically available for software systems. This technique allows us to analyze the operational processes of software systems under real-life conditions at multiple levels of granularity. The work can be positioned in-between reverse engineering and process mining. An implementation of the proposed approach is available as a ProM plugin. Experimental results based on real-life (software) event logs demonstrate the feasibility and usefulness of the approach and show the huge potential to speed up discovery by exploiting the available hierarchy.Comment: Extended version (14 pages total) of the paper Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis. This Technical Report version includes the guarantee proofs for the proposed discovery algorithm

Weighted Laplacians, cocycles and recursion relations

Hodge's formula represents the gravitational MHV amplitude as the determinant of a minor of a certain matrix. When expanded, this determinant becomes a sum over weighted trees, which is the form of the MHV formula first obtained by Bern, Dixon, Perelstein, Rozowsky and rediscovered by Nguyen, Spradlin, Volovich and Wen. The gravity MHV amplitude satisfies the Britto, Cachazo, Feng and Witten recursion relation. The main building block of the MHV amplitude, the so-called half-soft function, satisfies a different, Berends-Giele-type recursion relation. We show that all these facts are illustrations to a more general story. We consider a weighted Laplacian for a complete graph of n vertices. The matrix tree theorem states that its diagonal minor determinants are all equal and given by a sum over spanning trees. We show that, for any choice of a cocycle on the graph, the minor determinants satisfy a Berends-Giele as well as Britto-Cachazo-Feng-Witten type recursion relation. Our proofs are purely combinatorial.Comment: 12 pages, some figures embedded in the tex

Phase Space Reduction for Star-Products: An Explicit Construction for CP^n

We derive a closed formula for a star-product on complex projective space and on the domain $SU(n+1)/S(U(1)\times U(n))$ using a completely elementary construction: Starting from the standard star-product of Wick type on $C^{n+1} \setminus \{ 0 \}$ and performing a quantum analogue of Marsden-Weinstein reduction, we can give an easy algebraic description of this star-product. Moreover, going over to a modified star-product on $C^{n+1} \setminus \{ 0 \}$, obtained by an equivalence transformation, this description can be even further simplified, allowing the explicit computation of a closed formula for the star-product on \CP^n which can easily transferred to the domain $SU(n+1)/S(U(1)\times U(n))$.Comment: LaTeX, 17 page