Fall 2009 talk for NAACSOS meeting

right click to download my NAACSOS2009.ppt

Long Cycles

Idea that didn't work for 2 fall talks at ASU: NACSOS (1) the K + x top subset centrality nodes, where K is the number of independent cycles, are the central nodes of the network: For K cycles, you need at least a minimal spanning tree of x = f(K) nodes.

(1) weight the edges by subgraph centrality and do weighted spring embedding to see the centrally placed independent cycles, colored by a partition for the top K.

(2) do a triad census, weight the 3-cliques