1
Brownian Motion and Diffusion Processes Lucas Capoia, John Haug, Zhaopeng Liu, Zhe Hu, Professor Jing Wang Illinois Geometry Lab IGL Open House, May 5th, 2016 Background Information Brownian motion is the random motion of particles suspended in a fluid (a liquid or a gas) resulting from their collision with the quickly moving atoms or molecules in the fluid. This transport phenomenon is named after the botanist Robert Brown. The mathematical model of Brownian motion has numerous real-world applications, such as stock market analysis. Definition 1-D Brownian Motion B (0)= 0 B t N (0, t ), t R 0 B (t t ) - B (t ) is independent of B (s ) for all s t ; 2-D Brownian Motion Created based on 1-D Brownian Motion B (t , s )=(B t , B s ) B t N (0, t ), t R 0 B s N (0, s ), s R 0 Kolmogorov Process A Kolmogorov process is a collection of random variables {K t |t R 0 } such that K t =(B t , R t 0 B s ds ) where B t is a one-dimensional Brownian motion. Figure: Kolmogorov process sample paths Roto Transition {(V , θ 1 )} 7→ {(X , Y , θ 2 )} V R , θ 1 (-π , -π ), (X , Y ) R N , θ 2 (-π , -π ) Give initial state, could find a function whose parameter is velocity and direction, which represent the process from initial state to ending state at a specific location and angel. Application: parallel parking Brownian sheet A 1-D Brownian Sheet is a 2-Parameter, centered Gaussian process B = {B (s , t ); s , t 0} E {B (s , t )B (s 0 , t 0 )} = min(s , s 0 ) × min(t , t 0 ) Our Work Simulation We began by creating simulations of Brownian motion using Python and Matlab. Our simulations of Brownian motion are quite simple: we start a particle at the origin, and after each increment of time, we sample a normal distribution of mean = 0 and variance = 1 total steps , and add it to the previous location of the particle. Every step is independent, and we see a true Brownian motion from the simulation. We often chose to have 1000 steps per simulation, as it is big enough to see its random nature, but small enough to be computed efficiently. Extended Use of Simulation We can extend these methods to simulate other topics. We can create 2-D Brownian motion by having two separate and independent simulations of Brownian Motion on each axis at the same time. We can observe the Kolmogorov process as well, where one dimension is standard Brownian motion, while the other dimension records the integral of that Brownian motion. We can extend our code further to explore roto-translational motion, where a Brownian motion determines a particle’s movement forward or backward, while another random process allows it to turn left or right. This process models the possible motion of a car. Gallery (a) 1-D Brownian Motion (b) 2-D Brownian Motion (c) Many sample paths of Kolmogorov process (blue) and an optimal path (red) (d) Sample paths of roto-translation Results and Further Work We have created simulations of 1-D and 2-D Brownian motions, the Kolmogorov process, and the diffusion process on the roto-translation group. After the simulations were completed, we turned our attention to the study of optimal paths in each of the diffusion processes mentioned above. Using an approach reminiscent of the Monte Carlo method, we ran our simulations multiple times, fixing the endpoints of our sample paths. By observing where the sample paths were concentrated, we could successfully infer the approximate form of optimal paths. In our study of optimal paths, we also observed phenomena associated with Hörmander’s condition. That is, when we reduced the time variable in our simulations, we noticed that the Brownian motion and the diffusion process on the roto-translation group had a converging behavior, and the sample paths became more concentrated around the optimal path. For the Kolmogorov process, however, constraining the time variable resulted in an entirely new optimal path. At the moment, we are working to create simulations of other diffusion processes, such as the Brownian sheet and the diffusion process on the Heisenberg group. Moreover, we plan to review our code and find ways to improve the computational efficiency of our simulations, since at the moment they are very costly and can take hours to run. References CAPOGNA, L., DANIELLI, D., PAULS, S., and TYSON, J. An Introduction to the Heisenberg Group and the Sub-Riemannian Isoperimetric Problem. Birkhäuser Basel, 2007. MÖRTERS, P., and PERES, Y. Brownian Motion [draft], 2008. These posters are made with the support of University of Illinois at Urbana-Champaign Public Engagement Office

Brownian Motion and Diffusion Processes · 2018-09-01 · TYSON, J. An Introduction to the Heisenberg Group and the Sub-Riemannian Isoperimetric Problem. Birkhäuser Basel, 2007

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Brownian Motion and Diffusion Processes · 2018-09-01 · TYSON, J. An Introduction to the Heisenberg Group and the Sub-Riemannian Isoperimetric Problem. Birkhäuser Basel, 2007

