相关论文: The Sznajd dynamics on a directed clustered networ…

In the modelling of social systems, opinion latency is the idea that once an agent changes its opinion, there will be a period of time where it is immune to other changes. When added to the voter model this leads to a situation where no…

In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, but less attention has been paid to both…

In the consensus model of Sznajd, opinions are integers and a randomly chosen pair of neighbouring agents with the same opinion forces all their neighbours to share that opinion. We propose a simple extension of the model to continuous…

In the last decade the Sznajd Model has been successfully employed in modeling some properties and scale features of both proportional and majority elections. We propose a new version of the Sznajd model with a generalized bounded…

The Sweeny algorithm for the $Q$-state random-cluster model in two dimensions is shown to exhibit a rich mixture of critical dynamical scaling behaviors. As $Q$ decreases, the so-called critical speeding-up for non-local quantities becomes…

We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…

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…

Many social networks, e.g., Slashdot and Twitter, can be represented as directed graphs (digraphs) with two types of links between entities: mutual (bi-directional) and one-way (uni-directional) connections. Social science theories reveal…

In this paper, we investigate the so-called ``Sznajd Model'' (SM) in one dimension, which is a simple cellular automata approach to consensus formation among two opposite opinions (described by spin up or down). To elucidate the SM…

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 the compromise model of continuous opinions proposed by Deffuant et al, the states of two agents in a network can start to converge if they are neighbors and if their opinions are sufficiently close to each other, below a given threshold…

Irreversible opinion spreading phenomena are studied on small-world networks generated from 2D regular lattices by means of the magnetic Eden model, a nonequilibrium kinetic model for the growth of binary mixtures in contact with a thermal…

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the…

In the Sznajd model of 2000, a pair of neighbouring agents on a square lattice convinces its six neighbours of the pair opinion iff the two agents of the pair share the same opinion. Now we replace the usual random sequential updating rule…

Node embeddings are a powerful tool in the analysis of networks; yet, their full potential for the important task of node clustering has not been fully exploited. In particular, most state-of-the-art methods generating node embeddings of…

We present a tight analysis for the well-studied randomized 3-majority dynamics of stabilizing consensus, hence answering the main open question of Becchetti et al. [SODA'16]. Consider a distributed system of n nodes, each initially holding…

Mapping a complex network of $N$coupled identical oscillators to a quantum system, the nearest neighbor level spacing (NNLS) distribution is used to identify collective chaos in the corresponding classical dynamics on the complex network.…

The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with…

Many empirical networks display an inherent tendency to cluster, i.e. to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs,…

This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which unreliable communication links may drop packets. We consider…