
TL;DR
This paper introduces a new complex-analytic method for the Skorokhod embedding theorem, allowing the construction of barriers that produce Brownian motion hitting points with any prescribed centered distribution with finite variance.
Contribution
It provides a constructive, explicit approach to the Skorokhod embedding problem using complex analysis, expanding the toolkit for stochastic process embedding techniques.
Findings
Constructed barriers for prescribed distributions
Provided explicit descriptions of barriers
Offered a new proof of the Skorokhod embedding theorem
Abstract
Start a planar Brownian motion and let it run until it hits some given barrier. We show that the barrier may be crafted so that the x coordinate at the hitting time has any prescribed centered distribution with finite variance. This provides a new, complex-analytic proof of the Skorokhod embedding theorem. Our method is constructive and can give an explicit description of the barrier.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A conformal Skorokhod embedding
Renan Gross Weizmann Institute of Science. Email: [email protected]. Supported by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities.
Abstract
Start a planar Brownian motion and let it run until it hits some given barrier. We show that the barrier may be crafted so that the coordinate at the hitting time has any prescribed centered distribution with finite variance. This provides a new, complex-analytic proof of the Skorokhod embedding theorem. Our method is constructive and can give an explicit description of the barrier.
1 Introduction
The Skorokhod embedding problem asks the following: Given a Brownian motion and a probability distribution with expectation zero and finite variance, find a stopping time so that and .
There have been numerous solutions to this formulation and to several variations and generalizations over the years. See Obłój’s extensive survey [8] for a detailed account of the problem, its characteristics and applications.
One important solution is given by Root [9], who sets as the first time that the graph of the Brownian motion hits some barrier . Root’s solution does not use any additional randomness. Finding out the barrier , however, is often a difficult task, and not many explicit solutions are known (but see [4] for constructions relying on solutions to PDEs).
In this paper, we present a new solution to the Skorokhod embedding problem. Our method is similar to Root’s, in that the stopping time is the first hitting time of some barrier by a Brownian motion. The method requires additional randomness in the form of another independent Brownian motion, but can offer tractable analytic expressions for calculating the shape of the barrier explicitly.
For a domain and a planar Brownian motion with , let be the first time that exits the domain ,
[TABLE]
Theorem 1**.**
Let be a probability distribution on with zero expectation and finite variance. There exists a simply connected domain containing the origin such that if is a standard planar Brownian, then has distribution .
The proof of Theorem 1 is given in the next section. Section 3 gives properties and examples of . Finally, in Section 4 we exhibit some open questions.
2 Proof of theorem
Proof.
We identify with the complex plane . Denote the open unit disc by and the unit circumference by .
Denote by the cumulative distribution function of , and by its generalized inverse:
[TABLE]
Observe that both and are monotone increasing. Despite the fact that may diverge at [math] and , it is still in : If is a uniform random variable on then distributes as , and so
[TABLE]
Define the function by
[TABLE]
The function may be viewed as a periodic function on with period , with the possibility of it diverging at integer multiples of . It is an even function in , and thus has a Fourier series representation containing only cosines. Denote the -th Fourier coefficient of by , and recall that by Carleson’s theorem [2] for an function, the Fourier representation agrees with almost everywhere.
Let be the complex function defined by
[TABLE]
The function may not necessarily be defined for points on the unit circle, but its real part is well-defined for almost all such points. Indeed, let with , then
[TABLE]
So on the unit circle, the real part of agrees with almost everywhere.
Since by the Riemann-Lebesgue lemma, the function is analytic (and non constant) in the open disc , and so the image is some connected domain in . As all the coefficients of are real, this domain is symmetric to conjugation: , i.e it is symmetric to reflection about the axis.
Proposition 2**.**
* is one-to-one in the unit disc .*
Proof.
The proof relies on the following theorem, which can be found in [3, chapter VIII.3]:
Theorem 3**.**
Let be a sequence of one-to-one analytic functions on a domain that converge uniformly on every compact subset of to a function . Then is either one-to-one or constant.
All we have to do then is find a sequence of one-to-one functions which converge to uniformly on every compact subset of . Let be a sequence of bounded, twice differentiable, strictly increasing functions satisfying
in . 2. 2.
The first and second derivatives of are in . 3. 3.
and .
Such a sequence may be found, for example, by taking step-function approximations of on increasingly finer partitions of , smoothingly interpolating the jump discontinuities, and adding some small strictly increasing smooth function.
For each , define the corresponding and as in equations (1) and (2). By properties (2) and (3) above, the are also smooth and their derivatives are all in . Using the fact that if a function is -times differentiable and then , we get that the Fourier coefficients are absolutely convergent, and so can be extended to the closed disc . This allows us to look at the image of the unit circle under .
Parameterize the circle by for . As increases from to [math], strictly decreases from to , and as increases from [math] to , strictly increases from to . Further, using the Hilbert transform equation (4) in Section 3, it can be directly calculated that is always positive for and always negative for . Thus, the image is a simple loop. Since the preimage of is a subset of (this is a consequence of the maximum principle: If an interior point were mapped to , we could obtain a local maximum for ), we have that . So for every , winds around exactly once. By Cauchy’s argument principle, this means that has exactly one preimage in under , i.e is one-to-one.
All that remains is to show that converge uniformly to on every compact subset . To see this, note that is contained in some closed disc of radius . Denoting with , we have
[TABLE]
The sum converges, and the supremum converges to [math] uniformly in since for each we have
[TABLE]
and this integral converges to [math] since converges to in . ∎
Having established that is one-to-one, we can invoke the conformal invariance of Brownian motion, which can be found in [7, Theorem 7.20]:
Theorem 4**.**
Let be a domain in the complex plain, and be analytic. Let be a planar Brownian motion started in . Then the process is a time-changed Brownian motion, i.e there exists a planar Brownian motion such that for any ,
[TABLE]
where
[TABLE]
If is one-to-one then is the first exit time from by .
Thus, the process is a time-changed Brownian motion, i.e there exists a planar Brownian motion and a monotone function such that . The domain has the properties that we are looking for:
Upon hitting the boundary, distributes as : The position of is uniform on the unit circle and the real part of is made of two (reflected) copies of , so by the inverse transform sampling method we get that distributes as . 2. 2.
hits the boundary in finite time. This is an immediate consequence of the following lemma:
Lemma 5** (Lemma 1.1 in [1]).**
Suppose that is a conformal mapping from the unit disc onto a domain with . Then
[TABLE]
Since is in , the right hand side of equation (3) is finite. Since is a martingale with expectation [math], we get by the optional stopping theorem that
[TABLE]
implying . 3. 3.
The process starts at [math], i.e : The imaginary component is [math] since is symmetric to complex conjugation, and the real component is [math] since is a martingale and distributes as , so that . 4. 4.
is simply connected by Brouwer’s invariance of domain theorem, which states that:
Theorem 6** (Theorem 1 in chapter 1 in [10]).**
If is open and is one-to-one and continuous, then f is a homeomorphism.
∎
3 Properties and examples
In this section, we will see examples of domains for various distributions. Numeric approximations of for Bernoulli, Gaussian and Cantor distributions, as well as some distribution on the natural numbers, can be found in Figure 1.
Some easy properties of can immediately be gathered from :
If is an atom of , i.e , then contains a straight line segment at , i.e for some numbers . 2. 2.
If is an interval with then contains the infinite rectangle . 3. 3.
If the support of is infinite, then the projection of onto the axis is unbounded.
One can describe by looking at its boundary , and in general it is useful to do this by considering how the curve behaves as traverses from to . Of course, for some distributions both the real part and the imaginary part of can be infinite, in the latter case even countably many times, so really sits in the Riemann sphere.
When calculating , the real part is already known - it is just equal to
- so all that is left to do is to find the imaginary part. The relation between the real part and the imaginary part of is given by replacing all cosines with sines in the series expansion of :
[TABLE]
Alternatively, the imaginary part is obtained from the real part by the Hilbert transform operator , which, for a function , is given by
[TABLE]
where is Cauchy’s principal value. One way to see that this is true is to note that the Hilbert transform is linear and maps the function to for positive integers . For a comprehensive source on the Hilbert transform, see [6].
There are therefore two straightforward ways to go about studying . The first is to inspect the series directly, and the second is to consider the Hilbert transform of . In the next two subsections, we will see both approaches.
3.1 Discrete distributions
Let be an atomic distribution, supported on a (possibly infinite) discrete set of values , which obtains with probability :
[TABLE]
The cumulative distribution function is then just a sum of step functions,
[TABLE]
and so is the inverse and the symmetric . We write
[TABLE]
for some weights and thresholds (these can be calculated explicitly from and , but we omit the calculations for brevity).
As noted in items (1) and (2) above, the boundary consists of infinite rays of the form and for some values . If there is an extremal value or among the ’s, then clearly contains the infinite line .
As the ’s give a complete characterization of , calculating them may be of interest.
Theorem 7**.**
Each is given by
[TABLE]
where is a solution to the equation
[TABLE]
Proof.
Although may be discontinuous and even infinite, it is differentiable almost everywhere; in fact, by section III.2.10 in [5], if is constant in an interval, then is analytic there. This means that is piecewise analytic, since is piecewise constant except for a discrete set of jumps at .
The ’s can therefore be calculated by finding the local minima and maxima of , and these in turn are obtained by differentiation.
Our first step is to calculate . As noted at the beginning of the section, the relation between and is given by the Hilbert transform . Since is a linear operator, we first compute the Hilbert transform of a single step function.
Lemma 8**.**
Let be a periodic step function, i.e
[TABLE]
for some , with . Then
[TABLE]
Proof.
Denote by the square pulse of half-width around the origin:
[TABLE]
Then is the sum of infinitely many square pulses, each with half-width :
[TABLE]
The Hilbert transform of a single square pulse can readily be calculated to be
[TABLE]
The Hilbert transform commutes with shifts, and so
[TABLE]
This is an expression of the form form
[TABLE]
with and . It can be shown that a product in the form of equation (6) is equal to
[TABLE]
(to see this, recall Euler’s infinite product identity for the sine function, ) . We then have
[TABLE]
∎
Differentiating Equation (5) in Lemma 8, each is therefore given by where is a zero of the derivative of :
[TABLE]
∎
3.2 The uniform distribution
Let be the uniform distribution on , so that
[TABLE]
the inverse function is , and . The Fourier series of is given by
[TABLE]
which gives
[TABLE]
The boundary is given in Figure 1b. The component of is then given by
[TABLE]
Differentiating by , we get
[TABLE]
If we denote by the inverse Gudermannian function, then a short calculation reveals that
[TABLE]
Thus the domain is bounded by the parametric curve
[TABLE]
This integral may be solved with the assistance of computational software; the antiderivative of is given by
[TABLE]
where is the polylogarithm function,
[TABLE]
4 Other directions and open questions
For a given measure , the domain in Theorem 1 is not unique, even if we require to be simply connected and symmetric to conjugation (see Figure 2 for two different domains giving the same distribution). Is there any distinguishing trait to the construction given above? Can we deduce properties of from properties of ? For example,
Question 9**.**
For what measures is the domain in Theorem 1 convex?
Theorem 1 utilizes the conformal invariance of Brownian motion and uses complex-analytic tools, and so relies on the fact that the Brownian motion is planar. However, we may ask similar hitting-time questions concerning the marginal distribution of the first coordinates of a stopped Brownian motion in higher dimensions. It is already well known that not every distribution on can be generated this way: For example, high dimensional Brownian motion does not hit points, so any containing atoms cannot be obtained. What can we say about measures for which we already know that there is a Skorokhod embedding?
Question 10**.**
Let be a distribution on for which there exists a Skorokhod embedding. Is there a domain for some so that is a Skorokhod embedding for ?
5 Acknowledgments
The author thanks Itai Benjamini, Krzysztof Burdzy, Ronen Eldan, Boa’z Klartag and Dan Mikulincer for their insightful comments and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Rodrigo Bañuelos and Tom Carroll. Brownian motion and the fundamental frequency of a drum. Duke Math. J. , 75(3):575–602, 1994.
- 2[2] Lennart Carleson. On convergence and growth of partial sums of fourier series. Acta Math. , 116:135–157, 1966.
- 3[3] Theodore W. Gamelin. Complex analysis . Undergraduate Texts in Mathematics. Springer-Verlag, New York, 2001.
- 4[4] Paul Gassiat, Harald Oberhauser, and Gonçalo dos Reis. Root’s barrier, viscosity solutions of obstacle problems and reflected fbsdes. Stochastic Processes and their Applications , 125(12):4601 – 4631, 2015.
- 5[5] Yitzhak Katznelson. An introduction to harmonic analysis . Dover Publications, Inc., New York, corrected edition, 1976.
- 6[6] Frederick W. King. Hilbert transforms. Vol. 1 , volume 124 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, 2009.
- 7[7] Peter Mörters and Yuval Peres. Brownian motion , volume 30 of Cambridge Series in Statistical and Probabilistic Mathematics . Cambridge University Press, Cambridge, 2010. With an appendix by Oded Schramm and Wendelin Werner.
- 8[8] Jan Obłój. The skorokhod embedding problem and its offspring. Probab. Surveys , 1:321–392, 2004.
