Characterizing Motifs in Weighted Complex Networks (2008)
Jari Saramäki, Jukka-pekka Onnela, Janos Kertész, Kimmo Kaski
The local structure of unweighted complex networks can be characterized by the occurrence frequencies of subgraphs in the network. Frequently occurring subgraphs, motifs, have been related to the...
Toivonen, Riitta, Kovanen, Lauri, Kivelä, Mikko, Onnela, Jukka-Pekka, Saramäki, Jari, Kaski, Kimmo
This paper reviews, classifies and compares recent models for social networks that have mainly been published within the physics-oriented complex networks literature. The models fall into two...
Vol. 00, No. 00, Month 200x, 1–15 Efficient data structures for sparse network representation (2008)
Jörkki Hyvönen, Jari Saramäki, Kimmo Kaski
Modern-day computers are characterized by a striking contrast between the processing power of the CPU and the latency of main memory accesses. If the data processed is both large compared to...
From ”binary ” networks to weighted networks (2008)
Jari Saramäki, Saram Ki, Jukka-pekka Jukka, Pekka Onnela, János Nos Kertész, Kert Sz, ...
• Complex networks: a way of looking at complex systems • Elements ⇒ nodes • Interactions ⇒ links • Interaction (or flow) strengths ⇒ link weights • E.g. traffic networks, social...
Jukka-pekka Onnela, Jari Saramäki, Jörkki Hyvönen, Gábor Szabó, Kimmo Kaski, ...
open–access journal for physics