<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Probability of long runs</title>
	<atom:link href="http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/</link>
	<description>John D. Cook</description>
	<lastBuildDate>Wed, 22 May 2013 00:05:53 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: Douglas Zare</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-22189</link>
		<dc:creator>Douglas Zare</dc:creator>
		<pubDate>Thu, 28 Mar 2013 17:00:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-22189</guid>
		<description><![CDATA[Hi. Someone linked to this post from http://mathoverflow.net/questions/125814/maximal-chain-of-1s-in-binary-strings. I have a few comments.

In the motivating statistical experiment, it may make sense to choose the assignments in a more balanced fashion than assigning individuals independently. For example, if there are 10 subjects, you might choose randomly from among the ways to assign 5 to each treatment rather than risking the assignment of 9/10 to treatment A by luck. 

The formula you give for the standard deviation differs from the one in Schilling&#039;s papers by a factor of pi/sqrt(6). 

The distribution about the mean is not normal. The tails drop off only roughly exponentially (for a while).]]></description>
		<content:encoded><![CDATA[<p>Hi. Someone linked to this post from <a href="http://mathoverflow.net/questions/125814/maximal-chain-of-1s-in-binary-strings" rel="nofollow">http://mathoverflow.net/questions/125814/maximal-chain-of-1s-in-binary-strings</a>. I have a few comments.</p>
<p>In the motivating statistical experiment, it may make sense to choose the assignments in a more balanced fashion than assigning individuals independently. For example, if there are 10 subjects, you might choose randomly from among the ways to assign 5 to each treatment rather than risking the assignment of 9/10 to treatment A by luck. </p>
<p>The formula you give for the standard deviation differs from the one in Schilling&#8217;s papers by a factor of pi/sqrt(6). </p>
<p>The distribution about the mean is not normal. The tails drop off only roughly exponentially (for a while).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ezra abrams</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3486</link>
		<dc:creator>ezra abrams</dc:creator>
		<pubDate>Sat, 17 Nov 2012 00:57:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3486</guid>
		<description><![CDATA[thanks
if there were a collection of 100 surprising math facts about the real world every scientists and engineer should know, this would surely be on the list.]]></description>
		<content:encoded><![CDATA[<p>thanks<br />
if there were a collection of 100 surprising math facts about the real world every scientists and engineer should know, this would surely be on the list.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: A Confused One</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3485</link>
		<dc:creator>A Confused One</dc:creator>
		<pubDate>Thu, 15 Nov 2012 19:00:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3485</guid>
		<description><![CDATA[Thanks you for your explanation – and the follow-up post :).]]></description>
		<content:encoded><![CDATA[<p>Thanks you for your explanation – and the follow-up post <img src='http://www.johndcook.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> .</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3484</link>
		<dc:creator>John</dc:creator>
		<pubDate>Thu, 15 Nov 2012 11:17:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3484</guid>
		<description><![CDATA[When I write &quot;log,&quot; I always mean natural log.]]></description>
		<content:encoded><![CDATA[<p>When I write &#8220;log,&#8221; I always mean natural log.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: A Confused One</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3483</link>
		<dc:creator>A Confused One</dc:creator>
		<pubDate>Thu, 15 Nov 2012 06:34:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3483</guid>
		<description><![CDATA[My python says &lt;code&gt;1/m.log10(1/0.5) 3.321928094887362&lt;/code&gt;, but &lt;code&gt;math.log&lt;/code&gt; means ln. So what’s the base of your log? 10, e, 2?]]></description>
		<content:encoded><![CDATA[<p>My python says <code>1/m.log10(1/0.5) 3.321928094887362</code>, but <code>math.log</code> means ln. So what’s the base of your log? 10, e, 2?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luis Mendo</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3482</link>
		<dc:creator>Luis Mendo</dc:creator>
		<pubDate>Wed, 14 Nov 2012 15:43:07 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3482</guid>
		<description><![CDATA[Whoops, I didn&#039;t see that! Thanks]]></description>
		<content:encoded><![CDATA[<p>Whoops, I didn&#8217;t see that! Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3481</link>
		<dc:creator>John</dc:creator>
		<pubDate>Wed, 14 Nov 2012 15:35:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3481</guid>
		<description><![CDATA[Luis: Please see the paper by Mark F. Schilling in the last line of the post.]]></description>
		<content:encoded><![CDATA[<p>Luis: Please see the paper by Mark F. Schilling in the last line of the post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luis Mendo</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3480</link>
		<dc:creator>Luis Mendo</dc:creator>
		<pubDate>Wed, 14 Nov 2012 15:27:14 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3480</guid>
		<description><![CDATA[Could you provide a reference for the expression of the expected length of the longest run? I would like to read more on that. Thanks!]]></description>
		<content:encoded><![CDATA[<p>Could you provide a reference for the expression of the expected length of the longest run? I would like to read more on that. Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dr. Drang</title>
		<link>http://www.johndcook.com/blog/2012/11/14/probability-of-long-runs/comment-page-1/#comment-3479</link>
		<dc:creator>Dr. Drang</dc:creator>
		<pubDate>Wed, 14 Nov 2012 14:29:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=12448#comment-3479</guid>
		<description><![CDATA[A few years ago, Radiolab had an episode called &lt;a href=&quot;http://www.radiolab.org/2009/jun/15/&quot; rel=&quot;nofollow&quot;&gt;Stochasticity&lt;/a&gt;, in which they talked about the likelihood of seemingly unlikely events. One of the examples was a run of seven tails in sequence of 100 coin flips. I wrote &lt;a href=&quot;http://www.leancrew.com/all-this/2009/06/stochasticity/&quot; rel=&quot;nofollow&quot;&gt;a post&lt;/a&gt; about how to calculate the probability of such runs, which involves k-step Fibonacci numbers, but never considered the statistics of the longest run. It&#039;s fun to see a different (and, frankly, much simpler) way of looking at the problem.]]></description>
		<content:encoded><![CDATA[<p>A few years ago, Radiolab had an episode called <a href="http://www.radiolab.org/2009/jun/15/" rel="nofollow">Stochasticity</a>, in which they talked about the likelihood of seemingly unlikely events. One of the examples was a run of seven tails in sequence of 100 coin flips. I wrote <a href="http://www.leancrew.com/all-this/2009/06/stochasticity/" rel="nofollow">a post</a> about how to calculate the probability of such runs, which involves k-step Fibonacci numbers, but never considered the statistics of the longest run. It&#8217;s fun to see a different (and, frankly, much simpler) way of looking at the problem.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
