A Finite Memory Interacting Pólya Contagion Network and Its Approximating Dynamical Systems
From MaRDI portal
Publication:5073512
DOI10.1137/20M1370525zbMath1490.92116arXiv2010.00463OpenAlexW4225861595MaRDI QIDQ5073512
Bahman Gharesifard, Somya Singh, Fady Alajaji
Publication date: 3 May 2022
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.00463
dynamical systemsMarkov processesstationary distributionPólya urnsfinite memorySIS modelsnetwork contagion
Epidemiology (92D30) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized urn models revisited using stochastic approximation
- Martingale functional central limit theorems for a generalized Pólya urn
- A survey of random processes with reinforcement
- Stochastic epidemic models and their statistical analysis
- Synchronization of reinforced stochastic processes with a network-based interaction
- On a preferential attachment and generalized Pólya's urn model
- A non-homogeneous Markov early epidemic growth dynamics model. Application to the SARS-CoV-2 pandemic
- Stochastic approximation with random step sizes and urn models with random replacement matrices having finite mean
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Synchronization and fluctuation theorems for interacting Friedman urns
- Statistical mechanics of complex networks
- Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
- A dynamic model of social network formation
- Epidemic Processes Over Time-Varying Networks
- A Polya Contagion Model for Networks
- A communication channel modeled on contagion
- Initialization and Curing Policies for Pólya Contagion Networks
- Synchronization via Interacting Reinforcement
- A generalized Pólya's urn with graph based interactions
- Bernard Friedman's Urn
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
This page was built for publication: A Finite Memory Interacting Pólya Contagion Network and Its Approximating Dynamical Systems