<?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: Between Metcalfe&#8217;s and Reed&#8217;s Laws</title>
	<atom:link href="http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/feed" rel="self" type="application/rss+xml" />
	<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws</link>
	<description>my personal blog</description>
	<lastBuildDate>Sun, 13 Dec 2009 19:02:35 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Knowing More By Knowing Less (or, How Do You Learn?) at Disruptive Thoughts</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-58755</link>
		<dc:creator>Knowing More By Knowing Less (or, How Do You Learn?) at Disruptive Thoughts</dc:creator>
		<pubDate>Tue, 17 Oct 2006 14:06:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-58755</guid>
		<description>&lt;p&gt;[...] - Do you know Dunbar&#8217;s number? I&#8217;m guessing you don&#8217;t. The number isn&#8217;t as important as understanding the concept well enough to articulate a compelling idea (of say, network growth). [...]&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>[...] &#8211; Do you know Dunbar&#8217;s number? I&#8217;m guessing you don&#8217;t. The number isn&#8217;t as important as understanding the concept well enough to articulate a compelling idea (of say, network growth). [...]</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Genuine VC</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-6106</link>
		<dc:creator>Genuine VC</dc:creator>
		<pubDate>Thu, 09 Feb 2006 20:21:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-6106</guid>
		<description>&lt;p&gt;&lt;strong&gt;Vertical Social Networks&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;In the past couple weeks, weâ€™ve seen an additional couple of fundings in social networking. While I think that there is a lot of opportunity (i.e. ripe ad dollars for the teen/music demographic) that many of these hot new start-ups are chasing, the s...&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p><strong>Vertical Social Networks</strong></p>

