Descripción completa.

The purpose of this note is to give a support theorem in the Skorohod space for a one-dimensional Marcus differential equation driven by a Lévy process, without any assumption on the latter. We also give a criterion ensuring that the…

Consider a martingale $M$ with bounded jumps and two sequences $a_n, b_n \to \infty$. We show that if the rescaled martingales $$ M^n_t =\frac{1}{\sqrt{a_n}}M_{b_n t}$$ converge weakly, then the limit is necessarily a continous Ocone martingale. Necessary and sufficient conditions…

We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction are on the order of $n^{3/4}$. This behavior…

Sufficient conditions are given for the strict convexity of the limit shape in standard first-passage percolation. These conditions involve (1) asymptotic ``straightness'' of the geodesics, and (2) existence of mean-zero limit distributions for the first-passage times.

We define the first passage bridge from 0 to $\lambda$ as the Brownian motion on the time interval $[0,1]$ conditioned to first hit $\lambda$ at time 1. We show that this process may be related to the Brownian bridge, the…

We disprove a conjecture of Russ Lyons---that for every locally finite, connected graph $G$, the critical probability for (Bernoulli bond) percolation on $G$ is equal to the "first moment method" lower bound on this probability---and propose a possible alternative.

In this note we prove strong invariance principles between ranked excursion lengths and heights of a simple random walk and those of a standard Brownian motion. Some consequences concerning limiting distributions and strong limit theorems will also be presented.

We give a sufficient criterion for the weak disorder regime of directed polymers in random environment, which extends a well-known second moment criterion. We use a stochastic representation of the size-biased law of the partition function.

We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from $Z^2$ by removing all horizontal edges off the $x$-axis, has…