Posted: January 12, 2011 by Wildcat in Uncategorized

A new algorithm spreads information (red) much more efficiently in networks characterized by sparse connections between densely interlinked clusters.
Graphic: Christine Daniloff

via 4.bp.blogspot.com

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s