Embed Notice

HTML Code

<blockquote style="position: relative; padding-left: 55px;"><section><a href="https://chaos.social/users/T_X/statuses/113652512102790004">T_X (t_x@chaos.social)'s status on Sunday, 15-Dec-2024 03:32:55 JST</a><a href="https://chaos.social/@T_X" title="t_x@chaos.social"><img src="https://gnusocial.jp/avatar/215859-48-20240426193000.webp" width="48" height="48" alt="T_X" style="position: absolute; left: 0; top: 0;">T_X</a><div><ul><li></ul></div></section><article><p>Have heard of Metcalfe's law and Reed's law for the first time thanks to a <a href="https://chaos.social/@netzpolitik_feed">@netzpolitik_feed</a> article. Which reaffirms my believe + efforts to get <a href="https://chaos.social/tags/multicast" rel="tag">#multicast</a> routing between <a href="https://chaos.social/tags/Freifunk" rel="tag">#Freifunk</a> communities working.<br>The Metalcafe's law says a network grows by value/importance proportional to the square and had a classic telephone network in mind.<br>For multicast I think Reed's law seems more fitting, which considers all potential subgroups, with an exponential value/importance.<br><a href="https://en.wikipedia.org/wiki/Reed%27s_law" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Reed%27s_law</a></p></article><footer><a rel="bookmark" href="https://gnusocial.jp/conversation/4186644#notice-8182252">In conversation</a><time datetime="2024-12-15T03:32:55+09:00" title="Sunday, 15-Dec-2024 03:32:55 JST">about a year ago</time> <span>from <span><a href="https://chaos.social/@T_X/113652512102790004" rel="external" title="Sent from chaos.social via ActivityPub">chaos.social</a></span></span><a href="https://chaos.social/@T_X/113652512102790004">permalink</a><h4>Attachments</h4><ol><li><article><header><div>No result found on File_thumbnail lookup.</div><h5><a href="https://en.wikipedia.org/wiki/Reed%27s_law">Reed's law</a></h5><div></div></header><div>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 sub-groups of network participants is 2N − N − 1, 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, N(N − 1)/2 (which follows Metcalfe's law).
so that even if the utility of groups available to be joined is very small on a per-group basis, eventually the network effect of potential group membership can dominate the overall economics of the system.Derivation
Given a set A of N people, it has 2N 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...</div><footer></footer></article></li></ol></footer></blockquote>

Corresponding Notice

Embed this notice
T_X (t_x@chaos.social)'s status on Sunday, 15-Dec-2024 03:32:55 JSTT_X
- netzpolitik.org
Have heard of Metcalfe's law and Reed's law for the first time thanks to a @netzpolitik_feed article. Which reaffirms my believe + efforts to get #multicast routing between #Freifunk communities working.
The Metalcafe's law says a network grows by value/importance proportional to the square and had a classic telephone network in mind.
For multicast I think Reed's law seems more fitting, which considers all potential subgroups, with an exponential value/importance.
https://en.wikipedia.org/wiki/Reed%27s_law
In conversationabout a year ago from chaos.socialpermalink
Attachments
1. No result found on File_thumbnail lookup.
  Reed's law
  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 sub-groups of network participants is 2N − N − 1, 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, N(N − 1)/2 (which follows Metcalfe's law). so that even if the utility of groups available to be joined is very small on a per-group basis, eventually the network effect of potential group membership can dominate the overall economics of the system. Derivation Given a set A of N people, it has 2N 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...

Public

Embed Notice

HTML Code

Corresponding Notice