Feynman Diagrams and Map Enumeration
The goal of this thesis is to count how many graphs exist given a number of verticesor some other restrictions. The graphs are counted by perturbing Gaussian integralsand using the Wick lemma to interpret the perturbations in terms of graphs. Fatgraphs, a specific type of graph, are central in this...
Main Author: | Egebrand, August |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Teoretisk fysik
2016
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-298474 |
Similar Items
-
Feynman diagrams and rooted maps
by: Prunotto Andrea, et al.
Published: (2018-04-01) -
Periods of Feynman Diagrams
by: Nasrollahpoursamami, Emad
Published: (2017) -
Feynman diagrams versus Fermi-gas Feynman emulator
by: Sommer, Ariel Tjodolv, et al.
Published: (2013) -
Generalized planar Feynman diagrams: collections
by: Francisco Borges, et al.
Published: (2020-11-01) -
Graphons and renormalization of large Feynman diagrams
by: Ali Shojaei-Fard
Published: (2018-01-01)