Related papers: Central Limit Theorem for Majority Dynamics: Bribi…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a…
A proper labelling of a graph $G$ is a pair $({\pi},c_{\pi})$ in which ${\pi}$ is an assignment of numeric labels to some elements of $G$, and $c_{\pi}$ is a colouring induced by ${\pi}$ through some mathematical function over the set of…
This paper focuses on Majority Dynamics in sparse graphs, in particular, as a tool to study internal cuts. It is known that, in Majority Dynamics on a finite graph, each vertex eventually either comes to a fixed state, or oscillates with…
A broad range of dynamical systems involve multi-body interactions, or group interactions, which may not be encoded in traditional graphical structures. In this work, we focus on a canonical example from opinion dynamics, the Majority Rule,…
In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the…
The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…
Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority…
The majority-vote model with noise on random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise…
A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is…
The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…
We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…
Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected…
A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…
This article starts by introducing a new theoretical framework to model spatial systems which is obtained from the framework of interacting particle systems by replacing the traditional graphical structure that defines the network of…
For a graph $G$, the central graph $C(G)$ is the graph constructed from $G$ by subdividing each edge of $G$ with one vertex and also by adding an edge to every pair of non-adjacent vertices in $G$. Also for a graph $G$, let $\gamma(G)$ and…
We study logical limit laws for preferential attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $1$, we start with vertices $0,1$ and $m$ edges between them. At step $n+1$ the vertex…
A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter $q_c$,…