Related papers: Persistence probabilities of autoregressive chains…

We study the recurrence/transience phase transition for Markov chains on $\mathbb{R}_+$, $\mathbb{R}$, and $\mathbb{R}^2$ whose increments have heavy tails with exponent in $(1,2)$ and asymptotically zero mean. This is the infinite-variance…

We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…

For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…

We consider the well-posedness of Bayesian inverse problems when the prior measure has exponential tails. In particular, we consider the class of convex (log-concave) probability measures which include the Gaussian and Besov measures as…

In [16], under mild conditions, a Wiener-Hopf type factorization is derived for the exponential functional of proper L\'evy processes. In this paper, we extend this factorization by relaxing a finite moment assumption as well as by…

We consider an obliquely reflected Brownian motion $Z$ with positive drift in a quadrant stopped at time $T$, where $T:=\inf \{ t>0 : Z(t)=(0,0) \}$ is the first hitting time of the origin. Such a process can be defined even in the…

Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

We study the persistence probabilities of a moving average process of order one with uniform innovations. We identify a number of regions, characterized by the location of the uniform distribution and the coupling parameter of the process,…

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

We consider a one-dimensional run-and-tumble particle, or persistent random walk, in the presence of an absorbing boundary located at the origin. After each tumbling event, which occurs at a constant rate $\gamma$, the (new) velocity of the…

Let $S=(S_n)$ be an oscillatory random walk on the integer lattice $\mathbb{Z}$ with i.i.d. increments. Let $V_{{\rm d}}(x)$ be the renewal function of the strictly descending ladder height process for $S$. We obtain several sufficient…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

We consider the problem of determining escape probabilities from an interval of a general compound renewal process with drift. This problem is reduced to the solution of a certain integral equation. In an actuarial situation where only…

We study the persistence probability for some discrete-time, time-reversible processes. In particular, we deduce the persistence exponent in a number of examples: first, we deal with random walks in random sceneries (RWRS) in any dimension…

We consider autoregressive sequences $X_n=aX_{n-1}+\xi_n$ and $M_n=\max\{aM_{n-1},\xi_n\}$ with a constant $a\in(0,1)$ and with positive, independent and identically distributed innovations $\{\xi_k\}$. It is known that if $\mathbf…

In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…

This manuscript provides optimization guarantees, generalization bounds, and statistical consistency results for AdaBoost variants which replace the exponential loss with the logistic and similar losses (specifically, twice differentiable…

The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…

Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…