top | item 39044316

(no title)

atleta | 2 years ago

> Generally speaking, "the value of a graph is proportional to the square of the number of edges"

No, what Metcalfe's law assumes is that the value of the graph is proportional to the number of edges (not their square). And from that assumption and the fact that the graph is fully connected follows that it's proportional to the square of the number of nodes. (Because you can have (n-1)*n/2 edges with n nodes in a fully connected graph.

And hence, the Reiser quote above is similar but it emphasizes something else: it states what Metcalfe's law (I think) uses as a premise (or implicit claim) that the value is in the connections. Because it's not necessarily a fully connected graph.

Edit: originally I've given (n-1)*2/2 as the number of edges instead of (n-1)*n/2.

discuss

order

amomchilov|2 years ago

Promotional to the number of _edges_. Edges are proportional to the square of the number of nodes, so the value of the network overall is proportional to the square of the nodes.

Think of it this way, for every new user added to the network: * the new user is enriched proportional to the number of existing users * every existing user is enriched by the 1 new user

This double-counting is what gives it the quadratic growth.

atleta|2 years ago

Yep. That's what I was saying too. The first line of my comment quotes the GP and I was correcting that.

dekhn|2 years ago

So, the wikipedia first line is wrong, you're saying? "Metcalfe's law states that the financial value or influence of a telecommunications network is proportional to the square of the number of connected users of the system"

Later in the article it seems like the original stating is more consistent with what you said, but everything I've ever learned in network theory and practice shows that it scales as a power of number of edges, and the logarithm of the number of nodes.

gnramires|2 years ago

The number of connected users is different from the number of user connections :)

The first is the number of nodes, the second edges.