168 citations · 259 across the 5 of their papers we have counts for
5 papers
Weighted hypersoft configuration model
Ivan Voitalov, Pim van der Hoorn, Maksim Kitsak +2
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequence…
Problems with classification, hypothesis testing, and estimator convergence in the analysis of degree distributions in networks
Pim van der Hoorn, Ivan Voitalov, Remco van der Hofstad +1
In their recent work "Scale-free networks are rare", Broido and Clauset address the problem of the analysis of degree distributions in networks to classify them as scale-free at di…
Link prediction with hyperbolic geometry
Maksim Kitsak, Ivan Voitalov, Dmitri Krioukov
Link prediction is a paradigmatic problem in network science with a variety of applications. In latent space network models this problem boils down to ranking pairs of nodes in the…
Scale-free Networks Well Done
Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad +1
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distrib…
Geohyperbolic Routing and Addressing Schemes
Ivan Voitalov, Rodrigo Aldecoa, Lan Wang +1
The key requirement to routing in any telecommunication network, and especially in Internet-of-Things (IoT) networks, is scalability. Routing must route packets between any source…