Related papers: Lace Expansion and Mean-Field Behavior for the Ran…
We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We consider self-avoiding walk, percolation and the Ising model with long and finite range. By means of the lace expansion we prove mean-field behavior for these models if $d>2(\alpha\wedge2)$ for self-avoiding walk and the Ising model, and…
We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $\lambda>0$. Upon variation of $\lambda$ there is a…
We prove that nearest-neighbor percolation in dimensions $d\geq 11$ displays mean-field behavior by proving that the infrared bound holds, in turn implying the finiteness of the percolation triangle diagram. The finiteness of the triangle…
We investigate expansions for connectedness functions in the random connection model of continuum percolation in powers of the intensity. Precisely, we study the pair-connectedness and the direct-connectedness functions, related to each…
We consider a random connection model (RCM) $\xi$ driven by a Poisson process $\eta$. We derive exponential moment bounds for an arbitrary cluster, provided that the intensity $t$ of $\eta$ is below a certain critical intensity $t_T$. The…
We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…
The lace expansion has been a powerful tool for investigating mean-field behavior for various stochastic-geometrical models, such as self-avoiding walk and percolation, above their respective upper-critical dimension. In this paper, we…
The lace expansion is a powerful tool for analysing the critical behaviour of self-avoiding walks and percolation. It gives rise to a recursion relation which we abstract and study using an adaptation of the inductive method introduced by…
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
Given $d \in {\bf N}, \lambda >0$, the random connection model in a region $A \subseteq {\bf R}^d$ is a graph with vertex set given by a homogeneous Poisson point process of intensity $\lambda $ in $A$, with an edge placed between each pair…
We derive a continuous-time lace expansion for a broad class of self-interacting continuous-time random walks. Our expansion applies when the self-interaction is a sufficiently nice function of the local time of a continuous-time random…
Network dynamics with point-process-based interactions are of paramount modeling interest. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…