Related papers: Cluster aggregation model for discontinuous percol…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…
We examine the structure of the percolating cluster (PC) formed by site percolation on a random clustered network (RCN) model. Using the generating functions, we formulate the clustering coefficient and assortative coefficient of the PC. We…
We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
We are interested in phase transitions in certain percolation models on point processes and their dependence on clustering properties of the point processes. We show that point processes with smaller void probabilities and factorial moment…
We consider the transient behavior of globally coupled systems of identical pulse coupled oscillators. Synchrony develops through an aggregation phenomenon, with clusters of synchronized oscillators forming and growing larger in time.…
We study a class of growth processes in which clusters evolve via exchange of particles. We show that depending on the rate of exchange there are three possibilities: I) Growth: Clusters grow indefinitely; II) Gelation: All mass is…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
Exchange-driven growth is a process in which pairs of clusters interact and exchange a single unit of mass. The rate of exchange is given by an interaction kernel $K(j,k)$ which depends on the masses of the two interacting clusters. In this…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
We study explosive percolation (EP) on Erd\"{o}s-R\'{e}nyi network for product rule (PR) and sum rule (SR). Initially, it was claimed that EP describes discontinuous phase transition, now it is well-accepted as a probabilistic model for…
Ensembles of networks arise in various fields where multiple independent networks are observed on the same set of nodes, for example, a collection of brain networks constructed on the same brain regions for different individuals. However,…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
The biased link occupation rule in the Achlioptas process (AP) discourages the large clusters to grow much ahead of others and encourages faster growth of clusters which lag behind. In this paper we propose a model where this tendency is…
$k$-Core percolation has served as a paradigmatic model of discontinuous percolation for a long time. Recently it was revealed that the order parameter of $k$-core percolation of random networks additionally exhibits critical behavior. Thus…
Perhaps the best understood phase transition is that in the component structure of the uniform random graph process introduced by Erd\H{o}s and R\'enyi around 1960. Since the model is so fundamental, it is very interesting to know which…
We report on the construction of a granular network of particles to study the formation, evolution and statistical properties of clusters of particles developing at the vicinity of a liquid-solid-like phase transition within a vertically…