相关论文: Weak dynamic monopolies in social graphs
In a graph $ G $, a subset of vertices $ S $ is called an efficient dominating set (EDS) if every vertex in the graph is uniquely dominated by exactly one vertex in $ S $. A graph is said to be efficiently dominatable if it contains an EDS.…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
A set $D \subseteq V$ of a graph $G=(V, E)$ is a dominating set of $G$ if each vertex $v\in V\setminus D$ is adjacent to at least one vertex in $D,$ whereas a set $D_2\subseteq V$ is a $2$-dominating (double dominating) set of $G$ if each…
This article formalizes the problem of modeling social networks into an interacting particle system on random geometric graphs. Each vertex of the graph is associated with a geometric position in a latent space describing the unobserved…
A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating…
Built upon the shoulders of graph theory, the field of complex networks has become a central tool for studying real systems across various fields of research. Represented as graphs, different systems can be studied using the same analysis…
Given a graph G=(V, E), a vertex is said to ve-dominate an edge if it is either incident with the edge or adjacent to one of its endpoints. A set of vertices is a ve-dominating set if it ve-dominates every edge of the graph. We introduce…
Online social networks represent a main source of communication and information exchange in today's life. They facilitate exquisitely news sharing, knowledge elicitation, and forming groups of same interests. Researchers in the last two…
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
Dynamic networks are used in a wide range of fields, including social network analysis, recommender systems, and epidemiology. Representing complex networks as structures changing over time allow network models to leverage not only…
Twin nodes in a static network capture the idea of being substitutes for each other for maintaining paths of the same length anywhere in the network. In dynamic networks, we model twin nodes over a time-bounded interval, noted…
Viral information like rumors or fake news is spread over a communication network like a virus infection in a unidirectional manner: entity $i$ conveys information to a neighbor $j$, resulting in two equally informed (infected) parties.…
We explore the role of intrinsic structural properties of hypergraphs in governing group-driven social dynamics with social reinforcement. First, we analyze simplicial contagion dynamics on random hypergraphs in which the level of hyperedge…
The open neighbourhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $D\subseteq V(G)$, we define $\overline{D}=V(G)\setminus D$. A set $D\subseteq V(G)$ is called a super dominating…
The structure and dynamic of social network are largely determined by the heterogeneous interaction activity and social capital allocation of individuals. These features interplay in a non-trivial way in the formation of network and…
Threshold models and their dynamics may be used to model the spread of `behaviors' in social networks. Regarding such from a modal logical perspective, it is shown how standard update mechanisms may be emulated using action models -- graphs…
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…
We consider distributed inference in social networks where a phenomenon of interest evolves over a given social interaction graph, referred to as the \emph{social digraph}. For inference, we assume that a network of agents monitors certain…