4 ms·
The math is tough to grok, but it appears they are using some set constructions to show that given a certain cycle size (4 or more) within a graph, those cycles
by alextheparrot 10y ago
The math is tough to grok, but it appears they are using some set constructions to show that given a certain cycle size (4 or more) within a graph, those cycles are stable (Irreducible) based on some previous work. Thus, network stability is contingent on those cycles and you can extend this to say that the reason social networks don't dissolve is because these subsets give stability to the graph?
- M_Grey 10y agoHonestly, I've had easier times reading through representation theory concerning quantum mechanics! I think I see what it's trying to say though, which appears to be some mathematical basis for what we experience online; communities form, fragment, and it's exceedingly difficult to halt or reverse that process of fragmentation and isolation. Eventually, this trend results in the decoherence of the network. Is that about it?