惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

F
Fortinet All Blogs
Last Week in AI
Last Week in AI
IT之家
IT之家
A
About on SuperTechFans
M
MIT News - Artificial intelligence
Y
Y Combinator Blog
T
The Blog of Author Tim Ferriss
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 三生石上(FineUI控件)
博客园 - 【当耐特】
V
Visual Studio Blog
Microsoft Security Blog
Microsoft Security Blog
博客园_首页
aimingoo的专栏
aimingoo的专栏
The Cloudflare Blog
Vercel News
Vercel News
博客园 - Franky
有赞技术团队
有赞技术团队
B
Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
GbyAI
GbyAI
量子位
云风的 BLOG
云风的 BLOG
T
Tailwind CSS Blog

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
A Viral Timeline Branching Process to study a Social Network
Ranbir Dhounchak, Veeraruna Kavitha, Eitan Altman · 2017-05-27 · via math.PR updates on arXiv.org

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.