Marcel Ortgiese
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Marcel Ortgiese has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Jochen Blath
Goethe-Universität
8 shared publications - Michael Scheutzow
Technische Universität Berlin
6 shared publications - Peter Mörters
University of Cologne
4 shared publications Matthew I. Roberts
3 shared publications- Bas Lodewijks
Universität Augsburg and University of Sheffield
2 shared publications - Hanna Döring
Osnabrück University Germany
2 shared publications
Latest Publications
- 25 October 2025
- Published by Springer Nature
- p. 51-74
Der Satz von Hattendorff
- 25 October 2025
- Published by Springer Nature
- p. 119-179
Dynamische Risikomodelle und Ruintheorie
- 25 October 2025
- Published by Springer Nature
- p. 3-15
Finanzmathematische Grundlagen
- 25 October 2025
- Published by Springer Nature
- p. 17-49
Modellierung von Lebensversicherungsverträgen
- 25 October 2025
- Published by Springer Nature
- p. 181-215
Prämienprinzipien, Risikomaße und Erfahrungstarifierung
- 25 October 2025
- Published by Springer Nature
- p. 181-215
Prämienprinzipien, Risikomaße und Erfahrungstarifierung
- 25 October 2025
- Published by Springer Nature
- p. 77-116
Statische Risikomodelle
- 1 August 2024
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 34 (4) , 3469-3540
The maximal degree in random recursive graphs with random weights
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the network, so that a new vertex connects to one of the old vertices with a probability that is proportional to their vertex-weight. We first identify the asymptotic degree distribution of a uniformly chosen vertex for a general vertex-weight distribution. For the maximal degree, we distinguish several classes that lead to different behaviour: For bounded vertex-weights we obtain results for the maximal degree that are similar to those observed for RRTs and DAGs. If the vertex-weights have unbounded support, then the maximal degree has to satisfy the right balance between having a high vertex-weight and being born early. For vertex-weights in the Fréchet maximum domain of attraction the first-order behaviour of the maximal degree is random, while for those in the Gumbel maximum domain of attraction the leading order is deterministic. Surprisingly, in the latter case, the second order is random when considering vertices in a compact window in the optimal region, while it becomes deterministic when considering all vertices.
- 1 August 2024
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 34 (4) , 3469-3540
The maximal degree in random recursive graphs with random weights
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the network, so that a new vertex connects to one of the old vertices with a probability that is proportional to their vertex-weight. We first identify the asymptotic degree distribution of a uniformly chosen vertex for a general vertex-weight distribution. For the maximal degree, we distinguish several classes that lead to different behaviour: For bounded vertex-weights we obtain results for the maximal degree that are similar to those observed for RRTs and DAGs. If the vertex-weights have unbounded support, then the maximal degree has to satisfy the right balance between having a high vertex-weight and being born early. For vertex-weights in the Fréchet maximum domain of attraction the first-order behaviour of the maximal degree is random, while for those in the Gumbel maximum domain of attraction the leading order is deterministic. Surprisingly, in the latter case, the second order is random when considering vertices in a compact window in the optimal region, while it becomes deterministic when considering all vertices.
- Open Access
Cluster sizes in subcritical soft Boolean models
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed radius and each pair of vertices is assigned another independent Pareto weight with a potentially different tail exponent. Two vertices are now connected if they are within distance of the larger radius multiplied by the edge weight. We determine the tail behaviour of the Euclidean diameter and the number of points of a typical maximally connected component in a subcritical percolation phase. For this, we present a sharp criterion in terms of the tail exponents of the edge-weight and radius distributions that distinguish a regime where the tail behaviour is controlled only by the edge exponent from a regime in which both exponents are relevant. Our proofs rely on fine path-counting arguments identifying the precise order of decay of the probability that far-away vertices are connected.
Open AccessCluster sizes in subcritical soft Boolean models
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed radius and each pair of vertices is assigned another independent Pareto weight with a potentially different tail exponent. Two vertices are now connected if they are within distance of the larger radius multiplied by the edge weight. We determine the tail behaviour of the Euclidean diameter and the number of points of a typical maximally connected component in a subcritical percolation phase. For this, we present a sharp criterion in terms of the tail exponents of the edge-weight and radius distributions that distinguish a regime where the tail behaviour is controlled only by the edge exponent from a regime in which both exponents are relevant. Our proofs rely on fine path-counting arguments identifying the precise order of decay of the probability that far-away vertices are connected.
- Open Access
The contact process with fitness on random trees
The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing inhomogeneous transmission rates among individuals. In this paper, we establish conditions under which this inhomogeneous contact process exhibits a phase transition. We first prove that if certain mixed moments of the joint offspring and fitness distribution are finite, then the survival threshold is strictly positive. Further, we show that, if slightly different mixed moments are infinite, then this implies that there is no phase transition and the process survives with positive probability for any choice of the infection parameter. A similar dichotomy is known for the contact process on a Bienaym\'e-Galton-Watson tree. However, we show that the introduction of fitness means that we have to take into account the combined effect of fitness and offspring distribution to decide which scenario occurs.
Open AccessThe contact process with fitness on random trees
The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing inhomogeneous transmission rates among individuals. In this paper, we establish conditions under which this inhomogeneous contact process exhibits a phase transition. We first prove that if certain mixed moments of the joint offspring and fitness distribution are finite, then the survival threshold is strictly positive. Further, we show that, if slightly different mixed moments are infinite, then this implies that there is no phase transition and the process survives with positive probability for any choice of the infection parameter. A similar dichotomy is known for the contact process on a Bienaym\'e-Galton-Watson tree. However, we show that the introduction of fitness means that we have to take into account the combined effect of fitness and offspring distribution to decide which scenario occurs.
- Open Access
- 25 January 2023
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 158, 505-569
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
- 25 January 2023
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 158, 505-569
Open AccessFine asymptotics for the maximum degree in weighted recursive trees with bounded random weights