Peter Mörters
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
Peter Mörters has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Peter Gracar
School of Mathematics, University of Leeds, Leeds LS2 9JT, U.K
6 shared publications Emmanuel Jacob
Unité de Mathématiques Pures et Appliquées, Ecole Normale Supérieure de Lyon, Lyon, France
5 shared publicationsSteffen Dereich
5 shared publications- Marcel Ortgiese
University of Bath
4 shared publications - Cécile Mailler
Department of Mathematical Sciences University of Bath Claverton Down BA2 7AY Bath UK
3 shared publications - Daniel Ueltschi
University of Warwick
3 shared publications
Latest Publications
- Open Access
- 4 March 2026
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 35 (3) , 414-432
The largest subcritical component in inhomogeneous random graphs of preferential attachment type
We identify the size of the largest connected component in a subcritical inhomogeneous random graph with a kernel of preferential attachment type. The component is polynomial in the graph size with an explicitly given exponent, which is strictly larger than the exponent for the largest degree in the graph. This is in stark contrast to the behaviour of inhomogeneous random graphs with a kernel of rank one. Our proof uses local approximation by branching random walks going well beyond the weak local limit and novel results on subcritical killed branching random walks.
- 4 March 2026
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 35 (3) , 414-432
Open AccessThe largest subcritical component in inhomogeneous random graphs of preferential attachment type
We identify the size of the largest connected component in a subcritical inhomogeneous random graph with a kernel of preferential attachment type. The component is polynomial in the graph size with an explicitly given exponent, which is strictly larger than the exponent for the largest degree in the graph. This is in stark contrast to the behaviour of inhomogeneous random graphs with a kernel of rank one. Our proof uses local approximation by branching random walks going well beyond the weak local limit and novel results on subcritical killed branching random walks.
- 1 February 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (1) , 494-546
Condensation in scale-free geometric graphs with excess edges
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with heavy-tailed radius distribution, and the age-dependent random connection model. In all these cases the mechanism behind the large deviation is based on a condensation effect. Loosely speaking, the mechanism randomly selects a finite number of vertices and increases their power, so that they connect to a macroscopic number of vertices in the graph, while the other vertices retain a degree close to their expectation and thus make no more than the expected contribution to the large deviation event. We verify this intuition by means of limit theorems for the empirical distributions of degrees and edge lengths under the conditioning. We observe that at large finite volumes, the edge-length distribution splits into a bulk and travelling wave part of asymptotically positive proportions.
- 1 February 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (1) , 494-546
Condensation in scale-free geometric graphs with excess edges
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with heavy-tailed radius distribution, and the age-dependent random connection model. In all these cases the mechanism behind the large deviation is based on a condensation effect. Loosely speaking, the mechanism randomly selects a finite number of vertices and increases their power, so that they connect to a macroscopic number of vertices in the graph, while the other vertices retain a degree close to their expectation and thus make no more than the expected contribution to the large deviation event. We verify this intuition by means of limit theorems for the empirical distributions of degrees and edge lengths under the conditioning. We observe that at large finite volumes, the edge-length distribution splits into a bulk and travelling wave part of asymptotically positive proportions.
- Open Access
- 25 October 2025
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 192 (11) , 1-50
Branching with selection and mutation II: Mutant fitness of Gumbel type
We study a model of a branching process subject to selection , modeled by giving each family an individual fitness acting as a branching rate, and mutation , modeled by resampling the fitness of a proportion of offspring in each generation. For two large classes of fitness distributions of Gumbel type we determine the growth of the population, almost surely on survival. We then study the empirical fitness distribution in a simplified model, which is numerically indistinguishable from the original model, and show the emergence of a Gaussian travelling wave.
- 25 October 2025
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 192 (11) , 1-50
Open AccessBranching with selection and mutation II: Mutant fitness of Gumbel type
We study a model of a branching process subject to selection , modeled by giving each family an individual fitness acting as a branching rate, and mutation , modeled by resampling the fitness of a proportion of offspring in each generation. For two large classes of fitness distributions of Gumbel type we determine the growth of the population, almost surely on survival. We then study the empirical fitness distribution in a simplified model, which is numerically indistinguishable from the original model, and show the emergence of a Gaussian travelling wave.
- 1 August 2025
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 31 (3) , 2525-2543
The fewest-big-jumps principle and an application to random graphs
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving truncation at location n. Conditional on the sum being large at scale n, we show that a finite number of summands take values near the truncation boundary, while the remaining variables still obey the law of large numbers. This generalises the well-known single-big-jump principle for random variables without truncation to a situation where just the minimal necessary number of jumps occur. As an application, we consider a random graph with vertex set given by the lattice points of a torus with sidelength 2N+1. Every vertex is the centre of a ball with random radius sampled from a heavy-tailed distribution. Oriented edges are drawn from the central vertex to all other vertices in this ball. When this graph is conditioned on having an exceptionally large number of edges we use our main result to show that, as N→∞, the excess outdegrees condense in a fixed, finite number of randomly scattered vertices of macroscopic outdegree. By contrast, no condensation occurs for the indegrees of the vertices, which all remain microscopic in size.
- 1 August 2025
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 31 (3) , 2525-2543
The fewest-big-jumps principle and an application to random graphs
We prove a large deviation principle for the sum of n independent heavy-tailed random variables, which are subject to a moving truncation at location n. Conditional on the sum being large at scale n, we show that a finite number of summands take values near the truncation boundary, while the remaining variables still obey the law of large numbers. This generalises the well-known single-big-jump principle for random variables without truncation to a situation where just the minimal necessary number of jumps occur. As an application, we consider a random graph with vertex set given by the lattice points of a torus with sidelength 2N+1. Every vertex is the centre of a ball with random radius sampled from a heavy-tailed distribution. Oriented edges are drawn from the central vertex to all other vertices in this ball. When this graph is conditioned on having an exceptionally large number of edges we use our main result to show that, as N→∞, the excess outdegrees condense in a fixed, finite number of randomly scattered vertices of macroscopic outdegree. By contrast, no condensation occurs for the indegrees of the vertices, which all remain microscopic in size.
- 22 May 2025
- Published by Springer Nature
- p. 45-64
The Size of the Giant in Inhomogeneous Random Graphs of Preferential Attachment Type
- 22 May 2025
- Published by Springer Nature
- p. 45-64
The Size of the Giant in Inhomogeneous Random Graphs of Preferential Attachment Type
- Open Access
The Contact Process on a Graph Adapting to the Infection
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the distribution of an Erdős-Rényi graph, but is made adaptive via updating in only the infected neighbourhoods, at constant rate. Under these graph dynamics, the presence of infection can help to prevent the spread and so many monotonicity-based techniques fail. Instead, we approximate the infection by an idealised model, the contact process on an evolving forest (CPEF). In this model updating events of a vertex in a tree correspond to the creation of a new tree with that vertex as the root. By seeing the newly created trees as offspring, the CPEF generates a Galton-Watson tree and we use that it survives if and only if its offspring number exceeds one. It turns out that the phase transition in the adaptive model occurs at a different infection rate when compared to the non-adaptive model.
Open AccessThe Contact Process on a Graph Adapting to the Infection
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the distribution of an Erdős-Rényi graph, but is made adaptive via updating in only the infected neighbourhoods, at constant rate. Under these graph dynamics, the presence of infection can help to prevent the spread and so many monotonicity-based techniques fail. Instead, we approximate the infection by an idealised model, the contact process on an evolving forest (CPEF). In this model updating events of a vertex in a tree correspond to the creation of a new tree with that vertex as the root. By seeing the newly created trees as offspring, the CPEF generates a Galton-Watson tree and we use that it survives if and only if its offspring number exceeds one. It turns out that the phase transition in the adaptive model occurs at a different infection rate when compared to the non-adaptive model.
- Open Access
- 28 June 2023
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 190 (7) , 1-28
Branching with Selection and Mutation I: Mutant Fitness of Fréchet Type
We investigate two stochastic models of a growing population with discrete and non-overlapping generations, subject to selection and mutation. In our models each individual carries a fitness which determines its mean offspring number. Many of these offspring inherit their parent’s fitness, but some are mutants and obtain a fitness randomly sampled, as in Kingman’s house-of-cards model, from a distribution in the domain of attraction of the Fréchet distribution. We give a rigorous proof for the precise rate of superexponential growth of these stochastic processes and support the argument by a heuristic and numerical study of the mechanism underlying this growth. This study yields in particular that the empirical fitness distribution of one model in the long time limit displays periodic behaviour.
- 28 June 2023
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 190 (7) , 1-28
Open AccessBranching with Selection and Mutation I: Mutant Fitness of Fréchet Type
We investigate two stochastic models of a growing population with discrete and non-overlapping generations, subject to selection and mutation. In our models each individual carries a fitness which determines its mean offspring number. Many of these offspring inherit their parent’s fitness, but some are mutants and obtain a fitness randomly sampled, as in Kingman’s house-of-cards model, from a distribution in the domain of attraction of the Fréchet distribution. We give a rigorous proof for the precise rate of superexponential growth of these stochastic processes and support the argument by a heuristic and numerical study of the mechanism underlying this growth. This study yields in particular that the empirical fitness distribution of one model in the long time limit displays periodic behaviour.
- Open Access
Branching with selection and mutation I: Mutant fitness of Fréchet type
We investigate two stochastic models of a growing population subject to selection and mutation. In our models each individual carries a fitness which determines its mean offspring number. Many of these offspring inherit their parent's fitness, but some are mutants and obtain a fitness randomly sampled from a distribution in the domain of attraction of the Fr\'echet distribution. We give a rigorous proof for the precise rate of superexponential growth of these stochastic processes and support the argument by a heuristic and numerical study of the mechanism underlying this growth.
Open AccessBranching with selection and mutation I: Mutant fitness of Fréchet type
We investigate two stochastic models of a growing population subject to selection and mutation. In our models each individual carries a fitness which determines its mean offspring number. Many of these offspring inherit their parent's fitness, but some are mutants and obtain a fitness randomly sampled from a distribution in the domain of attraction of the Fr\'echet distribution. We give a rigorous proof for the precise rate of superexponential growth of these stochastic processes and support the argument by a heuristic and numerical study of the mechanism underlying this growth.
- Open Access
- 25 July 2022
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 395 (2) , 859-906
Chemical Distance in Geometric Random Graphs with Long Edges and Scale-Free Degree Distribution
We study geometric random graphs defined on the points of a Poisson process ind-dimensional space, which additionally carry independent random marks. Edges are established at random using the marks of the endpoints and the distance between points in a flexible way. Our framework includes the soft Boolean model (where marks play the role of radii of balls centered in the vertices), a version of spatial preferential attachment (where marks play the role of birth times), and a whole range of other graph models with scale-free degree distributions and edges spanning large distances. In this versatile framework we give sharp criteria for absence of ultrasmallness of the graphs and in the ultrasmall regime establish a limit theorem for the chemical distance of two points. Other than in the mean-field scale-free network models the boundary of the ultrasmall regime depends not only on the power-law exponent of the degree distribution but also on the spatial embedding of the graph, quantified by the rate of decay of the probability of an edge connecting typical points in terms of their spatial distance.
- 25 July 2022
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 395 (2) , 859-906
Open AccessChemical Distance in Geometric Random Graphs with Long Edges and Scale-Free Degree Distribution
We study geometric random graphs defined on the points of a Poisson process ind-dimensional space, which additionally carry independent random marks. Edges are established at random using the marks of the endpoints and the distance between points in a flexible way. Our framework includes the soft Boolean model (where marks play the role of radii of balls centered in the vertices), a version of spatial preferential attachment (where marks play the role of birth times), and a whole range of other graph models with scale-free degree distributions and edges spanning large distances. In this versatile framework we give sharp criteria for absence of ultrasmallness of the graphs and in the ultrasmall regime establish a limit theorem for the chemical distance of two points. Other than in the mean-field scale-free network models the boundary of the ultrasmall regime depends not only on the power-law exponent of the degree distribution but also on the spatial embedding of the graph, quantified by the rate of decay of the probability of an edge connecting typical points in terms of their spatial distance.
- Open Access
Chemical distance in geometric random graphs with long edges and scale-free degree distribution
We study geometric random graphs defined on the points of a Poisson process in $d$-dimensional space, which additionally carry independent random marks. Edges are established at random using the marks of the endpoints and the distance between points in a flexible way. Our framework includes the soft Boolean model (where marks play the role of radii of balls centred in the vertices), a version of spatial preferential attachment (where marks play the role of birth times), and a whole range of other graph models with scale-free degree distributions and edges spanning large distances. In this versatile framework we give sharp criteria for absence of ultrasmallness of the graphs and in the ultrasmall regime establish a limit theorem for the chemical distance of two points. Other than in the mean-field scale-free network models the boundary of the ultrasmall regime depends not only on the power-law exponent of the degree distribution but also on the spatial embedding of the graph, quantified by the rate of decay of the probability of an edge connecting typical points in terms of their spatial distance.
Open AccessChemical distance in geometric random graphs with long edges and scale-free degree distribution
We study geometric random graphs defined on the points of a Poisson process in $d$-dimensional space, which additionally carry independent random marks. Edges are established at random using the marks of the endpoints and the distance between points in a flexible way. Our framework includes the soft Boolean model (where marks play the role of radii of balls centred in the vertices), a version of spatial preferential attachment (where marks play the role of birth times), and a whole range of other graph models with scale-free degree distributions and edges spanning large distances. In this versatile framework we give sharp criteria for absence of ultrasmallness of the graphs and in the ultrasmall regime establish a limit theorem for the chemical distance of two points. Other than in the mean-field scale-free network models the boundary of the ultrasmall regime depends not only on the power-law exponent of the degree distribution but also on the spatial embedding of the graph, quantified by the rate of decay of the probability of an edge connecting typical points in terms of their spatial distance.