PageRank Algorithm Applied To the Food Web
An anonymous reader brings word of a new application for PageRank, Google's link analysis algorithm: monitoring the food web in an ecosystem. A team of researchers found that a modified version of PageRank can predict with great accuracy which species are vital to the existence of others. Quoting:
"Every species is embedded in a complex network of relationships with others. A single extinction can cascade into the loss of seemingly unrelated species. Investigating when this might happen using more conventional methods is complicated, as even in simple ecosystems, the number of combinations exceeds the number of atoms in the universe. So, it would be impossible to try them all. Co-author Dr. Stefano Allesina realized he could apply PageRank to the problem when he stumbled across an article in a journal of applied mathematics describing the Google algorithm. 'First of all, we had to reverse the definition of the algorithm. In PageRank, a web page is important if important pages point to it. In our approach, a species is important if it points to important species.'"
Pagerank is just a repeated application of a transformation matrix. It has the effect of running a Markov model (a way to model discrete states) until there is convergence. He just used a Markov model the way that it is supposed to be used...
I dont get it... what's notable here?
The model helps determine if a species is important. That's the whole point. Previously, we didn't have an easy way to determine a particular species impact on an ecosystem until it was almost extinct or already gone. Now by using "PageRank" to determine their importance, we can model what will happen if specific species are no longer part of the food web.
What does your tweezers and removing atoms have to do with combinations? It is trivial to come up with a situation where there are more possible combinations that atoms of the universe. The number of possible chess games starts to get close (magnitude of 50 versus 80 for the atoms in the universe. Slightly more complex scenarios would easily go past 10^80. The trick is to find a way to model the complexity with a much simpler algorithm.
See my journal for slashdot ID's by year. Mine created in 2005. http://slashdot.org/journal/289875/slashdot-ids-by-year
NO! Page Rank is not named after webPage. It's named after Larry Page who created it. Arrrgh.
http://en.wikipedia.org/wiki/PageRank
http://en.wikipedia.org/wiki/Larry_Page
moox. for a new generation.