Information Diffusion on Graphs with Exogenous News Flow

We consider the case when at each time step a certain number of graph nodes change their state under the influence of an exogenous news flow. A model of a competitive information process on undirected graphs is proposed. Еmpirical distributions of the number of vertices reached by a state, the number of news items circulating through the graph, and some other metrics are investigated.