SearcharxivSearch

arXiv subjects

Benedikt Jahnel

Publications and source records attributed to Benedikt Jahnel.

At least 19 recordsLinked to original sources

Comparison inequalities for discrete- and continuous-time infection processes

We study comparison inequalities for contact-process-type infection dynamics on $\mathbb Z^d$ with general local transmission mechanisms. The processes considered include both discrete-time oriented-percolation models and continuous-time contact processes in which infection events may transmit to random, possibly correlated sets of neighbouring sites. Our main results apply local-to-global comparison criteria beyond stochastic domination: if one local infection rule is more likely than another to hit every non-empty test set of neighbours, then the corresponding process has larger survival probabilities at all times. We compare classical independent-infection models with exchangeable fixed-budget, all-or-nothing, and burst-type infection mechanisms, deriving orderings for example of finite-time and infinite-time survival probabilities and stopping-time distributions. In continuous time, we further obtain consequences for critical survival thresholds of exchangeable infection laws. The results show that infection processes with identical or comparable mean-field infection intensity can nevertheless be rigorously ordered at the stochastic level once spatial geometry is taken into account. Additionally, it turns out that the classical continuous-time contact process dominates a variety of related continuous-time models, whereas its most natural discrete-time version, Bernoulli oriented percolation, is not dominant with respect to related discrete-time models.

math.PR

Phase transitions for contact processes on sparse random graphs via metastability and local limits

We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density, which makes the study of the phase transition particularly amenable to local-convergence techniques. We use this approach to derive general conditions for the coincidence of the critical threshold with the survival/extinction threshold in the local limit. We further argue that the correct time scale to separate fast extinction from slow extinction in sparse graphs is, in general, the exponential scale, by showing that fast extinction may occur on stretched exponential time scales in sparse scale-free spatial networks. Together with {the results of} Nam, Nguyen and Sly (Trans.\ Am.\ Math.\ Soc.\ 375, 2022), our methods can be applied to deduce that the fast/slow threshold in sparse configuration models coincides with the survival/extinction threshold on the limiting Galton-Watson tree.

math.PR

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.

math.PR

Convex order and faster transmission in first contact percolation

Inspired by strict-monotonicity criteria for the time constant in first passage percolation, we investigate convex ordering of point processes in relation to the time constant in first contact percolation. In a nutshell, first contact percolation models the spread of an infection as a contact process without recovery based on a generalized graphical representation, where the usual homogeneous Poisson point processes on the edges are replaced by general simple point processes. Based on a notion of convex ordering for point processes, we prove monotonicity in the number and existence of infection paths. We argue that this convex ordering is however not enough to ensure strict monotonicities in the asymptotic speed of the infection. Instead, we propose a criterion based on an ordering of void probabilities and prove a speed-up for one-dimensional systems based on $\mathbb{Z}$-stationary point processes.

math.PR

Lattice random-field Widom--Rowlinson models

We consider the Widom--Rowlinson model on $\mathbb{Z}^d$ subject to a symmetric i.i.d.\ random field. We prove that for dimensions $d\le 2$ any non-trivial random field leads to an absence of a phase transition. In contrast, in dimensions $d\ge 3$ and for Gaussian random fields, phase-transition behavior of the model is maintained for sufficiently large densities of occupied sites. This extends the general picture known from the classical random-field Ising model to the random-field Widom--Rowlinson model. Following the general proof route of Aizenman--Wehr as well as Ding--Zhuang, our main contribution rests on adequate notions of contours and their associated generalized spin-flip operation to deal with hard-core repulsions.

math.PR

Locality properties for discrete and continuum Widom--Rowlinson models in random environments

We consider the Widom--Rowlinson model in which hard balls of two possible colors are constrained to a hard-core repulsion between particles of different colors, in quenched random environments. These random environments model spatially dependent preferences for the attachment of balls. We investigate the possibility to represent the joint process of environment and infinite-volume Widom--Rowlinson measure in terms of continuous (quasilocal) Papangelou intensities. We show that this is not always possible: In the case of the symmetric Widom-Rowlinson model on a non-percolating environment, we can explicitly construct a discontinuity coming from the environment. This is a new phenomenon for systems of continuous particles, but it can be understood as a continuous-space echo of a simpler non-locality phenomenon known to appear for the diluted Ising model (Griffiths singularity random field) on the lattice, as we explain in the course of the proof.

