Related papers: Competing contact processes on homogeneous network…
In this work, we revisited the ZGB model in order to study the behavior of its phase diagram when two well-known random networks play the role of the catalytic surfaces: the Random Geometric Graph and the Erd\"{o}s-R\'{e}nyi network. The…
Motivated by the analysis of social networks, we study a model of random networks that has both a given degree distribution and a tunable clustering coefficient. We consider two types of growth processes on these graphs: diffusion and…
In many natural situations one observes a local system with many competing species which is coupled by weak immigration to a regional species pool. The dynamics of such a system is dominated by its stable and uninvadable (SU) states. When…
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…
In ecological systems heterogeneous interactions between pathogens take place simultaneously. This occurs, for instance, when two pathogens cooperate, while at the same time multiple strains of these pathogens co-circulate and compete.…
This mini-project models propagation of shocks, in time point, through links in connected banks. In particular, financial network of 100 banks out of which 15 are shocked to default (that is, 85.00% of the banks are solvent) is modelled…
The stabilizability of wireless networked control systems (WNCSs) is a deterministic binary valued parameter proven to hold if the communication data rate is higher than the sum of the logarithm of unstable eigenvalues of the open-loop…
A mechanism for self-organization of the degree of connectivity in model neural networks is studied. Network connectivity is regulated locally on the basis of an order parameter of the global dynamics which is estimated from an observable…
We study a network of finitely many interacting clusters where each cluster is a collection of globally coupled circle maps in the thermodynamic (or mean field) limit. The state of each cluster is described by a probability measure, and its…
We analyze random networks that change over time. First we analyze a dynamic Erdos-Renyi model, whose edges change over time. We describe its stationary distribution, its convergence thereto, and the SI contact process on the network, which…
In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed…
Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in the connection strengths. Here we study synchronization in weighted complex networks and show that the…
The dynamics of competing opinions in social network play an important role in society, with many applications in diverse social contexts as consensus, elections, morality and so on. Here we study a model of interacting agents connected in…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
We modify the usual Erdos-Renyi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the…
Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…
The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand…
We explore the impact of social noise, characterized by nonconformist behavior, on the phase transition within the framework of the majority rule model. The order-disorder transition can reflect the consensus-polarization state in a social…
In this work, we investigated how the use of complex networks as catalytic surfaces can affect the phase diagram of the Yaldram-Khan model, as well as how the order of the phase transitions present in the seminal work behaves when the…