
related topics 
{math, number, function} 
{group, member, jewish} 
{rate, high, increase} 
{system, computer, user} 
{law, state, case} 
{@card@, make, design} 

Reed's law is the assertion of David P. Reed that the utility of large networks, particularly social networks, can scale exponentially with the size of the network.
The reason for this is that the number of possible subgroups of network participants is , where N is the number of participants. This grows much more rapidly than either
 the number of participants, N, or
 the number of possible pair connections, (which follows Metcalfe's law).
so that even if the utility of groups available to be joined is very small on a peergroup basis, eventually the network effect of potential group membership can dominate the overall economics of the system.
Contents
Derivation
Given a set A of N people, it has 2^{N} possible subsets. This is not difficult to see, since we can form each possible subset by simply choosing for each element of A one of two possibilities: whether to include that element, or not.
However, this includes the (one) empty set, and N Singletons, which are not properly subgroups. So 2^{N} − N − 1 subsets remain, which is exponential, like 2^{N}.
Quote
From David P. Reed's, "The Law of the Pack" (Harvard Business Review, February 2001, pp 234):
See also
References
External links
Full article ▸


related documents 
Centralizer and normalizer 
Liouville function 
Euler's sum of powers conjecture 
Tomaž Pisanski 
Fibonacci 
Canonical Encoding Rules 
Cypherpunk anonymous remailer 
Face (geometry) 
FIPS county code 
Wilhelm Ackermann 
Vladimir Voevodsky 
SISAL 
List of basic mathematics topics 
Gauss–Markov process 
Code word 
XBasic 
Mrs. Miniver's problem 
Cfront 
Mathematical constants (sorted by continued fraction representation) 
Simple module 
Unavailability 
SuperPoulet number 
Spaced repetition 
RIPEMD 
Type 1 encryption 
Namespace 
Binary symmetric channel 
Pedal triangle 
Elementary event 
Sample space 