math.PR

Large and moderate deviations in Poisson navigations

We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a Poisson point is joined by an edge to its nearest Poisson point to the right within a cone. We establish precise exponential rates of decay for the probability that the vertical displacement of the random path is unexpectedly large. The proofs rest on controlling the dependencies of the individual steps and the randomness in the horizontal displacement as well as renewal-process arguments.

math.PR

Restriction and mixing properties of interacting particle systems with unbounded range

We consider interacting particle systems with unbounded interaction range on general countably infinite graphs $S$ and prove explicit non-asymptotic error bounds for approximations of the infinite-volume dynamics by systems of finitely many interacting particles. Moreover, we also provide non-asymptotic quantitative bounds on the spatial decay of correlations at times $t>0$ and then apply these results to show that interacting particle systems on $\mathbb{Z}$ whose interaction strengths decays exponentially fast cannot spontaneously break the time-translation symmetry, neither in the strong, nor in the weak sense.

math.PR

Local criteria for global connectivity comparisons: beyond stochastic domination

We introduce a site-wise domination criterion for local percolation models, which enables the comparison of one-arm probabilities even in the absence of stochastic domination. The method relies on a local-to-global principle: if, at each site, one model is more likely than the other to connect to a subset of its neighbors, for all nontrivial such subsets, then this advantage propagates to connectivity events at all scales. In this way, we obtain a robust alternative to stochastic domination, applicable in all cases where the latter works and in many where it does not. As a main application, we compare classical Bernoulli bond percolation with degree-constrained models, showing that degree constraints enhance percolation, and obtain asymptotically optimal bounds on critical parameters for degree-constrained models.

math.PR

Subcritical annulus crossing in spatial random graphs

We consider general continuum percolation models obeying sparseness, translation invariance, and spatial decorrelation. In particular, this includes models constructed on general point sets other than the standard Poisson point process or the Bernoulli-percolated lattice. Moreover, in our setting the existence of an edge may depend not only on the two end vertices but also on a surrounding vertex set and models are included that are not monotone in some of their parameters. We study the critical annulus-crossing intensity $\widehatλ_{c}$, which is smaller or equal to the classical critical percolation intensity $λ_{c}$ and derive a condition for $\widehatλ_{c}>0$ by relating the crossing of annuli to the occurrence of long edges. This condition is sharp for models that have a modicum of independence. In a nutshell, our result states that annuli are either not crossed for small intensities or crossed by a single edge. Our proof rests on a multiscale argument that further allows us to directly describe the decay of the annulus-crossing probability with the decay of long edges probabilities. We apply our result to a number of examples from the literature. Most importantly, we extensively discuss the weight-dependent random connection model in a generalised version, for which we derive sufficient conditions for the presence or absence of long edges that are typically easy to check. These conditions are built on a decay coefficient $ζ$ that has recently seen some attention due to its importance for various proofs of global graph properties.

math.PR

Detection, coverage and percolation in dynamic Boolean models with random radii based on $α$-stable processes

We consider a dynamic network in continuum time and space in which nodes, with initial locations given by a Poisson point process, move according to i.i.d. isotropic $α$-stable processes. Each node is additionally equipped with an i.i.d. detection radius. Inspired by corresponding results by Peres et. al. on mobile networks based on Brownian sausages with fixed width, we investigate the tail behaviour of three stopping times: The detection time of the first discovery of a designated node, the first coverage of an entire set, and the first discovery of a node by the infinite connected component of the system. Broadly speaking, we discover that the stability index as well as the random radii manifest themselves only in constants in the otherwise exponential decay rates. The proofs rest on heat-kernel bounds for the underlying Lévy processes and a detailed multiscale analysis allowing us to control the space-time correlations of the system.

math.PR

Reversible birth-and-death dynamics in continuum: a de Bruijn-type identity for free-energy dissipation

