Competitive cluster growth in complex networks.

  title={Competitive cluster growth in complex networks.},
  author={Andr{\'e} A. Moreira and Dem{\'e}trius R Paula and Raimundo N. Costa Filho and Jos{\'e} S. Andrade},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={73 6 Pt 2},
In this work we propose an idealized model for competitive cluster growth in complex networks. Each cluster can be thought of as a fraction of a community that shares some common opinion. Our results show that the cluster size distribution depends on the particular choice for the topology of the network of contacts among the agents. As an application, we show that the cluster size distributions obtained when the growth process is performed on hierarchical networks, e.g., the Apollonian network… Expand

Topics from this paper

Unravelling the size distribution of social groups with information theory in complex networks
AbstractThe minimization of Fisher’s information (MFI) approach of Frieden et al. [Phys. Rev. E 60, 48 (1999)] is applied to the study of size distributions in social groups on the basis of aExpand
Modelling opinion formation driven communities in social networks
A model to study the dynamics of opinion formation in human societies by a co-evolution process involving two distinct time scales of fast transaction and slower network evolution dynamics is proposed and its influence on the conformation of opinion and the size of the resulting communities is studied. Expand
Hierarchical coefficient of a multifractal based network
The hierarchical property for a general class of networks stands for a power-law relation between clustering coefficient, CC and connectivity k: CC∝kβ. This relation is empirically verified inExpand
Locating the Source of Diffusion in Large-Scale Networks
It is shown that it is fundamentally possible to estimate the location of the source of diffusion from measurements collected by sparsely placed observers, and a strategy is presented that is optimal for arbitrary trees, achieving maximum probability of correct localization. Expand
Information cascade on networks
A voting model represents the way in which public perceptions are conveyed to voters by considering three different kinds of networks: a random graph, the Barabasi–Albert (BA) model, and a fitness model. Expand
Network evolution based on minority game with herding behavior
It is shown that the absolute value of σ as well as the corresponding value of memory size depend both on the network topology and on the way along which the agents make their playing decisions in each game round. Expand
Complex social network partition for balanced subnetworks
The proposed Normal Distribution (ND) based method can balance the distribution of the partitioned sub-networks according to the original complex network, which can be very beneficial for analyzing sub-divided networks and potentially reducing the complexity in dynamic online social environment. Expand
Time evolution of the behaviour of Brazilian legislative Representatives using a complex network approach
The goal was to show how to follow Representatives’ and how to show behavior in real situations and observe trends in political crises including the onset of game changing political instabilities. Expand
From Paths to Networks: The Evolving Science of Networks
Path models were always a kludge; a hodgepodge of available technologies cobbled together, as best as possible, to make sense of naturally occurring networks to generate unreliable, simplistic, and inapplicable results. Expand
Evolution of Power Law Features of Data Distribution in Scale-free Networks ⋆
Scale-free topology has been found in various networks from Internet, social networks to protein networks, which means the power law behaviour in network structure. This paper further reports a powerExpand