Related papers: How fast planar maps get swallowed by a peeling pr…
We consider the phase transition in the system of n simultaneously developing random walks on the halfline x>=0. All walks are independent on each others in all points except the origin x=0, where the point well is located. The well depth…
Pilgrim's monopoly is a probabilistic process giving rise to a non-negative sequence $T_1, T_2,\ldots$ that is infinitely exchangeable, a natural model for time-to-event data. The one-dimensional marginal distributions are exponential. The…
We study the diagonal heat-kernel decay for the four-dimensional nearest-neighbor random walk (on $\Z^4$) among i.i.d. random conductances that are positive, bounded from above but can have arbitrarily heavy tails at zero. It has been known…
Consider a sequence (indexed by n) of Markov chains Z^n in R^d characterized by transition kernels that approximately (in n) depend only on the rescaled state n^{-1} Z^n. Subject to a smoothness condition, such a family can be closely…
We investigate the statistics of three kinds of records associated with planar random walks, namely diagonal, simultaneous and radial records. The mean numbers of these records grow as universal power laws of time, with respective exponents…
We study the complexity of sampling from a distribution over all index subsets of the set $\{1,...,n\}$ with the probability of a subset $S$ proportional to the determinant of the submatrix $\mathbf{L}_S$ of some $n\times n$ p.s.d. matrix…
Consider an advancing `front' $ R(t) \in \mathbb{Z}_{\geq 0} $ and particles performing independent continuous time random walks on $ (R(t),\infty)\cap\mathbb{Z} $. Starting at $R(0)=0$, whenever a particle attempts to jump into $R(t)$ the…
Consider shuffling a deck of $n$ cards, labeled $1$ through $n$, as follows: at each time step, pick one card uniformly with your right hand and another card, independently and uniformly with your left hand; then swap the cards. How long…
Path decomposition is performed to characterize the law of the pre/post-supremum, post-infimum and the intermediate processes of a spectrally negative Levy process taken up to an independent exponential time T: As a result, mainly the…
We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…
In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…
We derive scaling limits for integral functionals of It\^o processes with fast nonlinear mean-reversion speed. We show that in these limits, the fast mean-reverting process is "averaged out" by integrating against its invariant measure.…
Brownian motion is a Gaussian process described by the central limit theorem. However, exponential decays of the positional probability density function $P(X,t)$ of packets of spreading random walkers, were observed in numerous situations…
The number of triangulations of a planar n point set is known to be $c^n$, where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations of a planar n point set runs in $O^*(2^n)$ time. The fastest…
A central problem in data analysis is the low dimensional representation of high dimensional data, and the concise description of its underlying geometry and density. In the analysis of large scale simulations of complex dynamical systems,…
In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
We investigate certain properties of degenerate Feller processes that are killed when exiting a relatively compact set. Our main result provides general conditions ensuring that such a process possesses a (possibly non unique) quasi…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We consider a one-dimensional stationary time series of fixed duration $T$. We investigate the time $t_{\rm m}$ at which the process reaches the global maximum within the time interval $[0,T]$. By using a path-decomposition technique, we…
A simple model for the peeling process of pressure-sensitive adhesive tape is presented. The model consists of linear springs and dashpots and can be solved analytically. Based on the modeling, the curved profile of the peeling tape is…