Related papers: Critical threshold and dynamics of a general rumor…
Within the conventional statistical physics framework, we study critical phenomena in a class of configuration network models with hidden variables controlling links between pairs of nodes. We find analytical expressions for the average…
The existence or not of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree…
Scale-free networks constitute a fast-developing field that has already provided us with important tools to understand natural and social phenomena. From biological systems to environmental modifications, from quantum fields to high energy…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…
We analytically determine when a range of abstract social contagion models permit global spreading from a single seed on degree-correlated random networks. We deduce the expected size of the largest vulnerable component, a network's…
The numerous expanding online social networks offer fast channels for misinformation spreading, which could have a serious impact on socioeconomic systems. Researchers across multiple areas have paid attention to this issue with a view of…
Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not…
In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spreading velocity reaches a peak quickly then decays in a…
In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information…
Rumor spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumor is propagated by pairwise interactions between spreaders and ignorants. Spreaders can become stiflers only after…
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In each round, every informed node sends the rumor to a random…
This study is concerned with the dynamical behaviors of epidemic spreading over a two-layered interconnected network. Three models in different levels are proposed to describe cooperative spreading processes over the interconnected network,…
Complex networks of real-world systems are believed to be controlled by common phenomena, producing structures far from regular or random. These include scale-free degree distributions, small-world structure and assortative mixing by…
Complex network theory crucially depends on the assumptions made about the degree distribution, while fitting degree distributions to network data is challenging, in particular for scale-free networks with power-law degrees. We present a…
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…
Rumors flooding on rapidly-growing online social networks has geared much attention from many fronts. Individuals can transmit rumors via numerous channels since they can be active on multiple platforms. However, no systematic theoretical…
We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erdos and Renyi. In this theory, a network is characterized by two parameters: the size…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
A randomized distributed algorithm called RAES was introduced in [Becchetti et al., SODA 2020] to extract a bounded-degree expander from a dense $n$-vertex expander graph $G = (V, E)$. The algorithm relies on a simple threshold-based…
Network epidemiology often assumes that the relationships defining the social network of a population are static. The dynamics of relationships is only taken indirectly into account, by assuming that the relevant information to study…