Related papers: Lace Expansion and Mean-Field Behavior for the Ran…
We investigate oriented bond-site percolation on the planar lattice in which entire columns are stretched. Generalising recent results by Hil\'ario et al., we establish non-trivial percolation under a $(1+\varepsilon)$-th moment condition…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…
We provide non-asymptotic $L^1$ bounds to the normal for four well-known models in statistical physics and particle systems in $\mathbb{Z}^d$; the ferromagnetic nearest-neighbor Ising model, the supercritical bond percolation model, the…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…
Consider a time-varying collection of n points on the positive real axis, modeled as exponentials of n Brownian motions whose drift vector at every time point is determined by the relative ranks of the coordinate processes at that time. If…
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…
When conducting bonds are occupied randomly in a two-dimensional square lattice, the conductivity of the system increases continuously as the density of those conducting bonds exceeds the percolation threshold. Such a behavior is well known…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We study a random field obtained by counting the number of balls containing each point, when overlapping balls are thrown at random according to a Poisson random measure. We are particularly interested in the local asymptotical…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
We prove concentration inequalities and associated PAC bounds for continuous- and discrete-time additive functionals for possibly unbounded functions of multivariate, nonreversible diffusion processes. Our analysis relies on an approach via…
We study binary state dynamics on a network where each node acts in response to the average state of its neighborhood. Allowing varying amounts of stochasticity in both the network and node responses, we find different outcomes in random…
We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…
We give a new derivation of mean-field percolation critical behaviour from the triangle condition that is quantitatively much better than previous proofs when the triangle diagram $\nabla_{p_c}$ is large. In contrast to earlier methods, our…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…
We present a probabilistic model for learning from dynamic relational data, wherein the observed interactions among networked nodes are modeled via the Bernoulli Poisson link function, and the underlying network structure are characterized…