SearcharxivSearch

arXiv subjects

David Coupier

Publications and source records attributed to David Coupier.

At least 19 recordsLinked to original sources

The $K$-th nearest neighbor random walk on a Poisson point process gets trapped

The $K$-th nearest neighbor random walk $(X_n)_{n \geq 0}$ on a homogeneous Poisson point process $\chi$ on $\R^d$ ($d\geq 1$), starts at the origin and at each step picks its next Poisson point among its closest neighbors according to i.i.d. labels having the same distribution as $K$. Our main result (Theorem 1) states that the number of Poisson points visited by $(X_n)_{n \geq 0}$ admits an exponential decay whenever the random variable $K$ has a bounded support (BS). In particular, the $K$-th nearest neighbor random walk visits finitely many Poisson points if and only if $K$ satisfies Assumption (BS). To prove it, we introduce the key notion of pioneer point which allows us to deal with the region of $\R^d$ already explored by $(X_n)_{n \geq 0}$. Still under Assumption (BS), we also prove an exponential decay for the Euclidean length of the trajectory performed by $(X_n)_{n \geq 0}$ (Theorem 2). Finally, and quite surprisingly, we exhibit an example of label distribution with bounded support for which the $K$-th nearest neighbor random walk discovers new Poisson points after a number of steps whose tail distribution is at least polynomial (Theorem 3).

math.PR

Construction of ergodic IDLA forests in $\mathbb{Z}^d$

We prove the existence of infinite-volume IDLA forests in $\mathbb{Z}^d$ , with $d \geq 2$, based on a multi-source IDLA protocol. Unlike IDLA aggregates, the laws of the IDLA forests studied here depend on the trajectories of particles, and then do not satisfy the famous Abelian property. Their existence is due to a stabilization result (Theorem 1.1, our main result) that we establish using percolation tools. Although the sources are infinitely many, we also prove that each of them play the same role in the building procedure, which results in an ergodicity property for the IDLA forests (Theorem 1.2).

math.PR

The Planar Lattice Two-Neighbor Graph Percolates

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the 2-neighbor graph percolates on Z 2 , i.e., that the origin is connected to infinity with positive probability. The proof rests on duality, an exploration algorithm, a comparison to i.i.d. bond percolation under constraints as well as enhancement arguments. As a byproduct, we show that i.i.d. bond percolation with forbidden local patterns has a strictly larger percolation threshold than 1/2. Additionally, our main result provides further evidence that, in low dimensions, less variability is beneficial for percolation.

math.PR

Absence of percolation for infinite Poissonian systems of stopped paths

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops growing at time t \> 0 if it hits the trace of the other curves realized up until time t. Such dynamic is well-defined as long as the distribution of paths has a finite second moment at each time t \> 0. Letting the time runs until infinity so that each path reaches its stopping curve, we study the connected property of the graph formed by all stopped curves. Our main result states the absence of percolation in this graph, meaning that each cluster consists of a finite number of curves. The assumptions on the distribution of paths are very mild, with the main one being the so-called 'loop assumption' which ensures that finite clusters (necessarily containing a loop) occur with positive probability. The main issue in this model comes from the long-range dependence arising from long sequences of causalities in the hitting/stopping procedure. Most methods based on block approaches fail to effectively address the question of percolation in this setting.

math.PR

IDLA with sources in a hyperplane of $\mathbb{Z}^d$

We consider a random growth model based on the IDLA protocol with sources in a hyperplane of $Z^d$ . We provide a stabilization result and a shape theorem generalizing [7] in any dimension by introducing new techniques leading to a rough global upper bound.

math.PR

Line-of-sight Cox percolation on Poisson-Delaunay triangulation

In this work, percolation properties of device-to-device (D2D) networks in urban environments are investigated. The street system is modeled by a Poisson-Delaunay triangulation (PDT). Users are of two types: given either by a Cox process supported by the edges of the PDT or by a Bernoulli process on the vertices of the PDT (i.e. on streets and at crossroads). Percolation of the resulting connectivity graph G p,$\lambda$,r is interpreted as long-range connection in the D2D network. According to the parameters p, $\lambda$, r of the model, we state several percolation regimes in Theorem 1 (see also Fig. 3). This work completes and specifies results of Le Gall et al [23]. To do it, we take advantage of a percolation tool, inspired by enhancement techniques, used to our knowledge for the first time in the context of communication networks.

math.PR

Thick trace at infinity for the Hyperbolic Radial Spanning Tree