<p>In the past couple weeks, weâ€™ve seen an additional couple of fundings in social networking. While I think that there is a lot of opportunity (i.e. ripe ad dollars for the teen/music demographic) that many of these hot new start-ups are chasing, the s&#8230;</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Genuine VC</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-3758</link>
		<dc:creator>Genuine VC</dc:creator>
		<pubDate>Tue, 13 Dec 2005 21:53:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-3758</guid>
		<description></description>
		<content:encoded><![CDATA[<p><strong>Don&#8217;t Just Look Left and Right, But Also Up and Down</strong></p>

<p>I like the quote last week from Fox Interactive Mediaâ€™s President Ross Levinsohn (via paidcontent.org): &#8220;[ FIM will focus on ] social portals&#8230; Why have one portal when we can have 70 million?&#8221; There is a lot merit to this strategy. Many of the â€&#8230;</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Nivi</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1735</link>
		<dc:creator>Nivi</dc:creator>
		<pubDate>Thu, 06 Oct 2005 17:17:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1735</guid>
		<description>&lt;p&gt;Death,&lt;/p&gt;

&lt;p&gt;Those are good thoughts. If you come up with an interesting result, I would be glad to publish it here.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Death,</p>

<p>Those are good thoughts. If you come up with an interesting result, I would be glad to publish it here.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Allan</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1725</link>
		<dc:creator>Allan</dc:creator>
		<pubDate>Wed, 05 Oct 2005 21:23:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1725</guid>
		<description>&lt;p&gt;Nivi,&lt;/p&gt;

&lt;p&gt;I guess you are making your argument from the limits to the binomial coefficients:&lt;/p&gt;

&lt;p&gt;http://en.wikipedia.org/wiki/Binomial_coefficient#Bounds_for_binomial_coefficients&lt;/p&gt;

&lt;p&gt;If&lt;/p&gt;

&lt;p&gt;C(n,k) 2k, C(n,k) &gt; C(n,k-1), so the number of subsets with no more than k elements is&lt;/p&gt;

&lt;p&gt;S = C(n,k)+C(n,k-1)+...+C(n,1)&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Nivi,</p>

<p>I guess you are making your argument from the limits to the binomial coefficients:</p>

<p><a href="http://en.wikipedia.org/wiki/Binomial_coefficient#Bounds_for_binomial_coefficients" rel="nofollow">http://en.wikipedia.org/wiki/Binomial_coefficient#Bounds_for_binomial_coefficients</a></p>

<p>If</p>

<p>C(n,k) 2k, C(n,k) &gt; C(n,k-1), so the number of subsets with no more than k elements is</p>

<p>S = C(n,k)+C(n,k-1)+&#8230;+C(n,1)</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Allan</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1724</link>
		<dc:creator>Allan</dc:creator>
		<pubDate>Wed, 05 Oct 2005 20:55:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1724</guid>
		<description>&lt;p&gt;The number of subsets with (precisely) k elements is n!/(k!(n-k)!) .  It is not a power law.&lt;/p&gt;

&lt;p&gt;Metcalfe: each mmeber can make (n-1) connections, namely to all but himself.  There are therefore n(n-1) ~ O(n^2) connections possible&lt;/p&gt;

&lt;p&gt;Reed: There are 2^n possible subsets of a set of n (different) elements.  For each element, decide if it is in or not.  Two options chosen n times = 2^n possibilities.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>The number of subsets with (precisely) k elements is n!/(k!(n-k)!) .  It is not a power law.</p>

<p>Metcalfe: each mmeber can make (n-1) connections, namely to all but himself.  There are therefore n(n-1) ~ O(n^2) connections possible</p>

<p>Reed: There are 2^n possible subsets of a set of n (different) elements.  For each element, decide if it is in or not.  Two options chosen n times = 2^n possibilities.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Death</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1723</link>
		<dc:creator>Death</dc:creator>
		<pubDate>Wed, 05 Oct 2005 17:36:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1723</guid>
		<description>&lt;p&gt;Aha. I see what you mean.&lt;/p&gt;

&lt;p&gt;Aren&#039;t you opening up yourself to Odlyzkoing? Clearly the cost of finding the right 150 people among the masses, and the diminishing value of overlapping groups wildly reduces the actual value of the network. Metcalfe&#039;s case is at least plausible, since each interaction between two people is disjoint. But being a part of two subnetworks (cliques?) of 150 people that differ by only one person would be a minor annoyance, and being a part of n choose 150 such cliques would be maddening. You should head this off at the pass and figure out a tighter bound.&lt;/p&gt;

&lt;p&gt;What&#039;s the network&#039;s value to an individual member, as opposed to as a whole? Is the value of the network as a whole bounded by the sum of these member valuations? What about leveraging synergies?&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Aha. I see what you mean.</p>

<p>Aren&#8217;t you opening up yourself to Odlyzkoing? Clearly the cost of finding the right 150 people among the masses, and the diminishing value of overlapping groups wildly reduces the actual value of the network. Metcalfe&#8217;s case is at least plausible, since each interaction between two people is disjoint. But being a part of two subnetworks (cliques?) of 150 people that differ by only one person would be a minor annoyance, and being a part of n choose 150 such cliques would be maddening. You should head this off at the pass and figure out a tighter bound.</p>

<p>What&#8217;s the network&#8217;s value to an individual member, as opposed to as a whole? Is the value of the network as a whole bounded by the sum of these member valuations? What about leveraging synergies?</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Nivi</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1710</link>
		<dc:creator>Nivi</dc:creator>
		<pubDate>Tue, 04 Oct 2005 21:51:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1710</guid>
		<description>&lt;p&gt;Death,&lt;/p&gt;

&lt;p&gt;n is a big number. n is much bigger than c. n is the total size of the network. For example, n could be the number of the people on the Internet.&lt;/p&gt;

&lt;p&gt;If you have a 151 people in a network, all the subgroups with 150 people or less are valuable. The 151 person subgroup is not valuable (by assumption).&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Death,</p>

<p>n is a big number. n is much bigger than c. n is the total size of the network. For example, n could be the number of the people on the Internet.</p>

<p>If you have a 151 people in a network, all the subgroups with 150 people or less are valuable. The 151 person subgroup is not valuable (by assumption).</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Death</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1705</link>
		<dc:creator>Death</dc:creator>
		<pubDate>Tue, 04 Oct 2005 15:31:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1705</guid>
		<description>&lt;p&gt;You seem to be using n^150 weirdly here. Are you saying that the value of a 2 node network of this type has a value of 2^150? The notation also suggests that a 151 node network of this type has a value of 151^150, rather than zero.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>You seem to be using n^150 weirdly here. Are you saying that the value of a 2 node network of this type has a value of 2^150? The notation also suggests that a 151 node network of this type has a value of 151^150, rather than zero.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: C. Enrique Ortiz</title>
		<link>http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws/comment-page-1#comment-1700</link>
		<dc:creator>C. Enrique Ortiz</dc:creator>
		<pubDate>Tue, 04 Oct 2005 12:47:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.nivi.com/blog/article/between-metcalfes-and-reeds-laws#comment-1700</guid>
		<description>&lt;p&gt;Interesting thoughts Nivi... You have triggered some thoughts on the measurability and effectiveness of social networks... Thanks.&lt;/p&gt;

&lt;p&gt;ceo&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Interesting thoughts Nivi&#8230; You have triggered some thoughts on the measurability and effectiveness of social networks&#8230; Thanks.</p>

<p>ceo</p>]]></content:encoded>
	</item>
</channel>
</rss>
