From Local Perturbation Theory to Hopf and Lie Algebras of Feynman Graphs

We review the algebraic structures imposed on the renormalization procedure in terms of Hopf and Lie algebras of Feynman graphs, and exhibit the connection to diffeomorphisms of physical observables.     

The Structure of Renormalization Hopf Algebras for Gauge Theories I: Representing Feynman Graphs on BV-Algebras

We study the structure of renormalization Hopf algebras of gauge theories. We identify certain Hopf subalgebras in them, whose character groups are semidirect products of invertible formal power series with formal diffeomorphisms. This can be understood physically as wave function renormalization and renormalization of the coupling constants, respectively. After taking into account the Slavnov–Taylor identities for the couplings as generators of a Hopf ideal, we find Hopf subalgebras in the corresponding quotient as well. In the second part of the paper, we explain the origin of these Hopf ideals by considering a coaction of the renormalization Hopf algebras on the Batalin-Vilkovisky (BV) algebras generated by the fields and couplings constants. The so-called classical master equation satisfied by the action in the BV-algebra implies the existence of the above Hopf ideals in the renormalization Hopf algebra. Finally, we exemplify our construction by applying it to Yang–Mills gauge theory.     

Rooted Spiral Trees on Hyper-Cubic Lattices

We study rooted spiral trees in 2,3 and 4 dimensions on a hyper cubic lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ= −1.3667±0.0010 and ν = 0.6574±0.0010 on a square lattice. With Monte-Carlo simulations we get the estimates as θ= −1.364±0.010, and ν = 0.656±0.010. These results are numerical evidence against earlier proposed dimensional reduction by four in this problem. In dimensions higher than two, the spiral constraint can be implemented in two ways. In either case, our series expansion results do not support the proposed dimensional reduction.     

Probability Distribution on Full Rooted Trees

The recursive and hierarchical structure of full rooted trees is applicable to statistical models in various fields, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is not a random variable; as such, model selection to avoid overfitting is problematic. One method to solve this problem is to assume a prior distribution on the full rooted trees. This enables the optimal model selection based on Bayes decision theory. For example, by assigning a low prior probability to a complex model, the maximum a posteriori estimator prevents the selection of the complex one. Furthermore, we can average all the models weighted by their posteriors. In this paper, we propose a probability distribution on a set of full rooted trees. Its parametric representation is suitable for calculating the properties of our distribution using recursive functions, such as the mode, expectation, and posterior distribution. Although such distributions have been proposed in previous studies, they are only applicable to specific applications. Therefore, we extract their mathematically essential components and derive new generalized methods to calculate the expectation, posterior distribution, etc.     

The Feynman Identity for Planar Graphs

The Feynman identity (FI) of a planar graph relates the Euler polynomial of the graph to an infinite product over the equivalence classes of closed nonperiodic signed cycles in the graph. The main objectives of this paper are to compute the number of equivalence classes of nonperiodic cycles of given length and sign in a planar graph and to interpret the data encoded by the FI in the context of free Lie superalgebras. This solves in the case of planar graphs a problem first raised by Sherman and sets the FI as the denominator identity of a free Lie superalgebra generated from a graph. Other results are obtained. For instance, in connection with zeta functions of graphs.     

Spanning Forest Polynomials and the Transcendental Weight of Feynman Graphs

We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in f⁴{phi^4} theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a list of subgraphs which induce a drop in the transcendental weight.     

Spectral Properties of Quantum Walks on Rooted Binary Trees

We define coined quantum walks on the infinite rooted binary tree given by unitary operators $U(C)$ on an associated infinite dimensional Hilbert space, depending on a unitary coin matrix $C\in U(3)$ , and study their spectral properties. For circulant unitary coin matrices $C$ , we derive an equation for the Carathéodory function associated to the spectral measure of a cyclic vector for $U(C)$ . This allows us to show that for all circulant unitary coin matrices, the spectrum of the quantum walk has no singular continuous component. Furthermore, for coin matrices $C$ which are orthogonal circulant matrices, we show that the spectrum of the Quantum Walk is absolutely continuous, except for four coin matrices for which the spectrum of $U(C)$ is pure point.     

Duality of Orthogonal and Symplectic Matrix Integrals and Quaternionic Feynman Graphs

