Graduate
  1. Real Analysis  1.1. Set Theory and Logic  1.1.1. Sets and Operations  1.1.2. Relations and Functions  1.1.3. Logic and Quantifiers  1.1.4. Cardinality of Sets  1.2. Metric Spaces  1.2.1. Open and Closed Sets  1.2.2. Convergence of Sequences  1.2.3. Continuous Functions in Metric Spaces  1.2.4. Compactness and Completeness in Metric Spaces in Real Analysis  1.3. Sequence and Series  1.3.1. Convergence of Sequences  1.3.2. Infinite Series  1.3.3. Uniform Convergence  1.3.4. Power Series  1.4. Differentiation  1.4.1. Mean Value Theorems  1.4.2. Taylor Series  1.4.3. Functions of Several Variables  1.4.4. Partial Derivatives  1.5. Integration  1.5.1. Riemann and Lebesgue Integration  1.5.2. Improper Integrals  1.5.3. Measure Theory  1.5.4. Fubini’s Theorem  1.6. Functional Analysis  1.6.1. Banach Spaces  1.6.2. Hilbert Spaces  1.6.3. Operators on Spaces  1.6.4. Spectral Theory
  2. Abstract Algebra  2.1. Groups  2.1.1. Definitions and Examples in Groups in Abstract Algebra  2.1.2. Group Homomorphisms  2.1.3. Normal Subgroups  2.1.4. Sylow Theorems  2.2. Rings and Fields  2.2.1. Ideals and Factor Rings  2.2.2. Field Extensions  2.2.3. Galois Theory  2.2.4. Polynomial Rings  2.3. Modules  2.3.1. Module Homomorphisms  2.3.2. Free Modules  2.3.3. Tensor Products  2.3.4. Exact Sequences  2.4. Linear Algebra  2.4.1. Vector Spaces  2.4.2. Eigenvalues and Eigenvectors  2.4.3. Inner Product Spaces  2.4.4. Diagonalization
  3. Topology  3.1. General Topology  3.1.1. Open and Closed Sets  3.1.2. Compactness and Connectedness  3.1.3. Continuous Maps  3.1.4. Separation Axioms  3.2. Algebraic Topology  3.2.1. Fundamental Groups  3.2.2. Homotopy and Homology  3.2.3. Simplicial Complexes  3.2.4. Exact Sequences in Homology  3.3. Differential Topology  3.3.1. Manifolds  3.3.2. Smooth Functions  3.3.3. Tangent and Cotangent Spaces  3.3.4. Vector Bundles
  4. Differential Equations  4.1. Ordinary Differential Equations  4.1.1. First-Order Equations  4.1.2. Second-Order Linear Equations  4.1.3. Systems of Differential Equations  4.1.4. Stability Analysis  4.2. Partial Differential Equations  4.2.1. Classification of PDEs  4.2.2. Fourier Series  4.2.3. Green's Functions  4.2.4. Method of Characteristics  4.3. Dynamical Systems  4.3.1. Stability Theory  4.3.2. Limit Cycles  4.3.3. Chaos Theory  4.3.4. Bifurcation Theory
  5. Probability and Statistics  5.1. Probability Theory  5.1.1. Random Variables  5.1.2. Probability Distributions  5.1.3. Law of Large Numbers  5.1.4. Central Limit Theorem  5.2. Statistical Inference  5.2.1. Hypothesis Testing  5.2.2. Confidence Intervals  5.2.3. Bayesian Methods  5.2.4. Maximum Likelihood Estimation  5.3. Stochastic Processes  5.3.1. Markov Chains  5.3.2. Brownian Motion  5.3.3. Poisson Processes  5.3.4. Martingales
  6. Numerical Analysis  6.1. Numerical Solutions of Equations  6.1.1. Root Finding  6.1.2. Iterative Methods  6.1.3. Convergence Analysis  6.1.4. Error Bounds in Numerical Solutions of Equations  6.2. Numerical Linear Algebra  6.2.1. Matrix Factorizations  6.2.2. Eigenvalue Computations  6.2.3. Sparse Matrices  6.2.4. Preconditioning Techniques  6.3. Numerical Integration and Differentiation  6.3.1. Quadrature Methods  6.3.2. Finite Differences  6.3.3. Error Analysis in Numerical Integration and Differentiation  6.3.4. Adaptive Methods
  7. Complex Analysis  7.1. Complex Numbers  7.1.1. Polar Form  7.1.2. Complex Conjugates  7.1.3. Exponential Form  7.1.4. Roots of Unity  7.2. Analytic Functions  7.2.1. Cauchy-Riemann Equations  7.2.2. Power Series  7.2.3. Conformal Mappings  7.2.4. Harmonic Functions  7.3. Integration in the Complex Plane  7.3.1. Cauchy’s Theorem  7.3.2. Residue Theorem  7.3.3. Contour Integration  7.3.4. Integral Transforms
  8. Mathematical Logic and Foundations  8.1. Propositional Logic  8.1.1. Truth Tables  8.1.2. Logical Equivalences  8.1.3. Proof Techniques in Propositional Logic  8.1.4. Resolution  8.2. Predicate Logic  8.2.1. Quantifiers in Predicate Logic  8.2.2. Formal Systems in Predicate Logic  8.2.3. Completeness and Soundness  8.2.4. Model Theory  8.3. Set Theory  8.3.1. Cardinality and Ordinality  8.3.2. Axiomatic Systems  8.3.3. Zermelo-Fraenkel Set Theory  8.3.4. Forcing
  9. Optimization  9.1. Linear Programming  9.1.1. Simplex Method  9.1.2. Duality in Linear Programming  9.1.3. Sensitivity Analysis  9.1.4. Interior Point Methods  9.2. Nonlinear Programming  9.2.1. Gradient Descent  9.2.2. Lagrange Multipliers  9.2.3. Convex Optimization  9.2.4. Quadratic Programming  9.3. Combinatorial Optimization  9.3.1. Graph Algorithms  9.3.2. Integer Programming  9.3.3. Network Flows  9.3.4. Approximation Algorithms
  10. Discrete Mathematics  10.1. Graph Theory  10.1.1. Graph Representations  10.1.2. Planarity and Coloring  10.1.3. Shortest Path Algorithms  10.1.4. Network Flows  10.2. Combinatorics  10.2.1. Permutations and Combinations  10.2.2. Generating Functions  10.2.3. Recurrence Relations  10.2.4. Inclusion-Exclusion Principle  10.3. Cryptography  10.3.1. Number Theory Applications in Cryptography  10.3.2. Symmetric and Asymmetric Cryptography  10.3.3. RSA and Elliptic Curve Cryptography  10.3.4. Post-Quantum Cryptography

