48 citations · 100 across the 10 of their papers we have counts for
11 papers
Regular decomposition of large graphs and other structures: scalability and robustness towards missing data
Hannu Reittu, Ilkka Norros, Fülöp Bazsó
A method for compression of large graphs and matrices to a block structure is further developed. Szemerédi's regularity lemma is used as a generic motivation of the significance of…
Regular Decomposition: an information and graph theoretic approach to stochastic block models
Hannu Reittu, Fülöp Bazsó, Ilkka Norros
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemerédi's regularity lemma is used as heuristic motivation of the significanc…
On Spatial Point Processes with Uniform Births and Deaths by Random Connection
Francois Baccelli, Fabien Mathieu, Ilkka Norros
This paper is focused on a class of spatial birth and death process of the Euclidean space where the birth rate is constant and the death rate of a given point is the shot noise cr…
Can P2P Networks be Super-Scalable?
François Baccelli, Fabien Mathieu, Ilkka Norros +1
We propose a new model for peer-to-peer networking which takes the network bottlenecks into account beyond the access. This model can cope with key features of P2P networking like…
Spatial Interactions of Peers and Performance of File Sharing Systems
François Baccelli, Fabien Mathieu, Ilkka Norros
We propose a new model for peer-to-peer networking which takes the network bottlenecks into account beyond the access. This model allows one to cope with key features of P2P networ…
Stable, scalable, decentralized P2P file sharing with non-altruistic peers
Barlas Oğuz, Venkat Anantharam, Ilkka Norros
P2P systems provide a scalable solution for distributing large files in a network. The file is split into many chunks, and peers contact other peers to collect missing chunks to ev…