We present an asymptotic expansion for quaternionic self-adjoint matrix integrals. The Feynman diagrams appearing in the expansion are ordinary ribbon graphs and their non-orientable counterparts. We show that the 2N×2N Gaussian Orthogonal Ensemble (GOE) and N×N Gaussian Symplectic Ensemble (GSE) have exactly the same expansion term by term, except that the contributions from graphs on a non-orientable surface with odd Euler characteristic carry the opposite sign. As an application, we give a new topological proof of the known duality for correlations of characteristic polynomials, demonstrating that this duality is equivalent to Poincaré duality of graphs drawn on a compact surface. Another consequence of our graphical expansion formula is a simple and simultaneous (re)derivation of the Central Limit Theorem for GOE, GUE (Gaussian Unitary Ensemble) and GSE: The three cases have exactly the same graphical limiting formula except for an overall constant that represents the type of the ensemble.Research supported by NSF Grant DMS-9971371 and the University of California, Davis.Research supported by the University of California, Davis.     

On a Pre-Lie Algebra Defined by Insertion of Rooted Trees

Let K be a field of characteristic zero. For \({n \in \mathbb{N}^{*}}\) , let \({\mathcal{T}^{\,\prime}_{n}}\) be the vector space of non-planar rooted trees with n vertices (Foissy in Bull Sci Math 126, no. 3, 193–239; no. 4, 249–288, 2002). Let \({\vartriangleright}\) be the left pre-Lie product of insertion of a tree inside another defined on infinitesimal characters of the graded Hopf algebra \({\mathcal{H}}\) introduced by Calaque, Ebrahimi-Fard and Manchon. Let \({\mathcal{T}^{\,\prime}=\oplus_{n\geq 2}\mathcal{T}^{\,\prime}_{n}}\) . In this work, we first prove that \({(\mathcal{T}^{\,\prime}, \vartriangleright)}\) a pre-Lie algebra generated by the two ladders E ₁ and E ₂ where E ₁ is the ladder with one edge and E ₂ is the ladder with two edges. Second, we prove that \({(\mathcal{T}^{\,\prime}, \vartriangleright)}\) is not a free pre-Lie algebra, and we exhibit a family of relations.     

Ising Critical Exponents on Random Trees and Graphs

We study the critical behavior of the ferromagnetic Ising model on random trees as well as so-called locally tree-like random graphs. We pay special attention to trees and graphs with a power-law offspring or degree distribution whose tail behavior is characterized by its power-law exponent τ > 2. We show that the critical inverse temperature of the Ising model equals the hyperbolic arctangent of the reciprocal of the mean offspring or mean forward degree distribution. In particular, the critical inverse temperature equals zero when ${\tau \in (2,3]}$ where this mean equals infinity. We further study the critical exponents δ, β and γ, describing how the (root) magnetization behaves close to criticality. We rigorously identify these critical exponents and show that they take the values as predicted by Dorogovstev et al. (Phys Rev E 66:016104, 2002) and Leone et al. (Eur Phys J B 28:191–197, 2002). These values depend on the power-law exponent τ, taking the same values as the mean-field Curie-Weiss model (Exactly solved models in statistical mechanics, Academic Press, London, 1982) for τ > 5, but different values for ${\tau \in (3,5)}$ .     

Towards Cohomology of Renormalization: Bigrading the Combinatorial Hopf Algebra of Rooted Trees

The renormalization of quantum field theory twists the antipode of a noncocommutative Hopf algebra of rooted trees, decorated by an infinite set of primitive divergences. The Hopf algebra of undecorated rooted trees, ℋ _R , generated by a single primitive divergence, solves a universal problem in Hochschild cohomology. It has two nontrivial closed Hopf subalgebras: the cocommutative subalgebra ℋ_ladder of pure ladder diagrams and the Connes–Moscovici noncocommutative subalgebra ℋ_CM of noncommutative geometry. These three Hopf algebras admit a bigrading by n, the number of nodes, and an index k that specifies the degree of primitivity. In each case, we use iterations of the relevant coproduct to compute the dimensions of subspaces with modest values of n and k and infer a simple generating procedure for the remainder. The results for ℋ_ladder are familiar from the theory of partitions, while those for ℋ_CM involve novel transforms of partitions. Most beautiful is the bigrading of ℋ _R , the largest of the three. Thanks to Sloane's superseeker, we discovered that it saturates all possible inequalities. We prove this by using the universal Hochschild-closed one-cocycle B ₊, which plugs one set of divergences into another, and by generalizing the concept of natural growth beyond that entailed by the Connes–Moscovici case. We emphasize the yet greater challenge of handling the infinite set of decorations of realistic quantum field theory. Received: 31 January 2000 / Accepted: 7 July 2000     

