Related papers: The Brownian Net with Killing
We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We consider branching particle processes on discrete structures like the hypercube in a random fitness landscape (i.e., random branching/killing rates). The main question is about the location where the main part of the population sits at a…
We study a family of memory-based persistent random walks and we prove weak convergences after space-time rescaling. The limit processes are not only Brownian motions with drift. We have obtained a continuous but non-Markov process $(Z_t)$…
The Drainage Network is a system of coalescing random walks, exhibiting long-range dependence before coalescence, introduced by Gangopadhyay, Roy, and Sarkar. Coletti, Fontes, and Dias proved its convergence to the Brownian Web under…
Motivated by a biased diffusion of molecular motors with the bias dependent on the state of the substrate, we investigate a random walk on a one-dimensional lattice that contains weak links (called "bridges'') which are affected by the…
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations…
The purpose of this note is to collect in one place a few results about simple random walk and Brownian motion which are often useful. These include standard results such as Beurling estimates, large deviation estimates, and a method for…
We study the current of particles that move independently in a common static random environment on the one-dimensional integer lattice. A two-level fluctuation picture appears. On the central limit scale the quenched mean of the current…
Considering a critical branching random walk on the real line. In a recent paper, Aidekon [3] developed a powerful method to obtain the convergence in law of its minimum after a log-factor normalization. By an adaptation of this method, we…
In this review paper, we first discuss some open problems related to two-dimensional self-avoiding paths and critical percolation. We then review some closely related results (joint work with Greg Lawler and Oded Schramm) on critical…
We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
Consider a d-dimensional Brownian motion in a random potential defined by attaching a nonnegative and polynomially decaying potential around Poisson points. We introduce a repulsive interaction between the Brownian path and the Poisson…
We study the bidimensional voter model on a square lattice with numerical simulations. We demonstrate that the evolution takes place in two distinct dynamic regimes; a first approach towards critical site percolation and a further approach…
When moist air meets a cold surface, it creates a breath figure characterized by numerous small droplets. The central question is how the vapor flux is distributed between the growth of previously condensed drops and the nucleation of new…
Motivated by [G. Cannizzaro, M. Hairer, Comm. Pure Applied Math., '22], we provide a construction of the Brownian Web (see [T\'oth B., Werner W., Probab. Theory Related Fields, '98] and [L. R. G. Fontes, M. Isopi, C. M. Newman, and K.…
Random fields are useful mathematical tools for representing natural phenomena with complex dependence structures in space and/or time. In particular, the Gaussian random field is commonly used due to its attractive properties and…
We study interacting systems of linear Brownian motions whose drift vector at every time point is determined by the relative ranks of the coordinate processes at that time. Our main objective has been to study the long range behavior of the…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…