相关论文: A Count of Classical Field Theory Graphs

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

We propose a procedure of computing the n-point function in perturbation theory of the quantum field theory as the average over the complex Gaussian noises in a classical theory. The complex Gaussian noises are the sources for the creation…

Classical field theory is considered as a theory of unparametrized surfaces embedded in a configuration space, which accommodates, in a symmetric way, spacetime positions and field values. Dynamics is defined by a (Hamiltonian) constraint…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…

Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two…

We discuss a remarkable new approach initiated by Cachazo, Svrcek and Witten for calculating gauge theory amplitudes. The formalism amounts to an effective scalar perturbation theory which in many cases offers a much simpler alternative to…

We compute the number of circuits and of loops with multiple crossings in random regular graphs. We discuss the importance of this issue for the validity of the cavity approach. On the one side we obtain analytic results for the infinite…

In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons…

The ordinary formalism for classical field theory is applied to dynamical group field theories. Focusing first on a local group field theory over one copy of SU(2) and, then, on more involved nonlocal theories (colored and non colored)…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

We study the problem of determining the distribution of vertices of a particular given type in the set of all Feynman tree graphs in quantum field theories. We show that in almost all cases a Gaussian distribution arises asymptotically, and…

Graphs are important data representations for describing objects and their relationships, which appear in a wide diversity of real-world scenarios. As one of a critical problem in this area, graph generation considers learning the…

Large graphs can be found in a wide array of scientific fields ranging from sociology and biology to scientometrics and computer science. Their analysis is by no means a trivial task due to their sheer size and complex structure. Such…

We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

In contrast with QFT, classical field theory can be formulated in strict mathematical terms of fibre bundles, graded manifolds and jet manifolds. Second Noether theorems provide BRST extension of this classical field theory by means of…

A computer program has been developed which generates Feynman graphs automatically for scattering and decay processes in non-Abelian gauge theory of high-energy physics. A new acceleration method is presented for both generating and…

A descent of a labeled digraph is a directed edge (s, t) with s > t. We count strong tournaments, strong digraphs, and acyclic digraphs by descents and edges. To count strong tournaments we use Eulerian generating functions and to count…

In this text I present some problems which led to the introduction of special kinds of graphs as tools for studying singular points of algebraic surfaces. I explain how such graphs were first described using words, and how several…