# christopherj comments on The Virtue of Narrowness - Less Wrong

56 07 August 2007 05:57PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Sort By: Old

You are viewing a single comment's thread.

Comment author: 30 September 2013 07:05:45PM 1 point [-]

A fully connected graph, with an edge between every two vertices, conveys the same amount of information as a graph with no edges at all. The important graphs are the ones where some things are not connected to some other things.

A graph with weighted vertices provides more information than both the above graphs. Also, "connected" in graph theory usually means "there is a path from every node to every other node", not "there are edges between every node". Of course when talking about real things connected to each other, it is usually more interesting to note in what way they are connected, rather than observe that there exists a connection -- and that does require narrowing one's focus.

Comment author: 30 September 2013 07:23:30PM 3 points [-]

Also, "connected" in graph theory usually means "there is a path from every node to every other node", not "there are edges between every node".

The word "fully" there is meant to be a significant qualifier, and he explains what he means immediately afterwards. If he had referred to it as a "complete" graph instead, I don't imagine that as many readers would have understood that sentence, though I probably would have put a "directly" in between "not" and "connected."