In the mathematical theory of stochastic processes, local time is a stochastic process associated with semimartingale processes such as Brownian motion, that characterizes the amount of time a particle has spent at a given level. Local time appears in various stochastic integration formulas, such as Tanaka's formula, if the integrand is not sufficiently smooth. It is also studied in statistical mechanics in the context of random fields. For a continuous real-valued semimartingale , the local time of at the point is the stochastic process which is informally defined by where is the Dirac delta function and is the quadratic variation. It is a notion invented by Paul Lévy. The basic idea is that is an (appropriately rescaled and time-parametrized) measure of how much time has spent at up to time . More rigorously, it may be written as the almost sure limit which may be shown to always exist. Note that in the special case of Brownian motion (or more generally a real-valued diffusion of the form where is a Brownian motion), the term simply reduces to , which explains why it is called the local time of at . For a discrete state-space process , the local time can be expressed more simply as Tanaka's formula also provides a definition of local time for an arbitrary continuous semimartingale on A more general form was proven independently by Meyer and Wang; the formula extends Itô's lemma for twice differentiable functions to a more general class of functions. If is absolutely continuous with derivative which is of bounded variation, then where is the left derivative. If is a Brownian motion, then for any the field of local times has a modification which is a.s. Hölder continuous in with exponent , uniformly for bounded and . In general, has a modification that is a.s. continuous in and càdlàg in . Tanaka's formula provides the explicit Doob–Meyer decomposition for the one-dimensional reflecting Brownian motion, . The field of local times associated to a stochastic process on a space is a well studied topic in the area of random fields.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.