Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
We present a model of a `gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short ran...
Peter Horvath, Ian Jermyn, Zoltan Kato, and Josian...
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...