In: Journal of Statistical Mechanics: Theory and Experiment, 2013, vol. 2013, no. 11, p. P11010
Inferring the network topology from the dynamics is a fundamental problem, with wide applications in geology, biology, and even counter-terrorism. Based on the propagation process, we present a simple method to uncover the network topology. A numerical simulation on artificial networks shows that our method enjoys a high accuracy in inferring the network topology. We find that the infection rate...
|
In: The European Physical Journal B, 2013, vol. 86, no. 9, p. 1-7
During the past few years, users’ membership in the online system (i.e. the social groups that online users joined) were widely investigated. Most of these works focus on the detection, formulation and growth of online communities. In this paper, we study users’ membership in a coupled system which contains user-group and user- object bipartite networks. By linking users’ membership...
|
In: PLoS ONE, 2013, vol. 8, no. 5, p. e62624
Information overload is a serious problem in modern society and many solutions such as recommender system have been proposed to filter out irrelevant information. In the literature, researchers have been mainly dedicated to improving the recommendation performance (accuracy and diversity) of the algorithms while they have overlooked the influence of topology of the online user-object bipartite...
|
In: Chaos: An Interdisciplinary Journal of Nonlinear Science, 2013, vol. 23, no. 1, p. 013104–013104–7
Many real-world networks display a natural bipartite structure, yet analyzing and visualizing large bipartite networks is one of the open challenges in complex network research. A practical approach to this problem would be to reduce the complexity of the bipartite system while at the same time preserve its functionality. However, we find that existing coarse graining methods for monopartite...
|
In: Physics Letters A, 2013, vol. 377, no. 14, p. 1031–1035
Ranking the nodesʼ ability of spreading in networks is crucial for designing efficient strategies to hinder spreading in the case of diseases or accelerate spreading in the case of information dissemination. In the well-known k-shell method, nodes are ranked only according to the links between the remaining nodes (residual links) while the links connecting to the removed nodes (exhausted links)...
|
In: The European Physical Journal B, 2013, vol. 86, no. 2, p. 1-8
People in the Internet era have to cope with the information overload, striving to find what they are interested in, and usually face this situation by following a limited number of sources or friends that best match their interests. A recent line of research, namely adaptive social recommendation, has therefore emerged to optimize the information propagation in social networks and provide...
|
In: Physica A: Statistical Mechanics and its Applications, 2013, p. -
In a recent work [T. Zhou, Z. Kuscsik, J.-G. Liu, M. Medo, J.R. Wakeling, Y.-C. Zhang, Proc. Natl. Acad. Sci. 107 (2010) 4511], a personalized recommendation algorithm with high performance in both accuracy and diversity is proposed. This method is based on the hybridization of two single algorithms called probability spreading and heat conduction, which respectively are inclined to recommend...
|
In: EPL - Europhysics Letters, 2012, vol. 100, no. 5, p. 58005
The recommender system is a very promising way to address the problem of overabundant information for online users. Although the information filtering for the online commercial systems has received much attention recently, almost all of the previous works are dedicated to design new algorithms and consider the user-item bipartite networks as given and constant information. However, many problems...
|
In: Physical Review E - Statistical, Nonlinear and Soft Matter Physics, 2012, vol. 85, no. 6, p. 066130
In a recent work [ Schneider et al. Proc. Natl. Acad. Sci. USA 108 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. Using a greedy algorithm, they found that the optimal structure with respect to this quantity is an onion structure in which high-degree nodes form a core surrounded by rings of nodes with decreasing degree. However, in...
|
In: EPL - Europhysics Letters, 2012, vol. 98, no. 2, p. 28003
Recently, Li et al. (Phys. Rev. Lett., 104 (2010) 018701) studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability Pij~rij−α, where rij is the Manhattan length of the long-range edges. The total length of the additional...
|
