相关论文: Weak dynamic monopolies in social graphs

We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…

We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…

We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density…

We introduce a new class of latent process models for dynamic relational network data with the goal of detecting time-dependent structure. Network data are often observed over time, and static network models for such data may fail to…

In social settings, individuals interact through webs of relationships. Each individual is a node in a complex network (or graph) of interdependencies and generates data, lots of data. We label the data by its source, or formally stated, we…

Graphs are a highly expressive abstraction for modeling entities and their relations, such as molecular structures, social networks, and traffic networks. Deep Graph Networks (DGNs) have emerged as a family of deep learning models that can…

Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

Networks observed in real world like social networks, collaboration networks etc., exhibit temporal dynamics, i.e. nodes and edges appear and/or disappear over time. In this paper, we propose a generative, latent space based, statistical…

As a first step toward realizing a dynamical system that evolves while spontaneously determining its own rule for time evolution, function dynamics (FD) is analyzed. FD consists of a functional equation with a self-referential term, given…

A basic model of a dynamical distribution network is considered, 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…

Mechanistic and tractable mathematical models play a key role in understanding how social influence shapes public opinions. Recently, a weighted-median mechanism has been proposed as a new micro-foundation of opinion dynamics and validated…

It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is…

We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…

We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the…

Dynamic networks consist of interconnected dynamical systems. The subsystems can be viewed as transformations of input signals into output signals, where signals flow from one system into another through interconnections. The signal flows…

In this paper we study the susceptible-infectious (SI) epidemiological model using dynamical graphs. Dynamical structures have been recently applied in many areas including complex systems. Dynamical structures include the mutual…

Motivated by the study of social insects, we introduce a stochastic model based on interacting particle systems in order to understand the effect of communication on the division of labor. Members of the colony are located on the vertex set…

In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that connectivity does not necessarily hold, and the network may…

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…

In this paper, we show that several graph parameters are known in different areas under completely different names. More specifically, our observations connect signed domination, monopolies, $\alpha$-domination, $\alpha$-independence,…