Graduate → Probability and Statistics → Stochastic Processes ↓


Brownian Motion


Brownian motion, named after the botanist Robert Brown, is a fundamental concept in probability and statistics, particularly within the study of stochastic processes. It describes the random motion of particles suspended in a fluid (such as water or air) that results from their collision with faster-moving molecules of the fluid. However, the phenomenon also forms a cornerstone in the field of financial mathematics, where it is used to model seemingly random stock market behaviour. The aim of this document is to provide a detailed but comprehensive description of Brownian motion, its characteristics, applications and significance, while striving to maintain clarity and simplicity in language.

Characterization of Brownian motion

Brownian motion is a stochastic process, meaning that it is a collection of random variables that are usually indexed by time. More formally, a standard Brownian motion, often denoted as B(t) for t ≥ 0, is characterized by the following properties:

  • Initial point: B(0) = 0 This means the process starts from zero.
  • Independent increments: The increments B(t) - B(s) for t > s are independent of the past behavior (history) of the process B(u) for 0 ≤ u ≤ s.
  • Normally distributed growth: The growth B(t) - B(s) is normally distributed with mean zero and variance t - s. In mathematical notation, this is expressed as B(t) - B(s) ~ N(0, t - s).
  • Continuous path: The function t → B(t) is continuous with probability 1. This implies that the graph of Brownian motion is an unbroken curve without any sharp jumps.

These properties define the mathematical structure of Brownian motion and make it a continuous-time martingale process with stationary and independent increments.

Mathematical model of Brownian motion

