An Urn Model for Cascading Failures on a Lattice

A cascading failure is a failure in a system of interconnected parts, in which the breakdown of one element can lead to the subsequent collapse of the others. The aim of this paper is to introduce a simple combinatorial model for the study of cascading failures. In particular, having in mind particle systems and Markov random fields, we take into consideration a network of interacting urns displaced over a lattice. Every urn is Pólya-like and its reinforcement matrix is not only a function of time (time contagion) but also of the behavior of the neighboring urns (spatial contagion), and of a random component, which can represent either simple fate or the impact of exogenous factors. In this way a non-trivial dependence structure among the urns is built, and it is used to study default avalanches over the lattice. Thanks to its flexibility and its interesting probabilistic properties, the given construction may be used to model different phenomena characterized by cascading failures such as power grids and financial networks.

An urn-based Bayesian block bootstrap

Block bootstrap has been introduced in the literature for resampling dependent data, i.e. stationary processes. One of the main assumptions in block bootstrapping is that the blocks of observations are exchangeable, i.e. their joint distribution is immune to permutations. In this paper we propose a new Bayesian approach to block bootstrapping, starting from the construction of exchangeable blocks. Our sampling mechanism is based on a particular class of reinforced urn processes