Related papers: Majority dynamics and the median process: connecti…
This article considers execution and analysis of laboratory experiments of pedestrians moving in a quasi-one-dimensional system with periodic boundary conditions. To analyze characteristics of jams in the system we aim to use the whole…
People's opinions evolve over time as they interact with their friends, family, colleagues, and others. In the study of opinion dynamics on networks, one often encodes interactions between people in the form of dyadic relationships, but…
We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
The voter model and the Axelrod model are two of the main stochastic processes that describe the spread of opinions on networks. The former includes social influence, the tendency of individuals to become more similar when they interact,…
We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the…
Consider a community where initially, each individual is positive or negative regarding a reform proposal. In each round, individuals gather randomly in fixed rooms of different sizes, and all individuals in a room agree on the majority…
Switching between finitely many continuous-time autonomous steepest descent dynamics for convex functions is considered. Convergence of complete solutions to common minimizers of the convex functions, if such minimizers exist, is shown. The…
Graph burning is a deterministic, discrete-time process that models how influence or contagion spreads in a graph. Associated to each graph is its burning number, which is a parameter that quantifies how quickly the influence spreads. We…
We consider the averaging process on an infinite connected graph with bounded degree and independent, identically distributed starting values or initial opinions. Assuming that the law of the initial opinion of a vertex has a finite second…
The Majority Rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks. We calculate analytically the asymptotic behaviour of the model and derive a phase…
We propose a model for social dynamics on a network. In this model each actor holds a position on some issue, actors and their opinions being associated to vertices of the graph, and, additionally, the actors hold opinions of one another,…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
Frequently we revise our first opinions after talking over with other individuals because we get convinced. Argumentation is a verbal and social process aimed at convincing. It includes conversation and persuasion. In this case, the…
Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
Empirical studies suggest a deep intertwining between opinion formation and decision-making processes, but these have been treated as separate problems in the study of dynamical models for social networks. In this paper, we bridge the gap…
Traffic jams on roadways, echo chambers on social media, crowds of moving pedestrians, and opinion dynamics during elections are all complex social systems. These applications may seem disparate, but some of the questions that they motivate…
We investigate mean-field dynamics of a nonlinear opinion formation model with congregator and contrarian agents. Each agent assumes one of the two possible states. Congregators imitate the state of other agents with a rate that increases…
Experimental studies on vehicular traffic provide data on quantities like density, flux, and mean speed of the vehicles. However, the diagrams relating these variables (the fundamental and speed diagrams) show some peculiarities not yet…