order to make this subtraction equivalent to the on-shell
renormalization,
21
it cannot be replaced by L
G
00
.
III. PROBABILITY DENSITY FUNCTIONS
FOR MONTE CARLO INTEGRATION
We use Feynman parameters for calculations. Thus, to
obtain the contribution of a graph G, we need to calculate
the integral
Z
z
1
;…;z
n
>0
Iðz
1
; …;z
n
Þδðz
1
þþz
n
− 1Þdz
1
…dz
n
;
where the function I is constructed by using the known
rules [30].
We use the Monte Carlo approach based on importance
sampling: we generate randomly N samples
z
1
; …; z
N
,
where
z
j
¼ðz
j;1
; …;z
j;n
Þ, using some probability density
function gð
zÞ and approximating the integral value by
1
N
X
N
j¼1
IðzÞ
gð
zÞ
: ð12Þ
The density g is fixed for a fixed graph G. The speed of
Monte Carlo convergence depends on the selection of g.A
construction of G that gives a good convergence is
described below.
We will use Hepp sectors [37] and functions of the form
that was first used by E. Speer [43] with some modifica-
tions. All the space R
n
is split
22
into sectors. Each sector
corresponds to a permutation ðj
1
; …;j
n
Þ of f1; 2; …;ng
and is defined by
S
j
1
;…;j
n
¼fðz
1
; …;z
n
Þ ∈ R∶z
j
1
≥ z
j
2
≥ … ≥ z
j
n
g:
We define the function g
0
ðz
1
; …;z
n
Þ on S
j
1
;…;j
n
by the
following relation:
g
0
ðz
1
; …;z
n
Þ¼
Q
n
l¼2
ðz
j
l
=z
j
l−1
Þ
Degðfj
l
;j
lþ1
;…;j
n
gÞ
z
1
z
2
…z
n
; ð13Þ
where DegðsÞ > 0 is defined for each set s of internal
lines
23
of G except the empty set and the set of all internal
lines of G. The probability density function is defined by
gðz
1
;…;z
n
Þ
¼
g
0
ðz
1
;…;z
n
Þ
R
z
1
;…;z
n
>0
g
0
ðz
1
;…;z
n
Þδðz
1
þþz
n
− 1Þdz
1
…dz
n
:
ð14Þ
A fast random samples generation algorithm for a given
DegðsÞ is described in Ref. [29].
Let us describe the procedure of obtaining DegðsÞ. The
following auxiliary definitions repeat the ones from
Ref. [29]. By definition, we set
ωðsÞ¼2N
L
ðsÞþjeðsÞj=2 − jsj;
where jxj is the cardinality of a set x, eðsÞ is the set of all
electron lines in s, and N
L
ðsÞ is the number of independent
loops in s.Ifs is the set of all internal lines of a subgraph of
G, then ωðsÞ coincides with the ultraviolet degree of
divergence of this subgraph that is defined above.
The problem of constructing a good gð
zÞ is very close to
the problem of obtaining a simple and close enough upper
bound for jIð
zÞj and proving the integral finiteness; see
Ref. [29]. Feynman parametric expressions for the inte-
grands (without subtraction terms) can be represented as
fractions with denominators that vanish on the boundary of
the integration area, if we are on the mass shell [30].If
we consider the numerators only, we can use the ultraviolet
degrees of divergence themselves; see Ref. [43].Ifwe
take into account the denominators too, the degrees
must be increased, which is performed by I-closures that
are defined below. In addition to vanishing denominators,
the divergence subtraction complicates the problem. The
construction described below is based on both theoretical
considerations
24
and numerical experiments.
By IClosðsÞ we denote the set s ∪ s
0
, where s
0
is the set
of all internal photon lines l in G such that s contains the
electron path in G connecting the ends of l. The set IClosðsÞ
is called the I-closure of the set s.
By definition, we set
ω
0
ðsÞ¼ωðIClosðsÞÞ:
A graph G
00
belonging to a forest F ∈ F½G is called a
child of a graph G
0
∈ F in F if G
00
⊊ G
0
and there is no
G
000
∈ F such that G
000
⊊ G
0
, G
00
⊊ G
000
.
If F ∈ F½G and G
0
∈ F, then by G
0
=F we denote the
graph that is obtained from G
0
by shrinking all children of
G
0
in F to points.
We will also use the symbols ω, ω
0
for graphs G
0
that are
constructed from G by some operations like those described
above,
25
and for sets s that are subsets of the set of internal
lines of the whole graph G. We will denote these by ω
G
0
ðsÞ
and ω
0
G
0
ðsÞ, respectively. This means that we apply the
operations ω and ω
0
in the graph G
0
to the set s
0
that is the
intersection of s and the set of all internal lines of G
0
.
Electron self-energy subgraphs and lines joining them
form chains l
1
G
1
l
2
G
2
…l
r
G
r
l
rþ1
, where l
j
’s are electron
21
See Sec. IV H and Ref. [30], Appendix B.
22
Let us remark that the components have intersections on their
boundaries. However, this is inessential for integration.
23
Note that the sets can be not connected.
24
Some of the ideas underlying the concept of I-closure and
this procedure of obtaining DegðsÞ will be described in future
papers. (These ideas are quite complicated and are not completely
substantiated mathematically at this moment.)
25
See the corresponding examples in Ref. [29] .
NUMERICAL CALCULATION OF HIGH-ORDER QED … PHYS. REV. D 98, 076018 (2018)
076018-5