Competitive cluster growth in complex networks
arXiv:cond-mat/0603272 · doi:10.1103/PhysRevE.73.065101
Abstract
Understanding the process by which the individuals of a society make up their minds and reach opinions about different issues can be of fundamental importance. In this work we propose an idealized model for competitive cluster growth in complex networks. Each cluster can be thought 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, have a scaling form similar to what has been observed for the distribution of number of votes in an electoral process. We suggest that this similarity is due to the fact that social networks involved in the electoral process may also posses an underlining hierarchical structure.
References in corpus (17)
- Emergence of scaling in random networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- The diameter of the world wide web
- Hierarchical organization of modularity in metabolic networks
- The large-scale organization of metabolic networks
- Classes of behavior of small-world networks
- Hierarchical Organization in Complex Networks
- Self-similarity of complex networks
- Connectivity of Growing Random Networks
- Generic scale of the "scale-free" growing networks
- Robust Patterns in Food Web Structure
- Incomplete ordering of the voter model on small-world networks
- Analytical results for the Sznajd model of opinion formation
- Opinion Formation on a Deterministic Pseudo-fractal Network
- Emergence of Complex Dynamics in a Simple Model of Signaling Networks
- Brazilian elections: voting for a scaling democracy
Cited by in corpus (24)
- Locating the Source of Diffusion in Large-Scale Networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Scaling and universality in proportional elections
- Random walks on the Apollonian network with a single trap
- Ising model on the Apollonian network with node dependent interactions
- Evolution of ethnocentrism on undirected and directed Barabási-Albert networks
- q-state Potts model on the Apollonian network
- Zipf's law from a Fisher variational-principle
- Collaboration networks from a large CV database: dynamics, topology and bonus impact
- Information cascade, Kirman's ant colony model, and kinetic Ising model
- Fisher-information and the thermodynamics of scale-invariant systems
- The price of a vote: diseconomy in proportional elections
- On the Corporate Votes and their relation with Daisy Models
- The thermodynamics of urban population flows
- Correlations between political party size and voter memory: A statistical analysis of opinion polls
- Information cascade on networks
- Modelling opinion formation driven communities in social networks
- Variational Principle underlying Scale Invariant Social Systems
- Time evolution of the behaviour of Brazilian legislative Representatives using a complex network approach
- Do the right thing
- Probing models of information spreading in social networks
- Fundraising and vote distribution: a non-equilibrium statistical approach
- Cost of material or information flow in complex transportation networks
- Optimal box-covering algorithm for fractal dimension of complex networks