Related papers: The Asynchronous DeGroot Dynamics
In this paper, we study the discrete-time consensus problem over networks with antagonistic and cooperative interactions. Following the work by Altafini [IEEE Trans. Automatic Control, 58 (2013), pp. 935--946], by an antagonistic…
The effective resistance between a pair of nodes in a weighted undirected graph is defined as the potential difference induced between them when a unit current is injected at the first node and extracted at the second node, treating edge…
This work extends the recent opinion dynamics model from Cheng et al., emphasizing the role of group pressure in consensus formation. We generalize the findings to incorporate social influence algorithms with general time-varying,…
We investigate the consensus dynamics of the voter model on large random graphs with heterogeneous and directed features, focusing in particular on networks with power-law degree distributions. By extending recent results on sparse directed…
Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted by a question of Ramis Movassagh, renewed the study of a process proposed in the early 1980s by Jean Bourgain. A state vector $v \in \mathbb R^n$, labeled with the…
In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asymptotic distribution of the number of Euler tours of a random…
We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \[ \operatorname{Var}_x(\tau_y)+\mathbb E_x\tau_y \ge \frac{(\mathbb E_x\tau_y)^2}{1+\log n}, \]…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
Consider an undirected graph $G = (VG, EG)$ and a set of six \emph{terminals} $T = \set{s_1, s_2, s_3, t_1, t_2, t_3} \subseteq VG$. The goal is to find a collection $\calP$ of three edge-disjoint paths $P_1$, $P_2$, and $P_3$, where $P_i$…
In this chapter, we derive and analyse models for consensus dynamics on hypergraphs. As we discuss, unless there are nonlinear node interaction functions, it is always possible to rewrite the system in terms of a new network of effective…
Opinion formation cannot be modeled solely as an ideological deduction from a set of principles; rather, repeated social interactions and logic constraints among statements are consequential in the construct of belief systems. We address…
A model for continuous-opinion dynamics is proposed and studied by taking advantage of its similarities with a mono-dimensional granular gas. Agents interact as in the Deffuant model, with a parameter $\alpha$ controlling the persuasibility…
Real-life, out-of-laboratory, measurements of pedestrian movements allow extensive and fully-resolved statistical analyses. However, data acquisition in real-life is subjected to the wide heterogeneity that characterizes crowd flows over…
Unobserved confounding is one of the greatest challenges for causal discovery. The case in which unobserved variables have a widespread effect on many of the observed ones is particularly difficult because most pairs of variables are…
This paper gives lower bounds for the probability of consensus for two spatially explicit stochastic opinion models. Both processes are characterized by two finite connected graphs, that we call respectively the spatial graph and the…
We consider Markovian dynamics on a typical realization of the so-called Directed Configuration Model (DCM), that is, a random directed graph with prescribed in- and out-degrees. In this random geometry, we study the meeting time of two…
A hypergraph $(V,E)$ is called an interval hypergraph if there exists a linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t. $l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a de…
The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole…