Hayahide Ito
Graduate School of Engineering Science, Osaka University, Osaka 560-8531, Japan
h-ito@sigmath.es.osaka-u.ac.jp
Abstract.
We construct a procedure for Bogoliubov–Parasiuk–Hepp–Zimmermann (BPHZ) renormalization of a rough path in view of the relation between rough path theory and regularity structure. We also provide a plain expression of the BPHZ-renormalized model in a rough path. BPHZ renormalization plays a central role in the theory of singular stochastic partial differential equations and assures the convergence of the model in the regularity structure. Here we demonstrate that the renormalization is also effective in a rough path setting by considering its application to rough path theory and mathematical finance.
2020 Mathematics Subject Classification:
Primary 60L30, Secondary 60L20, 91-10
1. Introduction
We consider the following Itô-type stochastic integral: for and a smooth function ,
(1.1)
where is a standard one-dimensional Brownian motion, and is a fractional Brownian motion with Hurst parameter given by
Integral (1.1) emerges in option pricing in a financial market with rough volatility (see [1]), so the Wong–Zakai approximation of (1.1) is valuable for financial mathematics. However, for any mollifier , the limit
does not exist in general, where , , and . This failure is due to fractional Brownian motion having lower regularity than Brownian motion . Bayer et al. [1] demonstrated the following revised Wong–Zakai approximation by adding a term to prevent the divergence.
Theorem 1.1.
Let . Then, we have the following limit:
(1.2)
The result is proved by the theory of regularity structures by Hairer [8]. The following sketch illustrates the relations between the convergence of the integral and the regularity structure.
We construct a regularity structure and a model compatible with the integral . Because model does not converge to any model simply , we revise it by adding some terms to obtain model . This procedure is called renormalization, and is called a renormalized model. We can show that the renormalized model converges to a model in the norm of model . We can also show that the renormalized model and the model correspond to the revised integral and the Itô integral , respectively.
The renormalized model can be written explicitly as
(1.3)
This renormalization stems from probabilistic and analytic results such as a decomposition by the Wick product and a transformation into the Skorokhod integral; see, for example, [1, Lemma 3.9] and [1, Lemma 3.11].
Meanwhile, Bruned et al. [6] demonstrated an algebraic procedure for renormalization in regularity structures, known as Bogoliubov–Parasiuk–Hepp–Zimmermann (BPHZ) renormalization, and Chandra and Hairer [7] showed that a model subjected to BPHZ renormalization converges to some model under desired conditions. Thus, BPHZ renormalization is key in the theory of regularity structures.
Also, study of the relation between rough paths and regularity structures gave rise to discussion on the renormalization of rough paths, given that they are a counterpart of regularity structures ([3], [4], [5]).
To supplement the current trend in the theory of regularity structures, herein we focus on BPHZ renormalization of a regularity structure corresponding to a rough path generated by Gaussian processes. We also consider an application of BPHZ renormalization to the Wong–Zakai approximation of integral (1.1). The central theorem in this article is as follows, which corresponds to Theorem 2.7.
Theorem 1.2.
Let symbols correspond to Gaussian processes , respectively. Let be a model expressing the rough path generated by , and let be the BPHZ-renormalized model of . Assume that for any , is a normal distribution with zero mean.
For and , we have
(1.4)
In addition, if for , and , then we have
(1.5)
The result of Theorem 1.2 demonstrates a plain and handy expression of BPHZ renormalization under the assumption of a rough path generated by Gaussian processes, while Bruned et al. [6] provided BPHZ renormalization in a more general setting.
We apply Theorem 1.2 to the Wong–Zakai approximation, leading to the following theorem that corresponds to Theorem 3.4.
Theorem 1.3.
The processes and correspond to Brownian motion and fractional Brownian motion convoluted by a mollifier, respectively. Then, we have
(1.6)
Comparing (1.3) with (1.6), we realize that BPHZ renormalization is mostly similar to the counterpart given by Bayer et al. [1]. In addition, Theorem 3.5 shows that the BPHZ-renormalized model converges to a naive model , leading to BPHZ renormalization also being effective in the Wong–Zakai approximation in integral (1.1).
This article is organized as follows. In Section 2, we discuss the construction of a model on the regularity structure and define the BPHZ renormalization of that model. In particular, we provide a simple expression of the BPHZ-renormalized model in symbols corresponding to a geometric rough path, provided that the noises are Gaussian. In Section 3, we consider applying these results to a rough volatility model in a financial market, and we demonstrate the correspondence between the renormalization in [1] and BPHZ renormalization.
2. Regularity Structure of Gaussian Rough Paths
In this section, we construct a regularity structure of Gaussian rough paths, which reflects a regularity structure expressing integral (1.1). We also consider BPHZ renormalization in the regularity structure and provide a plain expression of the renormalization.
Let be a stochastic process on such that it has -continuity almost surely, where . Also, let , where and is a smoothing mollifier.
We denote simply by unless must be emphasized.
Now, we construct a regularity structure that can express the integrals
(2.1)
2.1. Symbols and Tree Expression
First, we introduce symbols corresponding to the integrands and integrations in (2.1), which are fundamental elements in the regularity structure.
A finite set and a map are defined respectively as
(2.2)
(2.3)
Remark 2.1.
The set corresponds to the symbols that express kernels and noises, so we set . Also, corresponds to the convolution of the kernel with to , respectively. The degree corresponds to the regularity of the noise or kernel, so we set and where .
where the sum is over all emerging in . For example,
•
A group is given by
(2.5)
(2.6)
for such that .
We can easily show that the triplet is a regularity structure.
An element in can be viewed as a rooted tree by the relations shown below (see Appendix A for details of rooted trees).
2.2. Model on the Regularity Structure
We construct a model on the regularity structure to translate an abstract symbol in into a concrete function.
We define as
Now, we define a model on by using the map . The pair is given by the following.
•
For , a map is defined as
for such that , and the domain is extended by imposing linearity.
•
For , a map is defined as
for such that , and the domain is extended by imposing linearity.
2.3. BPHZ Renormalization
We revise the model defined in Section 2.2 along the lines of the discussion in [6].
First, we introduce negative renormalization in a regularity structure.
As follows, we define a set that plays a central role in negative renormalization:
(2.7)
(2.8)
where is the disjoint union in set theory. By convention, we replace with , which is called a forest product in [6].
Definition 2.2.
(1)
Let . Let be a subforest of , that is, or consists of edges included in . Then, we define as a forest obtained by trimming edges of from . is called a contraction of by .
(2)
We define a map as
(2.9)
where is a subforest of and is the contraction of by , and
where and . The restriction denotes simply unless confusion occurs.
Example 2.3.
(1)
Let , , and . Then, we have
because and are obtained by trimming the edge and , respectively.
(2)
We have
Definition 2.4.
(1)
A subspace is defined as
(2)
A quotient space is defined as , and denotes the canonical projection.
(3)
We define a map as .
The map takes forests including a tree with negative degree, which is ill-posed in taking a limit, from a whole tree. BPHZ renormalization involves finding ill-posed symbols and adding extra terms there to prevent divergence, so becomes a part of BPHZ renormalization and plays a role in finding these symbols.
Definition 2.5.
For the random linear map defined above, we define the following.
(1)
A character on is defined inductively as
(2)
A twisted negative antipode is defined recursively as
where maps to , and is a canonical injective.
(3)
A pair is defined as
(2.10)
(2.11)
This pair is actually a model on by [6, Theorem 6.16], and we call this the BPHZ-renormalized model.
so it is not obvious that is equal to . For the proof of that equality, see the Appendix B.
Now, we give a plain expression of the BPHZ-renormalized model in a branched rough path, which is the central result herein.
Theorem 2.7.
Assume that for any , is a normal distribution with zero mean.
Then, for any , we have
(2.12)
In addition, if for , and , then we have
(2.13)
Before proving this theorem, we prepare the following lemmas.
Lemma 2.8.
Let random variables be centered jointly normal variables. Then we have
(2.14)
where the sum is taken over the set of disjoint partitions of . In particular, the left-hand side of the above expression is identical to zero if is odd.
We calculate . Because there exists no tree such that and , we have
Next, we show (2.13).
By using (2.16) in Lemma 2.9, we have
and thus we deduce the conclusion.
∎
3. Application to a Rough Volatility Model
In this section, we provide an example of applying BHPZ renormalization to rough paths. As discussed in [1] and [2], we set a regularity structure compatible with a rough volatility model in a financial market.
In [1], the following integral is considered:
(3.1)
where is a Brownian motion and is a fractional Brownian motion with Hurst parameter . Here, we define the fractional Brownian motion in Riemann–Liouville form, that is, where .
Remark 3.1.
We do not directly define the model using fractional Brownian motion as a driving noise because does not possess stationarity. Instead, as in [2], we use a stationary noise to approximate .
Here, the process is defined as , where is a white noise on , and the kernel is smooth on and satisfies the following properties:
(1)
on and ;
(2)
there exists a constant such that for , we have
We construct a regularity structure as follows.
•
We define a vector space as
where .
•
We define a degree in as
and we define a set .
•
We define a structure group as
The next step is to construct the model on .
We prepare the notation defined as
Definition 3.2.
We set the naive model in as
and
where is a white noise on , and is the derivative of in a distributional sense.
Following the procedure given in Section 2, we generate a model with smoothing noises.
We fix a mollifier and set , , and for .
Definition 3.3.
We define the smooth model in as
and
Equations (2.10) and (2.11) are well-defined in each symbol so that we can construct the BPHZ-renormalized model in as in Definition 2.5. By Theorem 2.7, we have the following theorem.
Theorem 3.4.
We have
(3.2)
(3.3)
and we also have .
Proof.
By applying Theorem 2.7 to the case of , , and , we deduce the conclusion immediately.
∎
This result corresponds to the renormalized model in [1] and [2]. In addition, BPHZ renormalization enables the model to converge to the naive model.
Theorem 3.5.
We have the following convergence in the norm of model :
(3.4)
Proof.
It is sufficient to prove the following claim: there exists such that
where .
The proof of these inequalities is similar to that in [1].
∎
Remark 3.6.
In [1], the renormalized model satisfies the following. For ,
where and .
The reason for this slight difference is that the model use raw noises such as Brownian motion and fractional Brownian motion but not the white noises and .
Appendix A Trees and Forests
In this article, trees and forests from graph theory are repeatedly used as symbols of regularity structures.
Definition A.1.
Let be an abstract finite set and be the subset of . We define maps as .
(1)
We say that the pair is a graph. The elements of are called vertices or nodes, and the elements of are called edges. If we want to emphasize , then denote the sets of vertices and edges as and , respectively.
(2)
The pair is called a simple directed graph if for any we have . For a simple directed graph and , is called the parent of , and is called the child of .
(3)
We say that is connected if for any there exists a sequence of edges such that , , and .
(4)
We say that have a cycle if there exists a set of edges such that one has and .
(5)
Let a simple directed graph be connected and have no cycle. If there exists a unique node such that for any , then the graph is called a rooted tree and the unique node is called the root of . We denote by the root of .
(6)
Let be a finite set, be a rooted tree, and be a map. The triplet is called a typed tree.
(7)
For any rooted trees , we define as
where , . This operation is called a tree product.
Throughout this article, we assume that a rooted tree has no node such that it has two or more parents, that is, for any rooted tree and any , we have .
Example A.2.
A rooted tree can be described as placing the root on the bottom as follows:
The tree product of and is expressed as
However, the graphs and defined below are not rooted trees because has two candidates for the root and has a loop.
Definition A.3.
(1)
A graph in which each connected component is a tree is called a forest. In addition, the forest is called a rooted forest if each connected component of it is a rooted tree.
(2)
Let be a finite set. The triplet such that is a rooted forest and is called a typed rooted forest.
Regarding the empty set as a forest, a vector space generated by the totality of rooted forests is a unital algebra in which the product is the disjoint union and the unit is the empty set. This product is called a forest product. We denote by the unit of a forest product unless confusion occurs.
Definition A.4.
A colored forest is a pair satisfying the following conditions.
(1)
is a typed rooted forest.
(2)
The map satisfies the following: for any such that , we have .
is called the coloring of . For , we set
Finally, we denote by the set of all colored forests.
Appendix B BPHZ Renormalization of
First, we introduce a positive renormalization, which is the foundation of .
A map is defined as
for such that , and the domain is extended by imposing linearity.
Note that a product on can be defined as .
Definition B.1.
(1)
A subspace is defined as
where is a tree product.
(2)
A quotient space generated by the above subspace is defined by
and denotes the canonical projection.
(3)
A map is defined as .
As defined, the vector space and the map can be given as
and
Definition B.2.
For , a map is defined as
for such that .
Note that .
The BPHZ renormalization of is as follows.
Definition B.3.
Let a pair be a model on the regularity structure . The BPHZ-renormalized model is defined by
The next proposition is the main subject of this subsection.
Proposition B.4.
We have
(B.1)
Proof.
The case where or is obvious. We consider the case where . Then, we have
The edge has positive degree , so we have . Thus, we have
Next, we show the claim when . Then, we have
For , we have because there exists no tree such that and . Thus, we have
∎
References
[1]
C. Bayer, P. K. Friz, P. Gassiat, J. Martin, and B. Stemper.
A regularity structure for rough volatility.
Mathematical Finance, 30(3):782–832, 2020.
[2]
C. Bellingeri, P. K. Friz, and M. Gerencsér.
Singular paths spaces and applications.
arXiv preprint arXiv:2003.03352, 2020.
[3]
Y. Bruned.
Renormalisation from non-geometric to geometric rough paths.
arXiv preprint arXiv:2007.14385, 2020.
[4]
Y. Bruned, I. Chevyrev, and P. K. Friz.
Examples of renormalized SDEs.
In International Conference on Stochastic Partial Differential
Equations and Related Fields, pages 303–317. Springer, 2016.
[5]
Y. Bruned, I. Chevyrev, P. K. Friz, and R. Preiss.
A rough path perspective on renormalization.
Journal of Functional Analysis, 277(11):108–283, 2019.
[6]
Y. Bruned, M. Hairer, and L. Zambotti.
Algebraic renormalisation of regularity structures.
Inventiones mathematicae, 215(3):1039–1156, 2019.
[7]
A. Chandra and M. Hairer.
An analytic BPHZ theorem for regularity structures.
arXiv preprint arXiv:1612.08138, 2016.
[8]
M. Hairer.
A theory of regularity structures.
Inventiones mathematicae, 198(2):269–504, 2014.
[9]
S. Janson.
Gaussian Hilbert spaces.
Number 129 in Cambridge tracts in mathematics. Cambridge University
Press, Cambridge, United Kingdom, 1997.