4 papers
Distributional Computational Graphs: Error Bounds
Olof Hallqvist Elias, Michael Selby, Phillip Stanley-Marbell
We study a general framework of distributional computational graphs: computational graphs whose inputs are probability distributions rather than point values. We analyze the discre…
Quantization of Probability Distributions via Divide-and-Conquer: Convergence and Error Propagation under Distributional Arithmetic Operations
Bilgesu Arif Bilgin, Olof Hallqvist Elias, Michael Selby +1
This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerica…
The fractal cylinder process: existence and connectivity phase transition
Erik Broman, Olof Elias, Filipe Mussini +1
We consider a semi-scale invariant version of the Poisson cylinder model which in a natural way induces a random fractal set. We show that this random fractal exhibits an existence…
Visibility in the vacant set of the Brownian interlacements and the Brownian excursion process
Olof Elias, Johan Tykesson
We consider the Brownian interlacements model in Euclidean space, introduced by A.S. Sznitman in \cite{sznitman2013scaling}. We give estimates for the asymptotics of the visibility…