On the topology of higher-order age-dependent random connection models
In this paper, we investigate the potential of the age-dependent random connection model
(ADRCM) with the aim of representing higher-order networks. A key contribution of our work …
(ADRCM) with the aim of representing higher-order networks. A key contribution of our work …
On the tradeoff between almost sure error tolerance versus mean deviation frequency in martingale convergence
LF Estrada, MA Högele, A Steinicke - arXiv preprint arXiv:2310.09055, 2023 - arxiv.org
In this article we quantify almost sure martingale convergence theorems in terms of the
tradeoff between asymptotic almost sure rates of convergence (error tolerance) and the …
tradeoff between asymptotic almost sure rates of convergence (error tolerance) and the …
The trace-reinforced ants process does not find shortest paths
In this paper, we study a probabilistic reinforcement-learning model for ants searching for
the shortest path (s) from their nest to a food source, represented here by two vertices of a …
the shortest path (s) from their nest to a food source, represented here by two vertices of a …
Planar reinforced -out percolation
We investigate the percolation properties of a planar reinforced network model. In this
model, at every time step, every vertex chooses $ k\ge 1$ incident edges, whose weight is …
model, at every time step, every vertex chooses $ k\ge 1$ incident edges, whose weight is …