{
  "id": "stochastic-process",
  "title": "Stochastic Process",
  "lang": "en",
  "source_lang": "en",
  "summary": "A stochastic process is a family of random variables indexed by time or another parameter, used to describe uncertain systems and their dependence structure.",
  "category": "mathematics",
  "subcategory": "probability-statistics",
  "type": "concept",
  "aliases": [
    "Random process"
  ],
  "generated_at": "2026-10-03",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/stochastic-process/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/stochastic-process/",
      "json": "https://aiwiki.page/zh/stochastic-process.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A stochastic process is a collection of random variables indexed by time, location, or another parameter and defined on a common probability space. It describes both uncertainty at individual indices and dependence between different indices. In probability theory, a process can be viewed as a random trajectory rather than a single random value: an outcome determines one possible evolution of the system. Familiar examples include randomly fluctuating signals, particle trajectories, and counts of arriving events. (ocw.mit.edu)"
    },
    {
      "heading": "Mathematical definition",
      "text": "Formally, a stochastic process is a family\n\n\\[X=\\{X_t:t\\in T\\}\\]\n\non a probability space \\((\\Omega,\\mathcal F,P)\\), taking values in a measurable state space \\(S\\). The set \\(T\\) is the index set. For each fixed \\(t\\), \\(X_t\\) is a measurable map from \\(\\Omega\\) to \\(S\\); measurability is specified using appropriate sigma-algebras. For each fixed outcome \\(\\omega\\), the function \\(t\\mapsto X_t(\\omega)\\) is a sample path, also called a realization or trajectory. These two perspectives distinguish uncertainty across outcomes from variation along an individual path. (public.econ.duke.edu)\n\nTime may be discrete, as with \\(T=\\{0,1,2,\\ldots\\}\\), or continuous, as with \\(T=[0,\\infty)\\). The state space may independently be discrete or continuous: an event count has integer-valued states even when time is continuous. Processes indexed by spatial coordinates, or by several parameters, are commonly called random fields. (ocw.mit.edu)"
    },
    {
      "heading": "Distribution and dependence",
      "text": "For any finite selection \\(t_1,\\ldots,t_n\\), the joint distribution of\n\n\\[(X_{t_1},\\ldots,X_{t_n})\\]\n\nis a finite-dimensional distribution. The collection of these distributions specifies the process’s joint probabilistic behavior at finite sets of indices. Individual marginal distributions are insufficient: two processes can have identical distributions at each time but different temporal dependence. (public.econ.duke.edu)\n\nThe Kolmogorov extension theorem establishes that, under suitable state-space assumptions, a consistent family of finite-dimensional distributions can be realized by a stochastic process. Consistency requires agreement when coordinates are reordered or omitted. This construction does not by itself guarantee continuous sample paths; path regularity requires additional analysis. (public.econ.duke.edu)\n\nFor a real-valued process with finite second moments, useful descriptors are its mean and covariance functions:\n\n\\[m(t)=\\mathbb E[X_t],\\qquad C(s,t)=\\mathbb E[(X_s-m(s))(X_t-m(t))].\\]\n\nThe mean uses expectation, while covariance describes second-order dependence. In particular, \\(C(t,t)\\) is the variance at time \\(t\\). These functions generally do not determine the entire process distribution. (sia.mit.edu)"
    },
    {
      "heading": "Stationarity and increments",
      "text": "A strictly stationary process has finite-dimensional distributions unchanged by a common shift of all time indices, whenever the shifted indices remain in its domain. Weak stationarity, or covariance stationarity, instead requires finite second moments, a constant mean, and covariance depending only on the time difference. Strict stationarity implies weak stationarity when the required moments exist; the converse generally fails. (sia.mit.edu)\n\nAn increment is a difference \\(X_t-X_s\\). Stationary increments means that its distribution depends only on \\(t-s\\), not on the starting time. Independent increments means increments over nonoverlapping time intervals have statistical independence. Neither property should be confused with stationarity of the process itself: standard Brownian motion has stationary increments, but its variance grows with time. (ocw.mit.edu)"
    },
    {
      "heading": "Important examples",
      "text": "A random walk is formed by accumulating random steps:\n\n\\[S_n=S_0+\\sum_{k=1}^{n}\\xi_k.\\]\n\nFor a simple symmetric walk, the steps independently equal \\(+1\\) or \\(-1\\), each with probability one-half. Despite independent steps, successive positions are dependent because they share accumulated increments. (ocw.mit.edu)\n\nA Markov chain evolves between states according to transition probabilities. Its defining Markov property states that, conditional on the present state, the future does not additionally depend on the past. For a finite, time-homogeneous chain, these probabilities can be represented by a transition matrix. Markov processes may also evolve in continuous time. (ocw.mit.edu)\n\nA homogeneous Poisson process \\(N_t\\) counts events occurring at rate \\(\\lambda>0\\). It starts at zero, has independent stationary increments, and satisfies\n\n\\[N_t-N_s\\sim\\operatorname{Poisson}(\\lambda(t-s)), \\qquad 0\\le s<t.\\]\n\nThe increment therefore follows a Poisson distribution, and paths increase through unit jumps. Such processes model random arrivals under specific assumptions about their timing. (ocw.mit.edu)\n\nA standard Wiener process \\(W_t\\), the mathematical model of Brownian motion, starts at zero, has continuous paths almost surely, and has independent increments satisfying\n\n\\[W_t-W_s\\sim\\mathcal N(0,t-s).\\]\n\nIts increments follow a normal distribution. Its mean is zero and its covariance is \\(\\min(s,t)\\). (public.econ.duke.edu)\n\nA Gaussian process has a multivariate normal distribution at every finite selection of indices. Unlike a general process, its finite-dimensional distributions are completely determined by its mean and covariance functions. Gaussian processes also provide models for unknown functions in regression and spatial prediction. (stat.berkeley.edu)"
    },
    {
      "heading": "Information and martingales",
      "text": "A filtration \\((\\mathcal F_t)\\) is an increasing family of sigma-algebras representing information available over time. A process is adapted when its value at time \\(t\\) is measurable with respect to \\(\\mathcal F_t\\). An integrable adapted process \\(M_t\\) is a martingale if\n\n\\[\\mathbb E[M_t\\mid\\mathcal F_s]=M_s,\\qquad s\\le t.\\]\n\nThis conditional expectation identity formalizes the absence of predictable changes in its conditional mean. Martingales need not have independent increments; their definition depends on the specified information structure. (ocw.mit.edu)"
    }
  ],
  "links": [
    "random-variable",
    "probability-space",
    "probability",
    "sigma-algebra",
    "mathematical-function",
    "joint-probability-distribution",
    "expected-value",
    "covariance",
    "variance",
    "stationary-process",
    "statistical-independence",
    "random-walk",
    "markov-chain",
    "markov-property",
    "transition-matrix",
    "poisson-process",
    "poisson-distribution",
    "wiener-process",
    "brownian-motion",
    "normal-distribution",
    "gaussian-process",
    "multivariate-normal-distribution",
    "filtration-probability",
    "martingale",
    "conditional-expectation"
  ],
  "sources": [
    {
      "title": "ocw.mit.edu/courses/18-s096-topics-in-mathematics-with-applications-in-finance-…",
      "url": "https://ocw.mit.edu/courses/18-s096-topics-in-mathematics-with-applications-in-finance-fall-2013/f5784e4facf3de690210d17c97358eba_MIT18_S096F13_lecnote5.pdf"
    },
    {
      "title": "public.econ.duke.edu/~get/browse/courses/883/Spr16/COURSE-MATERIALS/Z_Papers/sp…",
      "url": "https://public.econ.duke.edu/~get/browse/courses/883/Spr16/COURSE-MATERIALS/Z_Papers/sp_new.pdf"
    },
    {
      "title": "sia.mit.edu/wp-content/uploads/2015/04/chapter4.pdf",
      "url": "https://sia.mit.edu/wp-content/uploads/2015/04/chapter4.pdf"
    },
    {
      "title": "ocw.mit.edu/courses/6-041sc-probabilistic-systems-analysis-and-applied-probabil…",
      "url": "https://ocw.mit.edu/courses/6-041sc-probabilistic-systems-analysis-and-applied-probability-fall-2013/pages/unit-iii/"
    },
    {
      "title": "ocw.mit.edu/courses/res-6-012-introduction-to-probability-spring-2018/pages/par…",
      "url": "https://ocw.mit.edu/courses/res-6-012-introduction-to-probability-spring-2018/pages/part-iii-random-processes/"
    },
    {
      "title": "stat.berkeley.edu/users/paciorek/diss/paciorek-thesis.pdf",
      "url": "https://www.stat.berkeley.edu/users/paciorek/diss/paciorek-thesis.pdf"
    },
    {
      "title": "ocw.mit.edu/courses/15-070j-advanced-stochastic-processes-fall-2013/69dc2223b99…",
      "url": "https://ocw.mit.edu/courses/15-070j-advanced-stochastic-processes-fall-2013/69dc2223b9957bbcc754de94dfc64cfd_MIT15_070JF13_Lec9.pdf"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}