Interacting Urn Schemes: a simple and solvable model of Self-Organized Criticality (SOC)

Sunday, October 27, 2024, 3:15 -- 15:45

In this talk, we will introduce a novel model of interactive urn schemes with the goal of obtaining a limiting distribution, which may be considered as a simple and solvable example of Self-Organized Criticality (SOC). The interactions will be defined via a network (possibly infinite). We will show that limit exists under fairly general condition if the underline graph has a specific directed structure. We will further indicate how limits can be proved for more general structure including undirected graphs.
This is a joint work with Deborshi Das.