Editing Machine Learning/Kaggle Social Network Contest/Network Description
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 9: | Line 9: | ||
"A digraph is strongly connected if every vertex is reachable from every other following the directions of the arcs. On the contrary, a digraph is weakly connected if its underlying undirected graph is connected. A weakly connected graph can be thought of as a digraph in which every vertex is "reachable" from every other but not necessarily following the directions of the arcs. A strong orientation is an orientation that produces a strongly connected digraph." [http://en.wikipedia.org/wiki/Glossary_of_graph_theory wikipedia] | "A digraph is strongly connected if every vertex is reachable from every other following the directions of the arcs. On the contrary, a digraph is weakly connected if its underlying undirected graph is connected. A weakly connected graph can be thought of as a digraph in which every vertex is "reachable" from every other but not necessarily following the directions of the arcs. A strong orientation is an orientation that produces a strongly connected digraph." [http://en.wikipedia.org/wiki/Glossary_of_graph_theory wikipedia] | ||
* The | * The Graph is '''not''' weakly connected | ||
* It contains 27 subgraphs This means that it can be broken down into at least two discrete subgraphs. | * It contains 27 subgraphs This means that it can be broken down into at least two discrete subgraphs. | ||
** c.f. [http://cneurocvs.rmki.kfki.hu/igraph/doc/R/clusters.html igraph clustering] | ** c.f. [http://cneurocvs.rmki.kfki.hu/igraph/doc/R/clusters.html igraph clustering] | ||
** There is one very large cluster containing all but 154 verticies, then 4 with size 10 - 37, 8 sized 3 - 7 | ** There is one very large cluster containing all but 154 verticies, then 4 with size 10 - 37, 8 sized 3 - 7, 13 size 2 and one lonely dude. | ||
* I also grabbed the number of strongly connected subgraphs | * I also grabbed the number of strongly connected subgraphs | ||
Line 38: | Line 37: | ||
| 1 | | 1 | ||
|} | |} | ||
* Diameter of the directed graph is 14 | * Diameter of the directed graph is 14 | ||
** This is the longest of the shortest directed paths between two nodes | ** This is the longest of the shortest directed paths between two nodes | ||
Line 97: | Line 47: | ||
*** sum([http://cneurocvs.rmki.kfki.hu/igraph/doc/R/neighborhood.html neighborhood.size](dg, 1, nodes=myGuys, mode="out")) | *** sum([http://cneurocvs.rmki.kfki.hu/igraph/doc/R/neighborhood.html neighborhood.size](dg, 1, nodes=myGuys, mode="out")) | ||
*** mode = "in", "out" or "all" | *** mode = "in", "out" or "all" | ||