Since the works of Howard and Newman (2001), it is known that in straight radial rooted trees, with probability 1, infinite paths all have an asymptotic direction and each asymptotic direction is reached by (at least) an infinite path. Moreover, there exists a set of 'exceptionnal' directions reached by (at least) two infinite paths which is random, dense and only countable in dimension 2. Howard and Newman's method says nothing about (random) directions reached by more than two infinite paths and, in particular, if such 'very exceptionnal' directions exist in dimension 2. In this paper, we prove that the answer is no for the hyperbolic Radial Spanning Tree (RST): in dimension 2, this tree does not contain 3 infinite paths with the same (random) asymptotic direction with probability one. Turned in another way, this means that there is no infinite but thin subtree in the hyperbolic RST, i.e. whose infinite paths would all have the same asymptotic direction. We actually prove a stronger result in dimension $d+1$, $d\geq 1$, stating that any infinite subtree of the hyperbolic RST a.s. generates a thick trace at infinity, i.e. the set of asymptotic directions reached by its infinite paths has a positive measure.

math.PR

Existence and percolation results for stopped germ-grain models with unbounded velocities

We investigate the existence and first percolation properties of general stopped germ-grain models. They are defined via a random set of germs generated by a homogeneous planar Poisson point process in $\mathbf{R}^{2}$. From each germ, a grain, composed by a random number of branches, grows. This grain stops to grow whenever one of its branches hits another grain. The classical and historical example is the line segment model for which the grains are segments growing in a random direction in $ [0,2π)$ with random velocity. In the bilateral line segment model the segments grow in both directions. Other examples are considered here such as the Brownian model where the branches are simply given by independent Brownian motions in $\mathbf{R}^{2}$. The existence of such dynamics for an infinite number of germs is not obvious and our first result ensures it in a very general setting. In particular the existence of the line segment model is proved as soon as the random velocity admits a moment of order 4 which extends the result by Daley et al (Theorem 4.3 in \cite{daley2014two}) for bounded velocity. Our result covers also the Brownian dynamic model. In a second part of the paper, we show that the line segment model with random velocity admitting a super exponential moment does not percolate. This improves a recent result (Theorem 3.2 \cite{coupier2016absence}) in the case of bounded velocity.

math.PR

Hyperbolic Radial Spanning Tree

We define and analyze an extension to the $d$-dimensional hyperbolic space of the Radial Spanning Tree (RST) introduced by Baccelli and Bordenave in the two-dimensional Euclidean space (2007). In particular, we will focus on the description of the infinite branches of the tree. The properties of the two-dimensional Euclidean RST are extended to the hyperbolic case in every dimension: almost surely, every infinite branch admits an asymptotic direction and each asymptotic direction is reached by at least one infinite branch. Moreover, the branch converging to any deterministic asymptotic direction is unique almost surely. To obtain results for any dimension, a completely new approach is considered here. \tvc{Our strategy mainly involves the two following ingredients, that rely on the hyperbolic Directed Spanning Forest (DSF) introduced and studied in Flammant (2019).} First, the hyperbolic metric allows us to obtain fine control of the branches' fluctuations in the hyperbolic DSF without using planarity arguments. Then, we couple the hyperbolic RST with the hyperbolic DSF and conclude.

math.PR

The bi-dimensional Directed IDLA forest

We investigate three types of Internal Diffusion Limited Aggregation (IDLA) models. These models are based on simple random walks on $\mathbf{Z}^2$ with infinitely many sources that are the points of the vertical axis $I(\infty)=\{0\}\times\mathbf{Z}$. Various properties are provided, such as stationarity, mixing, stabilization and shape theorems. Our results allow us to define a new directed (w.r.t. the horizontal direction) random forest spanning $\mathbf{Z}^2$, based on an IDLA protocol, which is invariant in distribution w.r.t. vertical translations.

math.PR

The 2d-directed spanning forest converges to the Brownian web

The two-dimensional directed spanning forest (DSF) introduced by Baccelli and Bordenave is a planar directed forest whose vertex set is given by a homogeneous Poisson point process $\mathcal{N}$ on $\mathbb{R}^2$. If the DSF has direction $-e_y$, the ancestor $h(u)$ of a vertex $u \in \mathcal{N}$ is the nearest Poisson point (in the $L_2$ distance) having strictly larger $y$-coordinate. This construction induces complex geometrical dependencies. In this paper we show that the collection of DSF paths, properly scaled, converges in distribution to the Brownian web (BW). This verifies a conjecture made by Baccelli and Bordenave in 2007.

math.PR

Absence of percolation for Poisson outdegree-one graphs

A Poisson outdegree-one graph is an oriented graph based on a Poisson point process such that each vertex has only one outgoing edge. The paper focuses on the absence of percolation for such graphs. Our main result is based on two assumptions. The Shield assumption ensures that the graph is locally determined with possible random horizons. The Loop assumption ensures that any forward branch of the graph merges on a loop provided that the Poisson point process is augmented with a finite collection of well-chosen points. Several models satisfy these general assumptions and inherit in consequence the absence of percolation. In particular, we solve a conjecture by Daley et al. on the absence of percolation for the line-segment model. In this planar model, a segment is growing from any point of the Poisson process and stops its growth whenever it hits another segment. The random directions are picked independently and uniformly on the unit sphere. Another model of geometric navigation is presented and also fulfills the Shield and Loop assumptions.

