SearcharxivSearch

arXiv · 1005.3802

Brownian-Time Processes: The PDE Connection II and the Corresponding Feynman-Kac Formula

Abstract

We delve deeper into our study of the connection of Brownian-time processes (BTPs) to fourth order parabolic PDEs, which we introduced in a recent joint article with W. Zheng. Probabilistically, BTPs and their cousins BTPs with excursions form a unifying class of interesting stochastic processes that includes the celebrated IBM of Burdzy and other new intriguing processes, and is also connected to the Markov snake of Le Gall. BTPs also offer a new connection of probability to PDEs that is fundamentally different from the Markovian one. They solve fourth order PDEs in which the initial function plays an important role in the PDE itself, not only as initial data. We connect two such types of interesting and new PDEs to BTPs. The first is obtained by running the BTP and then integrating along its path, and the second type of PDEs is related to what we call the Feynman-Kac formula for BTPs. A special case of the second type is a step towards a probabilistic solution to linearized Cahn-Hilliard and Kuramoto-Sivashinsky type PDEs, which we tackle in an upcoming paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Hassan Allouba. 2010-05-20. Brownian-Time Processes: The PDE Connection II and the Corresponding Feynman-Kac Formula. https://doi.org/10.1090/s0002-9947-02-03074-x

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR