Convolution power

In mathematics, the convolution power is the ''n''-fold iteration of the convolution with itself. Thus if $x$ is a Function (mathematics), function on Euclidean space R^''d'' and $n$ is a natural number, then the convolution power is defined by

:$x^ = \underbrace_n,\quad x^=\delta_0$

where ∗ denotes the convolution operation of functions on R^''d'' and δ₀ is the Dirac delta distribution. This definition makes sense if ''x'' is an integrable function (in Lp space, L¹), a rapidly decreasing distribution (mathematics), distribution (in particular, a compactly supported distribution) or is a finite Borel measure.

If ''x'' is the distribution function of a random variable on the real line, then the ''n''^th convolution power of ''x'' gives the distribution function of the sum of ''n'' independent random variables with identical distribution ''x''. The central limit theorem states that if ''x'' is in L¹ and L² with mean zero and variance σ², then
:$P\left(\frac < \beta\right) \to \Phi(\beta)\quad\rm\ n\to\infty$
where Φ is the cumulative standard normal distribution on the real line. Equivalently, $x^/\sigma\sqrt$ tends weakly to the standard normal distribution.

In some cases, it is possible to define powers ''x''^*''t'' for arbitrary real ''t'' > 0. If μ is a probability measure, then μ is Infinite divisibility (probability), infinitely divisible provided there exists, for each positive integer ''n'', a probability measure μ_1/''n'' such that

:$\mu_^ = \mu.$

That is, a measure is infinitely divisible if it is possible to define all ''n''th roots. Not every probability measure is infinitely divisible, and a characterization of infinitely divisible measures is of central importance in the abstract theory of stochastic processes. Intuitively, a measure should be infinitely divisible provided it has a well-defined "convolution logarithm." The natural candidate for measures having such a logarithm are those of (generalized) Poisson process, Poisson type, given in the form

:$\pi_ = e^\sum_^\infty \frac\mu^.$

In fact, the Lévy–Khinchin theorem states that a necessary and sufficient condition for a measure to be infinitely divisible is that it must lie in the closure, with respect to the vague topology, of the class of Poisson measures .

Many applications of the convolution power rely on being able to define the analog of analytic functions as formal power series with powers replaced instead by the convolution power. Thus if $\textstyle$ is an analytic function, then one would like to be able to define

:$F^*(x) = a_0\delta_0 + \sum_^\infty a_n x^.$

If ''x'' ∈ ''L''¹(R^''d'') or more generally is a finite Borel measure on R^''d'', then the latter series converges absolutely in norm provided that the norm of ''x'' is less than the radius of convergence of the original series defining ''F''(''z''). In particular, it is possible for such measures to define the convolutional exponential

:$\exp^*(x) = \delta_0 + \sum_^\infty \frac.$

It is not generally possible to extend this definition to arbitrary distributions, although a class of distributions on which this series still converges in an appropriate weak sense is identified by .

Properties

If ''x'' is itself suitably differentiable, then from the Convolution#Differentiation, properties of convolution, one has

:$\mathcal\big\ = (\mathcalx) * x^ = x * \mathcal\big\$

where $\mathcal$ denotes the derivative operator. Specifically, this holds if ''x'' is a compactly supported distribution or lies in the Sobolev space ''W''^1,1 to ensure that the derivative is sufficiently regular for the convolution to be well-defined.

Applications

In the configuration random graph, the size distribution of Connected component (graph theory), connected components can be expressed via the convolution power of the excess degree distribution ():
:$w(n)=\begin \frac u_1^(n-2),& n>1, \\ u(0) & n=1. \end$
Here, $w(n)$ is the size distribution for connected components, $u_1(k) = \frac u(k+1),$ is the excess degree distribution, and $u(k)$ denotes the degree distribution.

As convolution algebras are special cases of Hopf algebras, the convolution power is a special case of the (ordinary) power in a Hopf algebra. In applications to quantum field theory, the convolution exponential, convolution logarithm, and other analytic functions based on the convolution are constructed as formal power series in the elements of the algebra . If, in addition, the algebra is a Banach algebra, then convergence of the series can be determined as above. In the formal setting, familiar identities such as
:$x = \log^*(\exp^*x) = \exp^*(\log^*x)$
continue to hold. Moreover, by the permanence of functional relations, they hold at the level of functions, provided all expressions are well-defined in an open set by convergent series.

See also

*Convolution
*Convolution theorem
*Fourier transform
*Taylor series

References

* .
* .
* .
* .
* .
* .
* {{Citation , last1=Kryven , first1=I , title=General expression for component-size distribution in infinite configuration networks , year=2017 , journal=Physical Review E , volume=95 , issue=5 , pages=052303 , doi=10.1103/physreve.95.052303, arxiv=1703.05413 , bibcode=2017PhRvE..95e2303K , pmid=28618550 , s2cid=8421307 .

Functional analysis
Fourier analysis