258 research outputs found
Self-dual noncommutative \phi^4-theory in four dimensions is a non-perturbatively solvable and non-trivial quantum field theory
We study quartic matrix models with partition function Z[E,J]=\int dM
\exp(trace(JM-EM^2-(\lambda/4)M^4)). The integral is over the space of
Hermitean NxN-matrices, the external matrix E encodes the dynamics, \lambda>0
is a scalar coupling constant and the matrix J is used to generate correlation
functions. For E not a multiple of the identity matrix, we prove a universal
algebraic recursion formula which gives all higher correlation functions in
terms of the 2-point function and the distinct eigenvalues of E. The 2-point
function itself satisfies a closed non-linear equation which must be solved
case by case for given E. These results imply that if the 2-point function of a
quartic matrix model is renormalisable by mass and wavefunction
renormalisation, then the entire model is renormalisable and has vanishing
\beta-function.
As main application we prove that Euclidean \phi^4-quantum field theory on
four-dimensional Moyal space with harmonic propagation, taken at its
self-duality point and in the infinite volume limit, is exactly solvable and
non-trivial. This model is a quartic matrix model, where E has for N->\infty
the same spectrum as the Laplace operator in 4 dimensions. Using the theory of
singular integral equations of Carleman type we compute (for N->\infty and
after renormalisation of E,\lambda) the free energy density
(1/volume)\log(Z[E,J]/Z[E,0]) exactly in terms of the solution of a non-linear
integral equation. Existence of a solution is proved via the Schauder fixed
point theorem.
The derivation of the non-linear integral equation relies on an assumption
which we verified numerically for coupling constants 0<\lambda\leq (1/\pi).Comment: LaTeX, 64 pages, xypic figures. v4: We prove that recursion formulae
and vanishing of \beta-function hold for general quartic matrix models. v3:
We add the existence proof for a solution of the non-linear integral
equation. A rescaling of matrix indices was necessary. v2: We provide
Schwinger-Dyson equations for all correlation functions and prove an
algebraic recursion formula for their solutio
Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
This work elaborates on the important problem of (1) designing optimal
randomized routing policies for reaching a target node t from a source note s
on a weighted directed graph G and (2) defining distance measures between nodes
interpolating between the least cost (based on optimal movements) and the
commute-cost (based on a random walk on G), depending on a temperature
parameter T. To this end, the randomized shortest path formalism (RSP,
[2,99,124]) is rephrased in terms of Tsallis divergence regularization, instead
of Kullback-Leibler divergence. The main consequence of this change is that the
resulting routing policy (local transition probabilities) becomes sparser when
T decreases, therefore inducing a sparse random walk on G converging to the
least-cost directed acyclic graph when T tends to 0. Experimental comparisons
on node clustering and semi-supervised classification tasks show that the
derived dissimilarity measures based on expected routing costs provide
state-of-the-art results. The sparse RSP is therefore a promising model of
movements on a graph, balancing sparse exploitation and exploration in an
optimal way
- …