> > is only one hop worse than path compression occuring between the given > > cluster node and other nodes. > Yeah, but with a fully connected graph, you'd need a far greater number of > hops to locate a document than in a small-world graph. Too large for > Freenet to be effective. No, with a fully connected graph you are one hop away from the "epicenter". A fully connected graph is actually ideal in terms of efficiency because the local maxima for closeness is also the global maxima for closeness. A clusters don't eliminate small world graphs for the public network. They only mandate that a node in the public network can be a minimum of 2 hops from any node in a cluster instead of 1. _______________________________________________ Freenet-dev mailing list [EMAIL PROTECTED] http://lists.sourceforge.net/mailman/listinfo/freenet-dev
- Re: [Freenet-dev] Don't Talk To Strangers Mr . Bad
- Re: [Freenet-dev] Don't Talk To Strangers Ian Clarke
- Re: [Freenet-dev] Don't Talk To Strangers Brandon
- Re: [Freenet-dev] Don't Talk To Strangers Ian Clarke
- Re: [Freenet-dev] Don't Talk To Strangers Brandon
- Re: [Freenet-dev] Don't Talk To Strangers Scott G. Miller
- Re: [Freenet-dev] Don't Talk To Stranger... Brandon
- Re: [Freenet-dev] Don't Talk To Str... Ian Clarke
- Re: [Freenet-dev] Don't Talk To Str... Brandon
- Re: [Freenet-dev] Don't Talk To Str... Scott G. Miller
- Re: [Freenet-dev] Don't Talk To Str... Brandon
- Re: [Freenet-dev] Don't Talk To Str... Scott G. Miller
- Re: [Freenet-dev] Don't Talk To Str... Brandon
- Re: [Freenet-dev] Don't Talk To Strangers Matthew Toseland
- Re: [Freenet-dev] Don't Talk To Strangers Matthew Toseland
- Re: [Freenet-dev] Don't Talk To Strangers Ian Clarke
- Re: [Freenet-dev] Don't Talk To Stranger... Matthew Toseland
- Re: [Freenet-dev] Don't Talk To Stranger... Mr . Bad
- Re: [Freenet-dev] Don't Talk To Str... Ian Clarke
- Re: [Freenet-dev] Don't Talk To Str... Brandon
- Re: [Freenet-dev] Don't Talk To Str... Ian Clarke