相关论文: Marking (1,2) Points of the Brownian Web and Appli…
Consider a generic triangle in the upper half of the complex plane with one side on the real line. This paper presents a tailored construction of a discrete random walk whose continuum limit is a Brownian motion in the triangle, reflected…
The problem of detecting a few anomalous processes among a large number of data streams is considered. At each time, aggregated observations can be taken from a chosen subset of the processes, where the chosen subset conforms to a given…
We compute the limiting distribution of height of a random discrete excursion with step sets consisting of one positive step 1 and arbitrary finite set of non-positive integers. The limit law is the supremum of a Brownian excursion. This is…
We propose a new algorithm to generate a fractional Brownian motion, with a given Hurst parameter, 1/2<H<1 using the correlated Bernoulli random variables with parameter p; having a certain density. This density is constructed using the…
A one-dimensional system of nonintersecting Brownian particles is constructed as the diffusion scaling limit of Fisher's vicious random walk model. $N$ Brownian particles start from the origin at time $t=0$ and undergo mutually avoiding…
We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C2 locally. We further explain that random functions generated via DBM show an unstable growth as the traversed…
In this work, we advance the development of the Probability Bracket Notation (PBN), a formalism inspired by Dirac's notation in quantum mechanics, to provide a unified framework for probability modeling. We demonstrate that under a Special…
The path W[0,t] of a Brownian motion on a d-dimensional torus T^d run for time t is a random compact subset of T^d. We study the geometric properties of the complement T^d \ W[0,t] for t large and d >= 3. In particular, we show that the…
We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…
We establish the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point $n \vec{a}$ for $\vec{a}$ in $Z^d$, as $n$ increases to infinity.
We study systems of interacting Brownian particles in one dimension constructed as the diffusion scaling limits of Fisher's vicious walk models. We define two types of nonintersecting Brownian motions, in which we impose no condition (resp.…
We define a new state-space for the coalescing Brownian flow, also known as the Brownian web, on the circle. The elements of this space are families of order-preserving maps of the circle, depending continuously on two time parameters and…
This article extends the results of Fang & Zeitouni (2012a) on branching random walks (BRWs) with Gaussian increments in time inhomogeneous environments. We treat the case where the variance of the increments changes a finite number of…
We investigate the typical sizes and shapes of sets of points obtained by irregularly tracking two-dimensional Brownian bridges. The tracking process consists of observing the path location at the arrival times of a non-homogeneous Poisson…
We study the number of distinct sites S_N(t) and common sites W_N(t) visited by N independent one dimensional random walkers, all starting at the origin, after t time steps. We show that these two random variables can be mapped onto extreme…
We consider probabilistic models for sequential observations which exhibit gradual transitions among a finite number of states. We are particularly motivated by applications such as human activity analysis where observed accelerometer time…
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…
We study fixed-length bridge paths -- half-space excursions that start and end at a planar boundary -- for three-dimensional random walks with Henyey-Greenstein scattering angles and exponentially distributed step lengths, using Monte Carlo…
We first study a $d$-dimensional branching Brownian motion (BBM) among mild Poissonian obstacles, where a random trap field in $\mathbb{R}^d$ is created via a Poisson point process. The trap field consists of balls of fixed radius centered…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…