Related papers: Central Limit Theorem for Majority Dynamics: Bribi…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…
In the averaging process on a graph $G = (V, E)$, a random mass distribution $\eta$ on $V$ is repeatedly updated via transformations of the form $\eta_{v}, \eta_{w} \mapsto (\eta_{v} + \eta_{w})/2$, with updates made according to…
We study random dynamical systems composed of LSV maps with varying parameters, without any mixing assumptions on the base space of random dynamics. We establish a quenched central limit theorem and identify conditions under which the…
A general multi-type population model is considered, where individuals live and reproduce according to their age and type, but also under the influence of the size and composition of the entire population. We describe the dynamics of the…
We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has…
Consider the sample covariance matrix $$\Sigma^{1/2}XX^T\Sigma^{1/2}$$ where $X$ is an $M\times N$ random matrix with independent entries and $\Sigma$ is an $M\times M$ diagonal matrix. It is known that if $\Sigma$ is deterministic, then…
Motivated by majority vertex-colorings of graphs and digraphs and majority edge-colorings of graphs, we introduce two concepts of strong majority colorings. A strong majority vertex-coloring of a graph $G=(V,E)$ is a mapping $c:V\rightarrow…
A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor…
We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…
Self-learning is a classical approach for learning with both labeled and unlabeled observations which consists in giving pseudo-labels to unlabeled training instances with a confidence score over a predetermined threshold. At the same time,…
Let $A_n$ be an $n$ by $n$ random matrix whose entries are independent real random variables with mean zero, variance one and with subexponential tail. We show that the logarithm of $|\det A_n|$ satisfies a central limit theorem. More…
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
Let $G=G(n)$ be a graph on $n$ vertices with maximum degree $\Delta=\Delta(n)$. Assign to each vertex $v$ of $G$ a list $L(v)$ of colors by choosing each list independently and uniformly at random from all $k$-subsets of a color set…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
Consider a graph $G$ and an initial coloring, where each node is blue or red. In each round, all nodes simultaneously update their color based on a predefined rule. In a threshold model, a node becomes blue if a certain number or fraction…
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…
Given $\eta \in [0, 1]$, a colouring $C$ of $V(G)$ is an $\eta$-majority colouring if at most $\eta d^+(v)$ out-neighbours of $v$ have colour $C(v)$, for any $v \in V(G)$. We show that every digraph $G$ equipped with an assignment of lists…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…