Related papers: Incomplete information in scale-free networks
Research in network science has shown that many naturally occurring and technologically constructed networks are scale free, that means a power law degree distribution emerges from a growth model in which each new node attaches to the…
We analyze the degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…
The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing…
Recently, motivated by the pioneer works in revealing the small-world effect and scale-free property of various real-life networks, many scientists devote themselves to studying complex networks. In this paper, we give a brief review on the…
In recent years, there has been a growing recognition that higher-order structures are important features in real-world networks. A particular class of structures that has gained prominence is known as a simplicial complex. Despite their…
There is a pressing need for a description of complex systems that includes considerations of the underlying network of interactions, for a diverse range of biological, technological and other networks. In this work relationships between…
Cascading failures, wherein the failure of one component triggers subsequent failures in complex interconnected systems, pose a significant risk of disruptions and emerge across various domains. Understanding and mitigating the risk of such…
This paper is concerned with the study of scalability in nonlinear heterogeneous networks affected by communication delays and disturbances. After formalizing the notion of scalability, we give two sufficient conditions to assess this…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
The design of mechanisms that encourage pro-social behaviours in populations of self-regarding agents is recognised as a major theoretical challenge within several areas of social, life and engineering sciences. When interference from…
Spreading phenomena are ubiquitous in nature and society. For example, disease, rumor, and information spread over underlying social and information networks. It is well known that there is no threshold for epidemic models on scale-free…
The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behaviors on the structured scale-free network. On the contrary of the conventional wisdom that scale-free…
Recently, contagion-based (disease, information, etc.) spreading on social networks has been extensively studied. In this paper, other than traditional full interaction, we propose a partial interaction based spreading model, considering…
In this chapter we want to provide a review of the main results obtained in the modeling of epidemic spreading in scale-free networks. In particular, we want to show the different epidemiological framework originated by the lack of any…
The statistical property of a growing scale-free network is studied based on an earlier model proposed by Krapivsky, Rodgers, and Redner [Phys. Rev. Lett. 86, 5401 (2001)], with the additional constraints of forbidden of self-connection and…
This paper deals with the estimation of exogeneous peer effects for partially observed networks under the new inferential paradigm of design identification, which characterizes the missing data challenge arising with sampled networks with…
We introduce a simple one-parameter network growth algorithm which is able to reproduce a wide variety of realistic network structures but without having to invoke any global information about node degrees such as preferential-attachment…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…
This is a natural generalization of the previous work by Dan, "Modeling and Simulation of Diffusion Phenomena on Social Networks," to appear in The proceedings of 2011 Third International Conference on Computer Modeling and Simulation. In…
The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any…