Difference between revisions of "Random walk"

From Soft-Matter
Jump to: navigation, search
Line 2: Line 2:
  
 
Different spaces for a random walk include the one-dimensional space of integers (e.g. successively flipping a coin with values of <math>\pm 1</math> and adding these up or the [http://en.wikipedia.org/wiki/Fermi_estimation Fermi estimation]), the plane with real coordinates ([http://www.nature.com.ezp-prod1.hul.harvard.edu/physics/looking-back/pearson/index.html e.g. the drunkard's walk]), or  
 
Different spaces for a random walk include the one-dimensional space of integers (e.g. successively flipping a coin with values of <math>\pm 1</math> and adding these up or the [http://en.wikipedia.org/wiki/Fermi_estimation Fermi estimation]), the plane with real coordinates ([http://www.nature.com.ezp-prod1.hul.harvard.edu/physics/looking-back/pearson/index.html e.g. the drunkard's walk]), or  
3D euclidean space (e.g. [http://en.wikipedia.org/wiki/L%C3%A9vy_flight Levy Flight] or the [http://en.wikipedia.org/wiki/Wiener_process Wiener process]). More uncommon spaces include graps (see the overview [http://www.cs.unibo.it/babaoglu/courses/cas/resources/tutorials/RandomWalks.pdf here]) or groups in the mathematical sense (a short introduction can be found [http://algo.inria.fr/seminars/sem00-01/guivarch.html here]).
+
3D euclidean space (e.g. [http://en.wikipedia.org/wiki/L%C3%A9vy_flight Levy Flight] or the [http://en.wikipedia.org/wiki/Wiener_process Wiener process]). More uncommon spaces include graphs (see the overview [http://www.cs.unibo.it/babaoglu/courses/cas/resources/tutorials/RandomWalks.pdf here]) or groups in the mathematical sense (a short introduction can be found [http://algo.inria.fr/seminars/sem00-01/guivarch.html here]).
  
 
Steps can be performed at defined time intervals or at random times, with a defined or random step length and each random component can be modified based on previous steps.
 
Steps can be performed at defined time intervals or at random times, with a defined or random step length and each random component can be modified based on previous steps.
  
In the context of soft matter, the two most important applications of the concept of random walks is diffusion limited aggregation and the modeling of polymers as [http://en.wikipedia.org/wiki/Ideal_chain#Ideal_polymer_exchanging_length_with_a_reservoir freely-jointed chains].
+
In the context of soft matter, the two most important applications of the concept of random walks are diffusion limited aggregation and the modeling of polymers as [http://en.wikipedia.org/wiki/Ideal_chain#Ideal_polymer_exchanging_length_with_a_reservoir freely-jointed chains].
  
 
For a polymer chain undergoing a completely ramdom walk the end-to-end length <math>R</math> scales with the number of segments <math>N</math> like
 
For a polymer chain undergoing a completely ramdom walk the end-to-end length <math>R</math> scales with the number of segments <math>N</math> like
  
 
<math>R \propto \sqrt{N}</math>
 
<math>R \propto \sqrt{N}</math>

Revision as of 15:39, 18 October 2009

A random walk is a trajectory that is created from successive random steps. Depending on the dimension of the space the walk is performed in and the definition of randomness used for each step, different kinds of walks can be formulated.

Different spaces for a random walk include the one-dimensional space of integers (e.g. successively flipping a coin with values of <math>\pm 1</math> and adding these up or the Fermi estimation), the plane with real coordinates (e.g. the drunkard's walk), or 3D euclidean space (e.g. Levy Flight or the Wiener process). More uncommon spaces include graphs (see the overview here) or groups in the mathematical sense (a short introduction can be found here).

Steps can be performed at defined time intervals or at random times, with a defined or random step length and each random component can be modified based on previous steps.

In the context of soft matter, the two most important applications of the concept of random walks are diffusion limited aggregation and the modeling of polymers as freely-jointed chains.

For a polymer chain undergoing a completely ramdom walk the end-to-end length <math>R</math> scales with the number of segments <math>N</math> like

<math>R \propto \sqrt{N}</math>