Université de Fribourg

Randomizing growing networks with a time-respecting null model

Ren, Zhuo-Ming ; Mariani, Manuel Sebastian ; Zhang, Yi-Cheng ; Medo, Matú?

In: Physical Review E, 2018, vol. 97, no. 5, p. 052311

Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology—a time- respecting null model—that preserves both the network's degree sequence...

Université de Fribourg

A generalized model via random walks for information filtering

Ren, Zhuo-Ming ; Kong, Yixiu ; Shang, Ming-Sheng ; Zhang, Yi-Cheng

In: Physics Letters A, 2016, vol. 380, no. 34, p. 2608–2614

There could exist a simple general mechanism lurking beneath collaborative filtering and interdisciplinary physics approaches which have been successfully applied to online E-commerce platforms. Motivated by this idea, we propose a generalized model employing the dynamics of the random walk in the bipartite networks. Taking into account the degree information, the proposed generalized model...

Université de Fribourg

Characterizing popularity dynamics of online videos

Ren, Zhuo-Ming ; Shi, , Yu-Qiang ; Liao, Hao

In: Physica A: Statistical Mechanics and its Applications, 2016, vol. 453, p. 236–241

Online popularity has a major impact on videos, music, news and other contexts in online systems. Characterizing online popularity dynamics is nature to explain the observed properties in terms of the already acquired popularity of each individual. In this paper, we provide a quantitative, large scale, temporal analysis of the popularity dynamics in two online video-provided websites, namely...

Université de Fribourg

Ranking reputation and quality in online rating systems

Liao, Hao ; Zeng, An ; Xiao, Rui ; Ren, Zhuo-Ming ; Chen, Duan-Bing ; Zhang, Yi-Cheng

In: PLoS ONE, 2014, vol. 9, no. 5, p. e97146

How to design an accurate and robust ranking algorithm is a fundamental problem with wide applications in many real systems. It is especially significant in online rating systems due to the existence of some spammers. In the literature, many well-performed iterative ranking methods have been proposed. These methods can effectively recognize the unreliable users and reduce their weight in judging...

Université de Fribourg

Iterative resource allocation for ranking spreaders in complex networks

Ren, Zhuo-Ming ; Zeng, An ; Chen, Duan-Bing ; Liao, Hao ; Liu, Jian-Guo

In: EPL (Europhysics Letters), 2014, vol. 106, no. 4, p. 48005

Ranking the spreading influence of nodes in networks is a very important issue with wide applications in many different fields. Various topology-based centrality measures have been proposed to identify influential spreaders. However, the spreading influence of a node is usually not only determined by its own centrality but also largely influenced by the centrality of neighbors. To incorporate the...

Université de Fribourg

Evolution characteristics of the network core in the facebook

Liu, Jian-Guo ; Ren, Zhuo-Ming ; Guo, Qiang ; Chen, Duan-Bing

In: PLoS ONE, 2014, vol. 9, no. 8, p. e104028

Statistical properties of the static networks have been extensively studied. However, online social networks are evolving dynamically, understanding the evolving characteristics of the core is one of major concerns in online social networks. In this paper, we empirically investigate the evolving characteristics of the Facebook core. Firstly, we separate the Facebook-link(FL) and Facebook-wall(FW)...