Random walk: Difference between revisions

From SklogWiki
Jump to navigation Jump to search
m (Added an internal link)
m (→‎See also: Changed internal link)
 
(One intermediate revision by the same user not shown)
Line 4: Line 4:
<blockquote> "A man starts from a point O and walks l yards in a straight line; he then turns through any angle whatever and walks another l yards in a second straight line. He repeats this process n times. I require the probability that after these n stretches he is at a distance between r and r + dr from his starting point, O."</blockquote>
<blockquote> "A man starts from a point O and walks l yards in a straight line; he then turns through any angle whatever and walks another l yards in a second straight line. He repeats this process n times. I require the probability that after these n stretches he is at a distance between r and r + dr from his starting point, O."</blockquote>
==See also==
==See also==
*[[Self-avoiding walk model]]
*[[Asphericity]]
*[[Ideal chain model]]
 
==References==
==References==
<references/>
<references/>
[[category: polymers]]
[[category: polymers]]

Latest revision as of 16:23, 15 November 2017

This article is a 'stub' page, it has no, or next to no, content. It is here at the moment to help form part of the structure of SklogWiki. If you add sufficient material to this article then please remove the {{Stub-general}} template from this page.

Apparently, the so-called random walk problem was set out by Karl Pearson in a letter to Nature in 1905 [1] [2]

"A man starts from a point O and walks l yards in a straight line; he then turns through any angle whatever and walks another l yards in a second straight line. He repeats this process n times. I require the probability that after these n stretches he is at a distance between r and r + dr from his starting point, O."

See also[edit]

References[edit]