scale free networks

In a lovely paper, Geoffrey Grinstein and Ralph Linsker write about synchronous activity in scale-free networks. Scale-free (also known as “small world”) networks have the property that no node is greater than N hops from any other. These gents show that this topology can persist over a node-set of arbitrary size. This handily mitigates a concern of mine regarding the scalability of various Distributed Hash Table algorithms I’ve been pondering.

Another upshot is that I need to think of some kind of experimental protocol that would allow me to assess the topology of biofilms’ chemical networks.

In other topology news, the evolutionary tree is looking bushier every day.

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