Search results for " Random walk"
showing 10 items of 29 documents
Coalescing directed random walks on the backbone of a 1 +1-dimensional oriented percolation cluster converge to the Brownian web
2018
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary discrete-time contact process. Such ancestral lineages were investigated in [BCDG13] where a central limit theorem for a single walker was proved. Here, we consider infinitely many coalescing walkers on the same backbone starting at each space-time point. We show that, after diffusive rescaling, the collection of paths converges in distribution to the Brownian web. Hence, we prove convergence to the Brownian web for a particular system of coalescing random…
A fully automatic approach for multimodal PET and MR image segmentation in gamma knife treatment planning
2017
The aim of this study is to combine Biological Target Volume (BTV) segmentation and Gross Target Volume (GTV) segmentation in stereotactic neurosurgery.Our goal is to enhance Clinical Target Volume (CTV) definition, including metabolic and morphologic information, for treatment planning and patient follow-up.We propose a fully automatic approach for multimodal PET and MR image segmentation. This method is based on the Random Walker (RW) and Fuzzy C-Means clustering (FCM) algorithms. A total of 19 brain metastatic tumors, undergone stereotactic neuro-radiosurgery, were retrospectively analyzed. A framework for the evaluation of multimodal PET/MRI segmentation is presented, considering volume…
An enhanced random walk algorithm for delineation of head and neck cancers in PET studies
2017
An algorithm for delineating complex head and neck cancers in positron emission tomography (PET) images is presented in this article. An enhanced random walk (RW) algorithm with automatic seed detection is proposed and used to make the segmentation process feasible in the event of inhomogeneous lesions with bifurcations. In addition, an adaptive probability threshold and a k-means based clustering technique have been integrated in the proposed enhanced RW algorithm. The new threshold is capable of following the intensity changes between adjacent slices along the whole cancer volume, leading to an operator-independent algorithm. Validation experiments were first conducted on phantom studies:…
One-dimensional random walks with self-blocking immigration
2017
We consider a system of independent one-dimensional random walkers where new particles are added at the origin at fixed rate whenever there is no older particle present at the origin. A Poisson ansatz leads to a semi-linear lattice heat equation and predicts that starting from the empty configuration the total number of particles grows as $c \sqrt{t} \log t$. We confirm this prediction and also describe the asymptotic macroscopic profile of the particle configuration.
Random walks in dynamic random environments and ancestry under local population regulation
2015
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in space-time regions where the medium is typical, we obtain a law of large numbers and an averaged central limit theorem for the walk via a regeneration construction under suitable coarse-graining. Such random walks occur naturally as spatial embeddings of ancestral lineages in spatial population models with local regulation. We verify that our assumptions hold for logistic branching random walks when the population density is sufficiently high.
On fractional diffusion and continuous time random walks
2003
Abstract A continuous time random walk model is presented with long-tailed waiting time density that approaches a Gaussian distribution in the continuum limit. This example shows that continuous time random walks with long time tails and diffusion equations with a fractional time derivative are in general not asymptotically equivalent.
Time-dependent weak rate of convergence for functions of generalized bounded variation
2016
Let $W$ denote the Brownian motion. For any exponentially bounded Borel function $g$ the function $u$ defined by $u(t,x)= \mathbb{E}[g(x{+}\sigma W_{T-t})]$ is the stochastic solution of the backward heat equation with terminal condition $g$. Let $u^n(t,x)$ denote the corresponding approximation generated by a simple symmetric random walk with time steps $2T/n$ and space steps $\pm \sigma \sqrt{T/n}$ where $\sigma > 0$. For quite irregular terminal conditions $g$ (bounded variation on compact intervals, locally H\"older continuous) the rate of convergence of $u^n(t,x)$ to $u(t,x)$ is considered, and also the behavior of the error $u^n(t,x)-u(t,x)$ as $t$ tends to $T$
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
2018
Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
Donsker-Type Theorem for BSDEs: Rate of Convergence
2019
In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed