activity
20152022
most citedWARM percolation on a regular tree in the strong reinforcement regime

4 citations · 7 across the 11 of their papers we have counts for

collaborators
Showing math.PRShow all

14 papers · 1 filter

math.PR2021

Percolation and connection times in multi-scale dynamic networks

Christian Hirsch, Benedikt Jahnel, Elie Cali

We study the effects of mobility on two crucial characteristics in multi-scale dynamic networks: percolation and connection times. Our analysis provides insights into the question,…

math.PR2020

Extremal life times of persistent loops and holes

Nicolas Chenavier, Christian Hirsch

Persistent homology captures the appearances and disappearances of topological features such as loops and holes when growing disks centered at a Poisson point process. We study ext…

math.PR20204 cited

WARM percolation on a regular tree in the strong reinforcement regime

Christian Hirsch, Mark Holmes, Victor Kleptsyn

We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter which governs the strength of the reinforcement, and a collect…

math.PR2020

Rare Events in Random Geometric Graphs

Christian Hirsch, Sarat B. Moka, Thomas Taimre +1

This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the…

math.PR2020

Extremal linkage networks

Markus Heydenreich, Christian Hirsch

We demonstrate how sophisticated graph properties, such as small distances and scale-free degree distributions, arise naturally from a reinforcement mechanism on layered graphs. Ev…

math.PR2020

Optimal stationary markings

Bartłomiej Błaszczyszyn, Christian Hirsch

Many specific problems ranging from theoretical probability to applications in statistical physics, combinatorial optimization and communications can be formulated as an optimal tu…