math.PR

Collision times of random walks and applications to the Brownian web

Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part of which relies on a criterion proposed by Fontes, Isopi, Newman and Ravishankar (2004). One of their convergence condition, called (B2), states that the probability of the event that there exists three distinct paths for a time interval of length $t(>0)$, all starting within a segment of length $\varepsilon$, is of small order of $\varepsilon$. This condition is often verified by applying an FKG type correlation inequality together with a coalescing time tail estimate for two paths. For many models where paths have complex interactions, it is hard to establish FKG type inequalities. In this article, we show that for a non-crossing path model, with certain assumptions, a suitable upper bound on expected first collision time among three paths can be obtained directly using Lyapunov functions. This, in turn, provides an alternate verification of Condition (B2). We further show that in case of independent simple symmetric one dimensional random walks or in case of independent Brownian motions, the expected value can be computed explicitly. We apply this alternate method of verification of (B2) to several models in the basin of attraction of the Brownian web studied earlier in the literature ([S67], [H71], [FLT04]).

math.PR

Directed, cylindric and radial Brownian webs

The Brownian web (BW) is a collection of coalescing Brownian paths indexed by the plane. It appears in particular as continuous limit of various discrete models of directed forests of coalescing random walks and navigation schemes. Radial counterparts have been considered but global invariance principles are hard to establish. In this paper, we consider cylindrical forests which in some sense interpolate between the directed and radial forests: we keep the topology of the plane while still taking into account the angular component. We define in this way the cylindric Brownian web (CBW), which is locally similar to the planar BW but has several important macroscopic differences. For example, in the CBW, the coalescence time between two paths admits exponential moments and the CBW as its dual contain each a.s. a unique bi-infinite path. This pair of bi-infinite paths is distributed as a pair of reflected Brownian motions on the cylinder. Projecting the CBW on the radial plane, we obtain a radial Brownian web (RBW), i.e. a family of coalescing paths where under a natural parametrization, the angular coordinate of a trajectory is a Brownian motion. Recasting some of the discrete radial forests of the literature on the cylinder, we propose rescalings of these forests that converge to the CBW, and deduce the global convergence of the corresponding rescaled radial forests to the RBW. In particular, a modification of the radial model proposed in Coletti and Valencia is shown to converge to the CBW.

math.PR

Sublinearity of the number of semi-infinite branches for geometric random trees

The present paper addresses the following question: for a geometric random tree in $\R^{2}$, how many semi-infinite branches cross the circle $\CC_{r}$ centered at the origin and with a large radius $r$? We develop a method ensuring that the expectation of the number $χ_{r}$ of these semi-infinite branches is $o(r)$. The result follows from the fact that, far from the origin, the distribution of the tree is close to that of an appropriate directed forest which lacks bi-infinite paths. In order to illustrate its robustness, the method is applied to three different models: the Radial Poisson Tree (RPT), the Euclidean First-Passage Percolation (FPP) Tree and the Directed Last-Passage Percolation (LPP) Tree. Moreover, using a coalescence time estimate for the directed forest approximating the RPT, we show that for the RPT $χ_{r}$ is $o(r^{1-η})$, for any $0<η<1/4$, almost surely and in expectation.

math.PR

Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation

Let us consider Euclidean first-passage percolation on the Poisson-Delaunay triangulation. We prove almost sure coalescence of any two semi-infinite geodesics with the same asymptotic direction. The proof is based on an adapted Burton-Keane argument and makes use of the concentration property for shortest-path lengths in the considered graphs. Moreover, by considering the specific example of the relative neighborhood graph, we illustrate that our approach extends to further well-known graphs in computational geometry. As an application, we show that the expected number of semi-infinite geodesics starting at a given vertex and leaving a disk of a certain radius grows at most sublinearly in the radius.

math.PR

Continuum Percolation for Quermass Model

The continuum percolation for Markov (or Gibbs) germ-grain models is investigated. The grains are assumed circular with random radii on a compact support. The morphological interaction is the so-called Quermass interaction defined by a linear combination of the classical Minkowski functionals (area, perimeter and Euler-Poincaré characteristic). We show that the percolation occurs for any coefficient of this linear combination and for a large enough activity parameter. An application to the phase transition of the multi-type Quermass model is given.

math.PR

The 2d-Directed Spanning Forest is almost surely a tree

We consider the Directed Spanning Forest (DSF) constructed as follows: given a Poisson point process N on the plane, the ancestor of each point is the nearest vertex of N having a strictly larger abscissa. We prove that the DSF is actually a tree. Contrary to other directed forests of the literature, no Markovian process can be introduced to study the paths in our DSF. Our proof is based on a comparison argument between surface and perimeter from percolation theory. We then show that this result still holds when the points of N belonging to an auxiliary Boolean model are removed. Using these results, we prove that there is no bi-infinite paths in the DSF.

math.PR