A Markovian Growth Dynamics on Rooted Binary Trees Evolving According to the Gompertz Curve

Inspired by biological dynamics, we consider a growth Markov process taking values on the space of rooted binary trees, similar to the Aldous-Shields (Probab. Theory Relat. Fields 79(4):509?C542, 1988) model. Fix n??1 and ??>0. We start at time 0 with the tree composed of a root only. At any time, each node with no descendants, independently from the other nodes, produces two successors at rate ??(n?k)/n, where k is the distance from the node to the root. Denote by Z _n (t) the number of nodes with no descendants at time t and let T _n =?? ^?1 nln(n/ln4)+(ln2)/(2??). We prove that 2^?n Z _n (T _n +n??), ?????, converges to the Gompertz curve exp(?(ln2)?e ^??|? ). We also prove a central limit theorem for the martingale associated to Z _n (t).     

Fock Representations of Lie Algebras,Loop Algebras and Affine Lie Algebras

Explicit Fock representations of the classical Lie algebras in terms of boson creation and annihilation operators with an arbitrary highest weight are derived, and a general rule to construct Fock represen tations of a loop algebra from a boson realization ofits corresponding Lie algebra is establislted. A new kind of lowest weight represen tations of the affine Lie algebras attached to the classical Lie algebras, which require a zero center, is also presented. Based on these, a simple affinization procedure is given to obtain the Fock representations of level 1 of these affine Lie algebras.     

Causal Algebras on Chain Event Graphs with Informed Missingness for System Failure

Graph-based causal inference has recently been successfully applied to explore system reliability and to predict failures in order to improve systems. One popular causal analysis following Pearl and Spirtes et al. to study causal relationships embedded in a system is to use a Bayesian network (BN). However, certain causal constructions that are particularly pertinent to the study of reliability are difficult to express fully through a BN. Our recent work demonstrated the flexibility of using a Chain Event Graph (CEG) instead to capture causal reasoning embedded within engineers’ reports. We demonstrated that an event tree rather than a BN could provide an alternative framework that could capture most of the causal concepts needed within this domain. In particular, a causal calculus for a specific type of intervention, called a remedial intervention, was devised on this tree-like graph. In this paper, we extend the use of this framework to show that not only remedial maintenance interventions but also interventions associated with routine maintenance can be well-defined using this alternative class of graphical model. We also show that the complexity in making inference about the potential relationships between causes and failures in a missing data situation in the domain of system reliability can be elegantly addressed using this new methodology. Causal modelling using a CEG is illustrated through examples drawn from the study of reliability of an energy distribution network.     

Factorizations of Polynomials over Noncommutative Algebras and Sufficient Sets of Edges in Directed Graphs

To directed graphs with unique sink and source we associate a noncommutative associative algebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when coefficients of the polynomial can be rationally expressed via elements of a given set of pseudo-roots (edges). Our results are based on a new theorem for directed graphs also proved in this paper. To the memory of Felix Alexandrovich Berezin. Vladimir Retakh was partially supported by NSA     

Loops on surfaces, Feynman diagrams, and trees

We relate the author’s Lie cobracket in the module additively generated by loops on a surface with the Connes–Kreimer Lie bracket in the module additively generated by trees.     

Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees

Consider a statistical physical model on the d-regular infinite tree \(T_{d}\) described by a set of interactions \(\Phi \). Let \(\{G_{n}\}\) be a sequence of finite graphs with vertex sets \(V_n\) that locally converge to \(T_{d}\). From \(\Phi \) one can construct a sequence of corresponding models on the graphs \(G_n\). Let \(\{\mu _n\}\) be the resulting Gibbs measures. Here we assume that \(\{\mu _{n}\}\) converges to some limiting Gibbs measure \(\mu \) on \(T_{d}\) in the local weak\(^*\) sense, and study the consequences of this convergence for the specific entropies \(|V_n|^{-1}H(\mu _n)\). We show that the limit supremum of \(|V_n|^{-1}H(\mu _n)\) is bounded above by the percolative entropy \(H_{\textit{perc}}(\mu )\), a function of \(\mu \) itself, and that \(|V_n|^{-1}H(\mu _n)\) actually converges to \(H_{\textit{perc}}(\mu )\) in case \(\Phi \) exhibits strong spatial mixing on \(T_d\). When it is known to exist, the limit of \(|V_n|^{-1}H(\mu _n)\) is most commonly shown to be given by the Bethe ansatz. Percolative entropy gives a different formula, and we do not know how to connect it to the Bethe ansatz directly. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.