Related papers: Graph invariants from ideas in physics and number …
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
We present some approaches to the perturbative analysis of the classical and quantum gravity. First we introduce a graphical representation for a global SO(n) tensor $(\pl)^d h_\ab$, which generally appears in the weak field expansion…
We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete…
We implement the method developed in [1] to construct the most general parametrised action for linear cosmological perturbations of bimetric theories of gravity. Specifically, we consider perturbations around a homogeneous and isotropic…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…
Among various approaches in proving gauge independence, models containing an explicit gauge dependence are convenient. The well-known example is the gauge parameter in the covariant gauge fixing which is of course most suitable for the…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
In this paper, we show that Graph Isomorphism (GI) is not $\textsf{AC}^{0}$-reducible to several problems, including the Latin Square Isotopy problem, isomorphism testing of several families of Steiner designs, and isomorphism testing of…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
We study a very general four dimensional Field Theory model describing the dynamics of a massless higher spin $N$ symmetric tensor field particle interacting with a geometrical background.This model is invariant under the action of an…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
A diagram approach to classical nonlinear stochastic field theory is introduced. This approach is intended to serve as a link between quantum and classical field theories, resulting in an independent constructive characterisation of the…
We define a diagram associated to any algebraic connection on a vector bundle on a Zariski open subset of the Riemann sphere, extending the definition of Boalch-Yamakawa to the general case featuring several irregular singularities,…