ﻻ يوجد ملخص باللغة العربية
We propose a model for the social flow of information in the form of text data, which simulates the posting and sharing of short social media posts. Nodes in a graph representing a social network take turns generating words, leading to a symbolic time series associated with each node. Information propagates over the graph via a quoting mechanism, where nodes randomly copy short segments of text from each other. We characterize information flows from these text via information-theoretic estimators, and we derive analytic relationships between model parameters and the values of these estimators. We explore and validate the model with simulations on small network motifs and larger random graphs. Tractable models such as ours that generate symbolic data while controlling the information flow allow us to test and compare measures of information flow applicable to real social media data. In particular, by choosing different network structures, we can develop test scenarios to determine whether or not measures of information flow can distinguish between true and spurious interactions, and how topological network properties relate to information flow.
Contagion models are a primary lens through which we understand the spread of information over social networks. However, simple contagion models cannot reproduce the complex features observed in real-world data, leading to research on more complicate
We propose a thermodynamic version of the Axelrod model of social influence. In one-dimensional (1D) lattices, the thermodynamic model becomes a coupled Potts model with a bonding interaction that increases with the site matching traits. We analytica
During the last years our society was often exposed to the coherent information waves of high amplitudes. These are waves of huge social energy. Often they are of the destructive character, a kind of information tsunami. But, they can carry as well p
The motion of pedestrian crowds (e.g. for simulation of an evacuation situation) can be modeled as a multi-body system of self driven particles with repulsive interaction. We use a few simple situations to determine the simplest allowed functional fo
Social networks are organized into communities with dense internal connections, giving rise to high values of the clustering coefficient. In addition, these networks have been observed to be assortative, i.e. highly connected vertices tend to connect