1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.PR2024
Random Connection Hypergraphs
Morten Brun, Christian Hirsch, Peter Juhasz +1
In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is c…
math.PR2023
Poisson approximation of fixed-degree nodes in weighted random connection models
Christian Hirsch, Benedikt Jahnel, Sanjoy Kumar Jhawar +1
We present a process-level Poisson-approximation result for the degree-k vertices in a high-density weighted random connection model with preferential-attachment kernel in the unit…
math.PR2023★ 1 cited
On the topology of higher-order age-dependent random connection models
Christian Hirsch, Peter Juhasz
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…