Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Viral Timeline Branching Process to study a Social Network
128
0
0.0
(
0
)
Added by
Ranbir Singh Dhounchak
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Bio-inspired paradigms are proving to be useful in analyzing propagation and dissemination of information in networks. In this paper we explore the use of multi-type branching processes to analyse viral properties of content in a social network, with and without competition from other sources. We derive and compute various virality measures, e.g., probability of virality, expected number of shares, or the rate of growth of expected number of shares etc. They allow one to predict the emergence of global macro properties (e.g., viral spread of a post in the entire network) from the laws and parameters that determine local interactions. The local interactions, greatly depend upon the structure of the timelines holding the content and the number of friends (i.e., connections) of users of the network. We then formulate a non-cooperative game problem and study the Nash equilibria as a function of the parameters. The branching processes modelling the social network under competition turn out to be decomposable, multi-type and continuous time variants. For such processes types belonging to different sub-classes evolve at different rates and have different probabilities of extinction etc. We compute content provider wise extinction probability, rate of growth etc. We also conjecture the content-provider wise growth rate of expected shares.
rate research
Read More
The decomposable branching processes are relatively less studied objects, particularly in the continuous time framework. In this paper, we consider various variants of decomposable continuous time branching processes. As usual practice in the theory of decomposable branching processes, we group various types into irreducible classes. These irreducible classes evolve according to the well-studied nondecomposable/ irreducible branching processes. And we investigate the time evolution of the population of various classes when the process is initiated by the other class particle(s). We obtained class-wise extinction probability and the time evolution of the population in the different classes. We then studied another peculiar type of decomposable branching process where any parent at the transition epoch either produces a random number of offspring, or its type gets changed (which may or may not be regarded as new offspring produced depending on the application). Such processes arise in modeling the content propagation of competing contents in online social networks. Here also, we obtain various performance measures. Additionally, we conjecture that the time evolution of the expected number of shares (different from the total progeny in irreducible branching processes) is given by the sum of two exponential curves corresponding to the two different classes.
Let $left { Z_{n}, nge 0 right }$ be a supercritical branching process in an independent and identically distributed random environment $xi =left ( xi _{n} right )_{ngeq 0} $. In this paper, we get some deviation inequalities for $ln left (Z_{n+n_{0} } / Z_{n_{0} } right ).$ And some applications are given for constructing confidence intervals.
Nowadays, researchers have moved to platforms like Twitter to spread information about their ideas and empirical evidence. Recent studies have shown that social media affects the scientific impact of a paper. However, these studies only utilize the tweet counts to represent Twitter activity. In this paper, we propose TweetPap, a large-scale dataset that introduces temporal information of citation/tweets and the metadata of the tweets to quantify and understand the discourse of scientific papers on social media. The dataset is publicly available at https://github.com/lingo-iitgn/TweetPap
We derive asymptotic properties for a stochastic dynamic network model in a stochastic dynamic population. In the model, nodes give birth to new nodes until they die, each node being equipped with a social index given at birth. During the life of a node it creates edges to other nodes, nodes with high social index at higher rate, and edges disappear randomly in time. For this model we derive criterion for when a giant connected component exists after the process has evolved for a long period of time, assuming the node population grows to infinity. We also obtain an explicit expression for the degree correlation $rho$ (of neighbouring nodes) which shows that $rho$ is always positive irrespective of parameter values in one of the two treated submodels, and may be either positive or negative in the other model, depending on the parameters.
In this article we formalize the problem of modeling social networks into a measure-valued process and interacting particle system. We obtain a model that describes in continuous time each vertex of the graph at a latent spatial state as a Dirac measure. We describe the model and its formal design as a Markov process on finite and connected geometric graphs with values in path space. A careful analysis of some microscopic properties of the underlying process is provided. Moreover, we study the long time behavior of the stochastic particle system. Using a renormalization technique, which has the effect that the density of the vertices must grow to infinity, we show that the rescaled measure-valued process converges in law towards the solution of a deterministic equation. The strength of our general continuous time and measure-valued dynamical system is that their results are context-free, that is, that hold for arbitrary sequences of graphs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
