Network research needs to focus on temporality and weightedness

Oct 05, 2012

The study of complex networks in statistical physics and computational science has become more and more focused on so-called dynamic networks. Where traditional approaches have treated the links in networks as static, contemporary research looks into their development in time and into the individual properties of the links.

Mikko Kivelä, defending his doctoral dissertation for the Aalto University Department of Biomedical Engineering and , presents several novel methods for the of dynamic, weighted and temporal networks.

" are studied on a system-wide scale instead of focusing on each composing part and interaction. This way they display emergent behaviour: patterns and structures, which would be impossible to predict based on single interactions alone, begin to appear, Kivelä explains the basics of his research."

Clustering reveals densities in networks

In weighted networks links are not all alike but have different strengths. Social networks, , connections between or networks representing price correlations in can all be treated as weighted networks.

Together with his colleagues in the Department of Biomedical Engineering and Computational Science, Kivelä studied different methods for the search of dense parts in weighted networks. So-called clustering coefficients enable the analysis of the construction and the functioning of networks.

"We compared ways to generalise the clustering coefficient for weighted networks. Our results help to choose the right way to measure clustering for networks weighted in different manners, Kivelä affirms."

The methods have already been widely used in the research of the , for example.
 
Locating dense community structures – clusters – in networks was performed in Kivelä's research with a method called clique percolation. Clusters may be groups of friends in social networks or groups of close genetic kin in ecological networks.

"We used clique percolation in a new way to make the clusters more accurately represent the actual structure of the network. The search for clusters is now also computationally more powerful thanks to the new algorithm we constructed. Now the method can be used on extremely large network data."

A temporal perspective to network topology

Information presumably travels quickly through a network if it is a 'small world', that is, the majority of the nodes are only a couple of links apart. However, Kivelä discovered that the burstiness of temporal networks significantly slows down the spreading speed.

Burstiness is typical for human communication for instance: short but intensive episodes of activity are followed by long uneventful intermissions in mobile phone and email communication.

Kivelä has studied the spreading of information in bursty temporal networks with null models. He used them to remove features from a database of over 300 million mobile phone calls – circadian patterns and the bursts of the calls among others – until only the basic network structure of the phone calls remained.

"Thus we could discern which properties of the temporal network affect the spreading speed of information. We clearly demonstrated that the bursts slow down the spreading process. We were also able to measure the spreading in the bursts of individual links."

Kivelä suggests that the analysis of would benefit from a focus on the temporal behaviour and the specific properties of individual links, for instance in social networks. In this respect, Kivelä's dissertation provides increasingly nuanced understanding of complex networks.

"The specifics of the people between whom bursts occur, and the way bursts are linked to topology, are mainly unknown as of yet. Also the temporal perspective to the behaviour of networks is still lacking knowledge, Kivelä sketches the direction of future research in the field."

Explore further: Researchers developing algorithms to detect fake reviews

More information: M.Sc. (Tech.) Mikko Kivelä will defend the dissertation "Weighted and Temporal Networks: Towards More Realistic Representations of Complex Systems" on 5 October 2012. Location: Lecture hall F239a, Otakaari 3, 02150, Espoo

add to favorites email to friend print save as pdf

Related Stories

Unraveling biological networks

Mar 05, 2012

A new approach to disentangling the complexities of biological networks, such as the way in which proteins interact in our body's cells has been developed by researchers in China. The team's algorithm could allow biologists ...

Game of go: A complex network

Apr 16, 2012

Could computers ever beat the best go players? Although unthinkable at this stage, this could soon become possible, thanks to CNRS theorists. For the first time, two scientists from the Theoretical Physics ...

Quantum Communication in Random Networks

May 26, 2010

Internet, networks of connections between Hollywood actors, etc, are examples of complex networks, whose properties have been intensively studied in recent times. The small-world property (that everyone has ...

Study finds human communication is 'bursty'

Sep 14, 2011

Researchers in Spain have investigated the temporal patterns of human communication and how the latter impacts the spread of information in social networks. The results, published in the journal Physical Re ...

Recommended for you

Apple issues security warning for iCloud

29 minutes ago

Apple has posted a new security warning for users of its iCloud online storage service amid reports of a concerted effort to steal passwords and other data from people who use the popular service in China.

Review: Better cameras, less glare in iPad Air 2

31 minutes ago

If I've seen you taking photos with a tablet computer, I've probably made fun of you (though maybe not to your face, depending on how big you are). I'm old school: I much prefer looking through the viewfinder ...

Apple sees iCloud attacks; China hack reported

11 hours ago

Apple said Tuesday its iCloud server has been the target of "intermittent" attacks, hours after a security blog said Chinese authorities had been trying to hack into the system.

User comments : 0