Brownian Motion and Diffusion ProcessesLucas Capoia, John Haug, Zhaopeng Liu, Zhe Hu, Professor Jing Wang

Illinois Geometry LabIGL Open House, May 5th, 2016

Background InformationBrownian motion is the random motion of particlessuspended in a fluid (a liquid or a gas) resulting fromtheir collision with the quickly moving atoms ormolecules in the fluid.This transport phenomenon is named after thebotanist Robert Brown.The mathematical model of Brownian motion hasnumerous real-world applications, such as stockmarket analysis.

Definition1-D Brownian Motion

B(0) = 0Bt ∼N (0, t), t ∈R≥0

B(t + ∆t)−B(t) isindependent of B(s) forall s ≤ t ;

2-D Brownian MotionCreated based on 1-DBrownian MotionB(t ,s) = (Bt,Bs)

Bt ∼N (0, t), t ∈R≥0Bs ∼N (0,s), s ∈R≥0

Kolmogorov ProcessA Kolmogorov process is a collection of randomvariables {Kt|t ∈R≥0} such that Kt = (Bt,

∫ t0 Bsds)

where Bt is a one-dimensional Brownian motion.

Figure: Kolmogorov process sample paths

Roto Transition{(V ,θ1)} 7→ {(X ,Y ,θ2)}V ∈R,θ1 ∈ (−π,−π), (X ,Y ) ∈RN,θ2 ∈ (−π,−π)

Give initial state, could find a function whoseparameter is velocity and direction, which representthe process from initial state to ending state at aspecific location and angel.Application: parallel parking

Brownian sheetA 1-D Brownian Sheet is a 2-Parameter, centeredGaussian process B = {B(s, t);s, t ≥ 0}E {B(s, t)B(s′, t ′)} = min(s,s′) ×min(t , t ′)

Our WorkSimulationWe began by creating simulations of Brownianmotion using Python and Matlab. Our simulationsof Brownian motion are quite simple: we start aparticle at the origin, and after each increment oftime, we sample a normal distribution of mean = 0and variance = 1√

total steps, and add it to the

previous location of the particle. Every step isindependent, and we see a true Brownian motionfrom the simulation. We often chose to have 1000steps per simulation, as it is big enough to see itsrandom nature, but small enough to be computedefficiently.

Extended Use of SimulationWe can extend these methods to simulate othertopics. We can create 2-D Brownian motion byhaving two separate and independent simulationsof Brownian Motion on each axis at the sametime. We can observe the Kolmogorov process aswell, where one dimension is standard Brownianmotion, while the other dimension records theintegral of that Brownian motion. We can extendour code further to explore roto-translationalmotion, where a Brownian motion determines aparticle’s movement forward or backward, whileanother random process allows it to turn left orright. This process models the possible motion ofa car.

Gallery

(a) 1-D Brownian Motion (b) 2-D Brownian Motion

(c) Many sample paths of Kolmogorov process (blue) and anoptimal path (red) (d) Sample paths of roto-translation

Results and Further WorkWe have created simulations of 1-D and 2-DBrownian motions, the Kolmogorov process, and thediffusion process on the roto-translation group.After the simulations were completed, we turned ourattention to the study of optimal paths in each of thediffusion processes mentioned above. Using anapproach reminiscent of the Monte Carlo method,we ran our simulations multiple times, fixing theendpoints of our sample paths. By observing wherethe sample paths were concentrated, we couldsuccessfully infer the approximate form of optimalpaths.In our study of optimal paths, we also observedphenomena associated with Hörmander’s condition.That is, when we reduced the time variable in oursimulations, we noticed that the Brownian motionand the diffusion process on the roto-translationgroup had a converging behavior, and the samplepaths became more concentrated around theoptimal path. For the Kolmogorov process, however,constraining the time variable resulted in an entirelynew optimal path.At the moment, we are working to create simulationsof other diffusion processes, such as the Browniansheet and the diffusion process on the Heisenberggroup. Moreover, we plan to review our code andfind ways to improve the computational efficiency ofour simulations, since at the moment they are verycostly and can take hours to run.

ReferencesCAPOGNA, L., DANIELLI, D., PAULS, S., andTYSON, J. An Introduction to the Heisenberg Groupand the Sub-Riemannian Isoperimetric Problem.Birkhäuser Basel, 2007.MÖRTERS, P., and PERES, Y. Brownian Motion[draft], 2008.

These posters are made with the support of University of Illinois at Urbana-Champaign Public Engagement Office

1