Related papers: World Graph Formalism for Feynman Amplitudes
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Renormalization of massless Feynman amplitudes in $x$-space is reexamined here, using almost exclusively real-variable methods. We compute a wealth of concrete examples by means of recursive extension of distributions. This allows us to…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We study self-consistent static solutions for an Einstein universe in a graph-based induced gravity. In the generalization of the deconstruction model based on the graph, the eigenvalues of the graph Laplacian and the adjacent matrix gives…
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
We describe how to construct a spanning set of linearly-independent, automatically orthogonal colour tensors for scattering amplitudes involving coloured particles transforming under arbitrary representations of any gauge theory, sufficient…
Resonance and decay phenomena are ubiquitous in the quantum world. To understand them in their complexity it is useful to study solvable models in a wide sense, that is, systems which can be treated by analytical means. The present review…
We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the…
Feynman rules for the Standard Model including non-linear gauges are derived and implemented in the FeynArts package. The calculations using FeynArts with the new rules show that tree-level amplitudes are gauge invariant and that…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
An $\alpha$-parameter representation is derived for gauge field theories.It involves, relative to a scalar field theory, only constants and derivatives with respect to the $\alpha$-parameters. Simple rules are given to obtain the…
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
The traditional formulation of string amplitudes via worldsheet integrals provides a parametrization of the moduli space that fails to expose the complete singularity structure of the amplitudes. This problem is solved by the positive…