Related papers: The Sznajd dynamics on a directed clustered networ…
The Sznajd model, where two people having the same opinion can convince their neighbours on the square lattice, is modified in the sense of Deffuant et al and Hegselmann, that only neighbours of similar opinions can be convinced. Then…
A simple model of opinion formation dynamics in which binary-state agents make up their opinions due to the influence of agents in a local neighborhood is studied using different network topologies. Each agent uses two different strategies,…
Since some realistic networks are influenced not only by increment behavior but also by tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this…
We study the synchronization of coupled maps on a variety of networks including regular one and two dimensional networks, scale free networks, small world networks, tree networks, and random networks. For small coupling strengths nodes show…
The study of social networks is a burgeoning research area. However, most existing work deals with networks that simply encode whether relationships exist or not. In contrast, relationships in signed networks can be positive ("like",…
Monte Carlo simulations of a Sznajd model show that if a near-consensus is formed out of four initially equally widespread opinions, the one which at intermediate times is second in the number of adherents usually loses out against the…
Link prediction problem has increasingly become prominent in many domains such as social network analyses, bioinformatics experiments, transportation networks, criminal investigations and so forth. A variety of techniques has been developed…
We have defined a new type of clustering scheme preserving the connectivity of the nodes in network ignored by the conventional Migdal-Kadanoff bond moving process. Our new clustering scheme performs much better for correlation length and…
How does social network structure amplify or stifle behavior diffusion? Existing theory suggests that when social reinforcement makes the adoption of behavior more likely, it should spread more -- both farther and faster -- on clustered…
We present a network influence game that models players strategically seeding the opinions of nodes embedded in a social network. A social learning dynamic, whereby nodes repeatedly update their opinions to resemble those of their…
Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each…
In this paper, we propose a Boltzmann-type kinetic description of opinion formation on social networks, which takes into account a general connectivity distribution of the individuals. We consider opinion exchange processes inspired by the…
Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for…
In this two-part paper, we consider multicomponent systems in which each component can iteratively exchange information with other components in its neighborhood in order to compute, in a distributed fashion, the average of the components'…
The Sznajd model, which describes opinion formation and social influence, is treated analytically on a complete graph. We prove the existence of the phase transition in the original formulation of the model, while for the Ochrombel…
The network of Barabasi and Albert, a preferential growth model where a new node is linked to the old ones with a probability proportional to their connectivity, is applied to Brazilian election results. The application of the Sznajd rule,…
Polarization is a well-documented phenomenon across a wide range of social issues. However, prevailing theories often compartmentalize the examination of herding behavior and opinion convergence within different contexts. In this study, we…
We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions - preferential attachment,…
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases…
In this work we present novel results to the problem of the Hegselmann-Krause dynamics in networks obtained by an extensive study of the behavior of the standard order parameter sensitive to the onset of consensus: the normalized size of…