Connectivity of random geometric graphs related to minimal spanning forests C Hirsch, D Neuhäuser, V Schmidt Advances in Applied Probability 45 (1), 20-36, 2013 | 26 | 2013 |

A general framework for consistent estimation of charge transport properties via random walks in random environments O Stenzel, C Hirsch, T Brereton, B Baumeier, D Andrienko, D Kroese, ... Multiscale modeling & simulation 12 (3), 1108-1134, 2014 | 16 | 2014 |

Estimation of geodesic tortuosity and constrictivity in stationary random closed sets M Neumann, C Hirsch, J Staněk, V Beneš, V Schmidt Scandinavian Journal of Statistics 46 (3), 848-884, 2019 | 14 | 2019 |

First passage percolation on random geometric graphs and an application to shortest-path trees C Hirsch, D Neuhäuser, C Gloaguen, V Schmidt Advances in Applied Probability 47 (2), 328-354, 2015 | 14 | 2015 |

On the distribution of typical shortest-path lengths in connected random geometric graphs D Neuhäuser, C Hirsch, C Gloaguen, V Schmidt Queueing Systems 71 (1-2), 199-220, 2012 | 14 | 2012 |

Percolation for D2D networks on street systems E Cali, NN Gafur, C Hirsch, B Jahnel, T En-Najjary, RIA Patterson 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad …, 2018 | 13 | 2018 |

Continuum percolation for Cox point processes C Hirsch, B Jahnel, E Cali Stochastic Processes and their Applications 129 (10), 3941-3966, 2019 | 12 | 2019 |

Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations D Neuhäuser, C Hirsch, C Gloaguen, V Schmidt Journal of Statistical Computation and Simulation 84 (7), 1486-1504, 2014 | 10 | 2014 |

Large deviations in relay-augmented wireless networks C Hirsch, B Jahnel, P Keeler, R Patterson Queueing Systems 88 (3-4), 349-387, 2018 | 9 | 2018 |

A parametric copula approach for modelling shortest-path trees in telecommunication networks D Neuhäuser, C Hirsch, C Gloaguen, V Schmidt International Conference on Analytical and Stochastic Modeling Techniques …, 2013 | 9 | 2013 |

Moderate deviations for shortest-path lengths on random segment processes C Hirsch, D Neuhäuser, V Schmidt ESAIM: Probability and Statistics 20, 261-292, 2016 | 8 | 2016 |

From heavy-tailed Boolean models to scale-free Gilbert graphs C Hirsch Brazilian Journal of Probability and Statistics 31 (1), 111-143, 2017 | 7 | 2017 |

Space-time large deviations in capacity-constrained relay networks C Hirsch, B Jahnel, R Patterson arXiv preprint arXiv:1609.06856, 2016 | 7 | 2016 |

Asymptotic properties of Euclidean shortest-path trees in random geometric graphs C Hirsch, D Neuhäuser, C Gloaguen, V Schmidt Statistics & Probability Letters 107, 122-130, 2015 | 7 | 2015 |

Asymptotic properties of collective-rearrangement algorithms C Hirsch, G Gaiselmann, V Schmidt ESAIM: Probability and Statistics 19, 236-250, 2015 | 7 | 2015 |

Large deviations for the capacity in dynamic spatial relay networks C Hirsch, B Jahnel arXiv preprint arXiv:1712.03763, 2017 | 6 | 2017 |

On the absence of percolation in a line-segment based lilypond model C Hirsch Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 52 (1 …, 2016 | 6 | 2016 |

Large deviation principles for connectable receivers in wireless networks C Hirsch, B Jahnel, P Keeler, RIA Patterson Advances in Applied Probability 48 (4), 1061-1094, 2016 | 5 | 2016 |

A Harris‐Kesten theorem for confetti percolation C Hirsch Random Structures & Algorithms 47 (2), 361-385, 2015 | 5 | 2015 |

Joint distributions for total lengths of shortest-path trees in telecommunication networks D Neuhaeuser, C Hirsch, C Gloaguen, V Schmidt annals of telecommunications-annales des télécommunications 70 (5-6), 221-232, 2015 | 5 | 2015 |