Michael Rogers wrote: > I have some notes somewhere on various ways of defining cluster and > cliques... I'll see if there's anything that could be used to agree on > the membership of a cell.
Two approaches from Knoke & Kuklinski: 1) n-cliques: every member can reach every other in n hops. (We'd need to decide whether paths may pass through non-members for the purposes of calculating the membership.) 2) k-plex cliques: each of the n members is connected to at least n-k others (so a fully connected subgraph is a 1-plex clique). But in either case I'm not sure how to work out which cliques a node belongs to using only its local view of the network. In the k-plex case, what if the clique is larger than my local view? In the n-clique case, if two nodes within n hops of me aren't within n hops of each other, which do I eliminate? Cheers, Michael _______________________________________________ Devl mailing list Devl@freenetproject.org http://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
