Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Renormalization: AQFT

In course

PHYS-702: Advanced Quantum Field Theory

The course builds on the course QFT1 and QFT2 and develops in parallel to the course on Gauge Theories and the SM. ...

Description

This lecture covers the concept of renormalization in the context of Algebraic Quantum Field Theory (AQFT), focusing on loop integrals, power counting, and the superficial degree of divergence of graphs. The instructor discusses the process of renormalization and the challenges of dealing with divergences in quantum field theory.

Instructors (5)

Xiang Zhao

Riccardo Rattazzi

Riccardo Rattazzi was born in Novara (Italy) in 1964. He studied physics at the University of Pisa, where he received the Laurea cum laude in 1987, and at the Scuola Normale Superiore where he received the Diploma in Scienze and carried out graduate research in theoretical physics. After having been a post-doctoral research associate at the Lawrence Berkeley Laboratory, at Rutgers University and at CERN, in 1998 Riccardo obtained a permanent research position at the Istituto Nazionale di Fisica Nucleare in Pisa. From 2001 to 2006 he was a staff member at the Theory Division of CERN. In 2006 he was appointed professor of physics at EPFL.

Brando Bellazzini

Alexander Monin

Jiaxin Qiao

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Planar graph

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.

Quantum field theory

In theoretical physics, quantum field theory (QFT) is a theoretical framework that combines classical field theory, special relativity, and quantum mechanics. QFT is used in particle physics to construct physical models of subatomic particles and in condensed matter physics to construct models of quasiparticles. QFT treats particles as excited states (also called quanta) of their underlying quantum fields, which are more fundamental than the particles.

Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G). The name line graph comes from a paper by although both and used the construction before this.

Renormalization

Renormalization is a collection of techniques in quantum field theory, statistical field theory, and the theory of self-similar geometric structures, that are used to treat infinities arising in calculated quantities by altering values of these quantities to compensate for effects of their self-interactions. But even if no infinities arose in loop diagrams in quantum field theory, it could be shown that it would be necessary to renormalize the mass and fields appearing in the original Lagrangian.

Petersen graph

In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by .

Related lectures (26)

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Automorphism groups of trees and graphs

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Graph Algorithms II: Traversal and Paths