A new model for efficient ranking in networks

Caterina De BaccoDaniel B. LarremoreCristopher Moore  published a new algorithm with the title A physical model for efficient ranking in networks.  The model is based on binary interactions among the entities. As often in  physical models, interactions via edges are considered as mechanical springs, and the optimal rankings of the nodes are minimizes the total energy (or “energy”) of the system. They show some examples for identifying  prestige, dominance, and social hierarchies in human and animal communities.

Further studies will tell how efficient is the new algorithm.



3 thoughts on “A new model for efficient ranking in networks”

  1. This reminds me of multidmensional scaling and multiple multidimensional scaling (Tusnády, Telegdi etc.). They rank things which are characterized by vectorial quantities – by trying to find a curve along which the points representing the objects can be ordered. Somehow graphs had to be embedded and an optimal stucture was found via thinking that the vertices are connected by springs. (This is not a text to be published in Annals of Mathematics :))


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 )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s