相关论文: Agreement dynamics on directed random graphs
We continue to study a model of disordered interface growth in two dimensions. The interface is given by a height function on the sites of the one--dimensional integer lattice and grows in discrete time: (1) the height above the site $x$…
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We study a system of hard-core particles sliding downwards on a fluctuating one-dimensional surface which is characterized by a dynamical exponent $z$. In numerical simulations, an initially random particle density is found to coarsen and…
We consider a system in which a group of agents represented by the vertices of a graph synchronously update their opinion based on that of their neighbours. If each agent adopts a positive opinion if and only if that opinion is sufficiently…
We study the equilibrium properties of an Ising model on a disordered random network where the disorder can be quenched or annealed. The network consists of four-fold coordinated sites connected via variable length one-dimensional chains.…
We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlation and response functions (as for fully connected systems),…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…
Opinion dynamics is a central subject of computational social science, and various models have been developed to understand the evolution and formulation of opinions. Existing models mainly focus on opinion dynamics on graphs that only…
In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing time-delays. The proposed algorithm adds a storage variable to the agents'…
We consider the disordering dynamics of an interacting binary alloy with a small admixture of vacancies which mediate atom-atom exchanges. Starting from a perfectly phase-segregated state, the system is rapidly heated to a temperature in…
In this work, we introduce a Z-control strategy for multi-agent systems of arbitrary order, aimed at driving the agents toward consensus in the highest-order observable state. The proposed framework supports both direct and indirect control…
We introduce a three-state model to study the effects of a neutral party on opinion spreading, in which the tendency of agents to agree with their neighbors can be tuned to favor either the neutral party or two oppositely polarized parties,…
We consider two social consensus models, the AB-model and the Naming Game restricted to two conventions, which describe a population of interacting agents that can be in either of two equivalent states (A or B) or in a third mixed (AB)…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
A generic feature of bounded confidence type models is the formation of clusters of agents. We propose and study a variant of bounded confidence dynamics with the goal of inducing unconditional convergence to a consensus. The defining…
We examine the dynamics and stripe formation in a system with competing short and long range interactions in the presence of both an applied dc drive and quenched disorder. Without disorder, the system forms stripes organized in a labyrinth…
We investigate consensus dynamics on temporal hypergraphs that encode network systems with time-dependent, multi-way interactions. We compare this dynamics with that on appropriate projections of this higher-order network representation…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
The dynamical properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding, and in the context of hat games, such as the guessing game and Winkler's hat game. The…