Related papers: Sznajd model with synchronous updating on complex …
A computer model is described which is used to assess the dynamical complexity of a class of networks of spiking neurons with small-world properties. Networks are constructed by forming an initially segregated set of highly intra-connected…
Small world networks interpolate between fully regular and fully random topologies and simultaneously exhibit large local clustering as well as short average path length. Small world topology has therefore been suggested to support network…
In the Sznajd consensus model on the square lattice, two people who agree in their opinions convince their neighbours of this opinion. We generalize it to many layers representing many age levels, and check if still a consensus among all…
Reaching consensus -- a macroscopic state where the system constituents display the same microscopic state -- is a necessity in multiple complex socio-technical and techno-economic systems: their correct functioning ultimately depends on…
Real growing networks like the WWW or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the…
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…
The Sznajd model of socio-physics, that only a group of people sharing the same opinion can convince their neighbors, is applied to a scale-free random network modeled by a deterministic graph. We also study a model for elections based on…
We introduce two models of consensus following a majority rule on time-evolving stochastic block models (SBM), in which the network evolution is Markovian or non-Markovian. Under the majority rule, in each round, each agent simultaneously…
The Sznajd model is one of sociophysics's well-known opinion dynamics models. Based on social validation, it has found application in diverse social systems and remains an intriguing subject of study, particularly in scenarios where…
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…
In this work we study a Sznajd-like opinion dynamics on a square lattice of linear size $L$. For this purpose, we consider that each agent has a convincing power $C$, that is a time-dependent quantity. Each high convincing power group of…
In a generalized framework, where multi-state and inter-state linkages are allowed, we derive a sufficient condition for the stability of synchronization in a network of chaotic attractors. This condition explicitly relates the network…
We consider distributed consensus in networks where the agents have integrator dynamics of order two or higher ($n\ge 2$). We assume all feedback to be localized in the sense that each agent has a bounded number of neighbors and consider a…
We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree…
The dynamical process of opinion formation within a model using a local majority opinion updating rule is studied numerically in networks with the small-world geometrical property. The network is one in which shortcuts are added to randomly…
We analyse the so-called small-world network model (originally devised by Strogatz and Watts), treating it, among other things, as a case study of non-linear coupled difference or differential equations. We derive a system of evolution…
We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a…
In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…
We analyze the ordering efficiency and the structure of disordered configurations for the zero-temperature Glauber model on Watts-Strogatz networks obtained by rewiring 2D regular square lattices. In the small-world regime, the dynamics…
We investigate the performance of linear consensus algorithms subject to a scaling of the underlying network size. Specifically, we model networked systems with $n^{\text{th}}$ order integrator dynamics over families of undirected, weighted…