Math 2.0

Probability theory and stochastic processes Definition

Potential operator of a Markov process

Builds on Markov kernelExcessive functionWiener processResolventInfinitesimal generator of a Markov process

Definition

Let (E,ℰ)(E, \mathcal{E}) be a measurable space and let (Pt)t≥0(P_t)_{t \ge 0} be a sub-Markov transition semigroup on EE. So the PtP_t are kernels as for Markov kernels but with Pt(x,E)≤1P_t(x, E) \le 1, and PsPt=Ps+tP_s P_t = P_{s+t}. Assume that (t,x)↦Pt(x,A)(t, x) \mapsto P_t(x, A) is measurable on [0,∞)×E[0, \infty) \times E for each A∈ℰA \in \mathcal{E}. The potential operator (or potential kernel) of (Pt)(P_t) is the kernel UU given by U(x,A)=∫0∞Pt(x,A) dt∈[0,∞],x∈E, A∈ℰ.U(x, A) = \int_0^\infty P_t(x, A) \, dt \in [0, \infty], \qquad x \in E, \ A \in \mathcal{E}. For measurable f ⁣:E→[0,∞]f \colon E \to [0, \infty] it acts by Uf(x)=∫0∞Ptf(x) dtU f(x) = \int_0^\infty P_t f(x) \, dt.

Remarks

If (Xt)(X_t) is a Markov process with semigroup (Pt)(P_t) and law PxP^x when started at xx, then Uf(x)=Ex∫0∞f(Xt) dtU f(x) = E^x \int_0^\infty f(X_t) \, dt. So U(x,A)U(x, A) is the expected total time that the process spends in AA. For each measurable f≥0f \ge 0, the function UfU f is excessive. Example: for Brownian motion in ℝ3\R^3, the Gaussian integral ∫0∞(2πt)−3/2e−r2/2t dt=1/(2πr)\int_0^\infty (2\pi t)^{-3/2} e^{-r^2/2t} \, dt = 1/(2\pi r) gives U(x,A)=∫Ady2π∣x−y∣.U(x, A) = \int_A \frac{dy}{2\pi \abs{x - y}}. Non-example of finiteness: for Brownian motion in ℝ2\R^2, U(x,A)=∞U(x, A) = \infty for every nonempty open AA, so UU is not a useful kernel there; the process is recurrent. UU is the limit as α↓0\alpha \downarrow 0 of the resolvent Uα=∫0∞e−αtPt dtU_\alpha = \int_0^\infty e^{-\alpha t} P_t \, dt. When LL is the infinitesimal generator and UfU f is finite and in the domain of LL, one has −LUf=f-L U f = f. In discrete time the analogue is U=∑n≥0PnU = \sum_{n \ge 0} P^n, the Green kernel of a Markov chain.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Excessive function concept
  2. Infinitesimal generator of a Markov process concept
  3. Markov kernel concept
  4. Resolvent concept
  5. Wiener process concept
  6. Potential operator of a Markov process definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Markov_kernel
About this page
TagC6EC4SBEMC
URIm2://C6EC4SBEMC
Kinddefinition
WritingW0 stub
MSC60J45, 60J35
DefinesPotential operator of a Markov process
UsesMarkov kernel, Excessive function, Wiener process, Resolvent, Infinitesimal generator of a Markov process

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.