Mathematics > Probability
[Submitted on 11 Apr 2018]
Title:Reflected Brownian motion on simple nested fractals
View PDFAbstract:We prove the existence of the reflected diffusion on a complex of an arbitrary size for a large class of planar simple nested fractals. Such a process is obtained as a folding projection of the free Brownian motion from the unbounded fractal. We give sharp necessary geometric conditions on the fractal under which this projection can be well defined. They are illustrated by various specific examples. We first construct a proper version of the transition probability densities for reflected process and we prove that it is a continuous, bounded and symmetric function which satisfies the Chapman-Kolmogorov equations. These provide us with further regularity properties of the reflected process such us Markov, Feller and strong Feller property
Current browse context:
math.PR
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.