31 citations · 51 across the 8 of their papers we have counts for
8 papers
A network community detection method with integration of data from multiple layers and node attributes
Hannu Reittu, Lasse Leskelä, Tomi Räty
Multilayer networks are in the focus of the current complex network study. In such networks multiple types of links may exist as well as many attributes for nodes. To fully use mul…
Towards analyzing large graphs with quantum annealing and quantum gate computers
Hannu Reittu, Ville Kotovirta, Lasse Leskelä +2
The use of quantum computing in graph community detection and regularity checking related to Szemeredi's Regularity Lemma (SRL) are demonstrated with D-Wave Systems' quantum anneal…
Analysis of large sparse graphs using regular decomposition of graph distance matrices
Hannu Reittu, Lasse Leskelä, Tomi Räty +1
Statistical analysis of large and sparse graphs is a challenging problem in data science due to the high dimensionality and nonlinearity of the problem. This paper presents a fast…
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 the stability of two-chunk file-sharing systems
Ilkka Norros, Hannu Reittu, Timo Eirola
We consider five different peer-to-peer file sharing systems with two chunks, with the aim of finding chunk selection algorithms that have provably stable performance with any inpu…