Related papers: Discordant voting processes on finite graphs
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the…
A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…
A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with colors $1,2,...,t$ such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex $x$ is called…
A proper edge coloring of a simple graph $G$ is called a vertex distinguishing edge coloring (vdec) if for any two distinct vertices $u$ and $v$ of $G$, the set of the colors assigned to the edges incident to $u$ differs from the set of the…
We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color. And edge coloring is a distinguishing coloring if for every non-trivial…
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph $G$, a temporal graph is represented by assigning a set of integer time-labels to every edge $e$ of $G$, indicating the…
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…
Consider an n-vertex graph G = (V,E) of maximum degree Delta, and suppose that each vertex v \in V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it…
We introduce a socially motivated extension of the voter model in which individual voters are also influenced by two opposing, fixed-opinion news sources. These sources forestall consensus and instead drive the population to a politically…
Dynamic graphs refer to graphs whose structure dynamically changes over time. Despite the benefits of learning vertex representations (i.e., embeddings) for dynamic graphs, existing works merely view a dynamic graph as a sequence of changes…
We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval voting with deterministic or uniform tie-breaking rules. We…
The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…
This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the voter model, individuals are located on the vertex set of a connected graph and update their opinion at a constant rate…
Several implicit methods to infer Horizontal Gene Transfer (HGT) focus on pairs of genes that have diverged only after the divergence of the two species in which the genes reside. This situation defines the edge set of a graph, the…
We initiate the study of approximate maximum matching in the vertex partition model, for graphs subject to dynamic changes. We assume that the $n$ vertices of the graph are partitioned among $k$ players, who execute a distributed algorithm…
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…
Understanding and quantifying polarization in social systems is important because of many reasons. It could for instance help to avoid segregation and conflicts in the society or to control polarized debates and predict their outcomes. In…
We introduce a voting model that is similar to a Keynesian beauty contest and analyze it from a mathematical point of view. There are two types of voters-copycat and independent-and two candidates. Our voting model is a binomial…
We study the binary $q$-voter model with generalized anticonformity on random Erd\H{o}s-R\'enyi graphs. In such a model, two types of social responses, conformity and anticonformity, occur with complementary probabilities and the size of…