Related papers: The cone percolation on $\bbT_d$
We consider a two-dimensional time-inhomogeneous birth-death process to model the time-evolution of fake news in a population. The two components of the process represent, respectively, (i) the number of individuals (say spreaders) who know…
Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order…
Probabilistic graphical models are a powerful concept for modeling high-dimensional distributions. Besides modeling distributions, probabilistic graphical models also provide an elegant framework for performing statistical inference;…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a…
Spatial models for spread of an epidemic may be mapped onto bond percolation. We point out that with disorder in the strength of contacts between individuals patchiness in the spread of the epidemic is very likely, and the criterion for…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…
We consider a rumor model in which the network is divided into three classes of agents: ignorant, spreader, and stifler. A spreader transmits the rumor to each of its ignorant neighbors at rate one, and at the same rate, it becomes a…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
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…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
The propagation of rumours on social media poses an important threat to societies, so that various techniques for rumour detection have been proposed recently. Yet, existing work focuses on \emph{what} entities constitute a rumour, but…
Information diffusion on social networks has been described as a collective outcome of threshold behaviors in the framework of threshold models. However, since the existing models do not take into account individuals' optimization problem,…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
A model for the spreading of online information or "memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys.Rev. X., 2016] in two ways. First, even for a…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
An important class of real-world networks have directed edges, and in addition, some rank ordering on the nodes, for instance the "popularity" of users in online social networks. Yet, nearly all research related to explosive percolation has…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
We propose a realistic generalization of the Maki-Thompson rumour model by assuming that each spreader ceases to propagate the rumour right after being involved in a random number of stifling experiences. We consider the process with a…