To better understand Brownian motion, consider a simple example: imagine a particle suspended in a liquid. The particle moves randomly due to collisions with molecules in the liquid, which are themselves in continuous random motion.

We can model this irregular motion using the characteristics explained above. Suppose the position of the particle at time t is expressed as X(t). It can be approximated using the equation for standard Brownian motion:

X(t) = B(t)

More complex models may include one or more additional parameters, expressing X(t) as a function of time and other factors such as drift and volatility. Nevertheless, the main idea is to mathematically model this random, continuous path.

Visualization of Brownian motion

A standard Brownian motion can be visualized as a random, continuous path on a graph where the x-axis represents time (t) and the y-axis represents the position or value (B(t)) of the Brownian motion at that time. Here is a simple SVG representation of a typical Brownian path over a short interval:

0 Time Post

In this example, one can observe the random fluctuations in the position of the particle as time passes. Note that although the path is continuous, it is highly uncertain and unpredictable, reflecting the inherent randomness of the process.

Mathematical implications of Brownian motion

Path properties

An interesting feature of Brownian motion is the structure of its paths. Mathematically, Brownian paths are continuous almost everywhere, but differentiable nowhere. This means that we can never find an interval in which the path has a tangent, which shows the complex structure of randomness.

The martingale property

A process B(t) is called a martingale if at any time t, the expected value of its future given its present value is equal to its present value. Mathematically:

E[B(t+s) | B(t)] = B(t) for all t, s ≥ 0

This martingale property makes Brownian motion a powerful tool in stochastic calculus, particularly in the field of financial mathematics for option pricing.

Scaling property

Brownian motion has a remarkable scaling property. If B(t) is a standard Brownian motion, then for any constant c > 0, the process cB(t/c²) is also a Brownian motion. This self-correlation insight is fundamental in fractal geometry and helps to understand how Brownian motion behaves at different scales.

Reflection theory

The reflection principle is another profound result related to Brownian motion. It states that if t₀ is the first time a Brownian path reaches a level a (i.e., B(t₀) = a), then the process B(t) - 2a for t ≥ t₀ is also a Brownian motion.

Applications of Brownian motion

Brownian motion finds applications in various fields due to its rich mathematical properties and ability to model natural phenomena:

Physics and natural sciences

In physics, Brownian motion provides insight into the kinetic theory of gases, helping us understand diffusion, heat conduction, and even the behavior of complex systems in equilibrium.

Finance

In finance, Brownian motion forms the backbone of the Black-Scholes model, which is used to price options by modeling the random behavior of stock prices. The model assumes that the logarithm of stock prices follows geometric Brownian motion, which is expressed as:

dS(t) = μS(t)dt + σS(t)dB(t)

Here, μ is the deviation rate, σ is the fluctuation rate, and dB(t) represents the infinitesimal increment of the standard Brownian motion.

Mathematical biology

In biology, Brownian motion is important in understanding the movement of molecules and particles within cells, and helps in the study of processes such as signaling and molecular interactions.

Advanced generalization

Brownian motion is also generalized to model more complex stochastic systems, which evolve over a wide range of processes such as:

  • Fractional Brownian motion: Unlike standard Brownian motion, this type exhibits long-range dependencies and can model memory effects present in various time series data.
  • Geometric Brownian motion: A variant that ensures positivity, often used in financial models where negative stock prices are not viable.
  • Wiener process: a mathematical formalism of Brownian motion, showing the main aspects and formulation of the process.

Conclusion

In conclusion, Brownian motion is a fascinating and versatile mathematical construct. Its properties make it fundamental in both theoretical and applied mathematics, spanning fields from physics to finance. Understanding Brownian motion not only provides insight into the mathematical modeling of randomness, but also highlights the nature of processes that are inherently unpredictable. Through visual examples and simple explanations, Brownian motion can thus bridge the gap between complex mathematical theory and real-world phenomena.


Graduate → 5.3.2


U
username
0%
completed in Graduate

← Prev (5.3.1)
Markov Chains
Next (5.3.3) →
Poisson Processes

Comments 



Brownian Motion

https://www.buddymath.com/g/5.3.2?bmal=en