Use of Rapid Probabilistic Argumentation for Ranking on Large Complex Networks

Burak Cetin, Haluk Bingol

We introduce a family of novel ranking algorithms called ERank which run in linear/near linear time and build on explicitly modeling a network as uncertain evidence. The model uses…