2019
DOI: 10.1063/1.5031429
|View full text |Cite
|
Sign up to set email alerts
|

Graph rules for the linked cluster expansion of the Legendre effective action

Abstract: Graph rules for the linked cluster expansion of the Legendre effective action Γ[φ ] are derived and proven in D ≥ 2 Euclidean dimensions. A key aspect is the weight assigned to articulation vertices which is itself shown to be computable from labeled tree graphs. The hopping interaction is allowed to be long ranged and scale dependent, thereby producing an in principle exact solution of Γ[φ ]'s functional renormalization group equation.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 21 publications
0
7
0
Order By: Relevance
“…The direct solution of the recursion quickly becomes impractical, both manually and by computer. Instead, a graph theoretical approach was developed in [6] and leads to a closed formula for Γ l [φ] (without having to work out the lower orders first). A graph L = (V, E) comprises a set of vertices V, a set of edges (or lines) E, and the information that pairs of vertices are connected by (possibly several) edges.…”
Section: Linked Cluster Expansions and Frgmentioning
confidence: 99%
See 2 more Smart Citations
“…The direct solution of the recursion quickly becomes impractical, both manually and by computer. Instead, a graph theoretical approach was developed in [6] and leads to a closed formula for Γ l [φ] (without having to work out the lower orders first). A graph L = (V, E) comprises a set of vertices V, a set of edges (or lines) E, and the information that pairs of vertices are connected by (possibly several) edges.…”
Section: Linked Cluster Expansions and Frgmentioning
confidence: 99%
“…(d) Use the separate "dashed graph rule" invoking only labeled tree graphs to obtain µ v . In particular, The "dashed graph rule" producing µ v in (d) is described in Section 3 of [6] for Euclidean signature QFT on Z 1+d . It carries over with minor modifications to the spatial LCE at hand.…”
Section: Theorem 1 ([6]) (γ Graph Rule)mentioning
confidence: 99%
See 1 more Smart Citation
“…We expect it to be true generally whenever the full spatial FRG can be rendered well-defined. A systematic proposal to do so based on a spatial hopping expansion [10,11] will be presented elsewhere. The state dependence of the spatial EPA flow will be studied in Section 4.…”
Section: Introductionmentioning
confidence: 99%
“…The direct recursion turns out to become intractable beyond O(κ 6 ), say. However, a closed graph theoretical solution of the recursion can be obtained that yields Γ l for any l ≥ 1 [3]. Importantly, the series in (1.3) can be expected to have finite radius of convergence κ < κ c , at least as far as the associated vertex functions are concerned [9].…”
Section: Introductionmentioning
confidence: 99%