We investigate free-energy dissipation in a continuous-time birth-and-death dynamics in $\mathbb{R}^d$. For these Markov processes, the class of reversible measures coincides with the infinite-volume Gibbs point processes for some sufficiently nice Hamiltonian. For a wide class of initial distributions, we derive a de~Bruijn-type identity that relates the time evolution of the specific relative entropy along trajectories to the Fisher information, in particular establishing the thermodynamic limit of the latter. Along the way, we analyze some fine properties of the considered dynamics, such as the existence and regularity of local densities, obtain a spatial ergodic theorem for the entropy production per unit volume, and derive a small-time exponential series expansion of the dynamics.

math.PR

Coexistence for Competing Branching Random Walks with Identical Asymptotic Shape on $\mathbb{Z}^d$

We consider two independent branching random walks that start next to each other on the $d$-dimensional hypercubic lattice and that carry two different colors. Vertices of the lattice are colored according to the color of the walker cloud that first visits the vertex, leading to the question of possible coexistence in the sense that both colors appear on infinitely many vertices. Under mild conditions, we prove the coexistence for two independently distributed branching random walks obeying the same first- and second-order behavior for their extremal particles. To complement this result, we also exhibit examples for the almost-sure absence of coexistence, for $d=1$, in cases where the asymptotic shapes of the walker clouds are calibrated to coincide, thereby answering a question by Deijfen and Vilkas (ECP 28(15):1-11, 2023). As a main tool we employ second-order and large-deviation approximations for the position of the extremal particles in one-dimensional branching random walks.

math.PR

The variational principle for a marked Gibbs point process with infinite-range multibody interactions

We prove the Gibbs variational principle for the Asakura--Oosawa model in which particles of random size obey a hardcore constraint of non-overlap and are additionally subject to a temperature-dependent area interaction. The particle size is unbounded, leading to infinite-range interactions, and the potential cannot be written as a $k$-body interaction for fixed $k$. As a byproduct, we also prove the existence of infinite-volume Gibbs point processes satisfying the DLR equations. The essential control over the influence of boundary conditions can be established using the geometry of the model and the hard-core constraint.

math.PR

Dynamical Gibbs Variational Principles for Irreversible Interacting Particle Systems with Applications to Attractor Properties

We consider irreversible translation-invariant interacting particle systems on the $d$-dimensional cubic lattice with finite local state space, which admit at least one Gibbs measure as a time-stationary measure. Under some mild degeneracy conditions on the rates and the specification we prove, that zero relative entropy loss of a translation-invariant measure implies, that the measure is Gibbs w.r.t. the same specification as the time-stationary Gibbs measure. As an application, we obtain the attractor property for irreversible interacting particle systems, which says that any weak limit point of any trajectory of translation-invariant measures is a Gibbs measure w.r.t. the same specification as the time-stationary measure. This extends previously known results to fairly general irreversible interacting particle systems.

math.PR

Time-periodic behaviour in one- and two-dimensional interacting particle systems

We provide a class of examples of interacting particle systems on $\mathbb{Z}^d$, for $d\in\{1,2\}$, that admit a unique translation-invariant stationary measure, which is not the long-time limit of all translation-invariant starting measures, due to the existence of time-periodic orbits in the associated measure-valued dynamics. This is the first such example and shows that even in low dimensions, not every limit point of the measure-valued dynamics needs to be a time-stationary measure.

math.PR

Reversible birth-and-death dynamics in continuum: free-energy dissipation and attractor properties

We consider continuous-time birth-and-death dynamics in $\mathbb{R}^d$ that admit at least one infinite-volume Gibbs point process based on area interactions as a reversible measure. For a large class of starting measures, we show that the specific relative entropy decays along trajectories, and that all possible long-time weak limit points are also Gibbs point processes with respect to the same interaction. Our proof rests on a representation of the entropy dissipation in terms of the Palm version of the propagated measure.

math.PR

First contact percolation

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without recovery, an infection can spread into the system along increasing sequences of contact times. In case of stationary contact times, we can identify associated first passage percolation models, which in turn establish shape theorems also for first contact percolation. In case of periodic contact times that reflect some reoccurring daily pattern, we also present shape theorems with limiting shapes that are universal with respect to the within-one-day contact distribution. In this case, we also prove a Poisson approximation for increasing numbers of within-one-day contacts. Finally, we present a comparison of the limiting speeds of three models -- all calibrated to have one expected contact per day -- that suggests that less randomness is beneficial for the speed of the infection. The proofs rest on coupling and subergodicity arguments.

math.PR