Results 1  10
of
284,616
Random walks for image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2006
"... A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with userdefined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the ..."
Abstract

Cited by 378 (21 self)
 Add to MetaCart
A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with userdefined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one
Stock Market Prices Do Not Follow Random Walks: Evidence from a Simple Specification Test
 REVIEW OF FINANCIAL STUDIES
, 1988
"... In this article we test the random walk hypothesis for weekly stock market returns by comparing variance estimators derived from data sampled at different frequencies. The random walk model is strongly rejected for the entire sample period (19621985) and for all subperiod for a variety of aggrega ..."
Abstract

Cited by 495 (14 self)
 Add to MetaCart
In this article we test the random walk hypothesis for weekly stock market returns by comparing variance estimators derived from data sampled at different frequencies. The random walk model is strongly rejected for the entire sample period (19621985) and for all subperiod for a variety
Random walk on the range of random walk
, 2009
"... We study the random walk X on the range of a simple random walk on Z d in dimensions d ≥ 4. When d ≥ 5 we establish quenched and annealed scaling limits for the process X, which show that the intersections of the original simple random walk path are essentially unimportant. For d = 4 our results are ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We study the random walk X on the range of a simple random walk on Z d in dimensions d ≥ 4. When d ≥ 5 we establish quenched and annealed scaling limits for the process X, which show that the intersections of the original simple random walk path are essentially unimportant. For d = 4 our results
Random Walk
"... Abstract—A method is proposed to compute the continuum of paths, from shortest paths to all random paths between all pairs of nodes at once in a unified way. The analysis is based on treating the network as a random walk with an additional absorbing state named evaporating state reachable with nonze ..."
Abstract
 Add to MetaCart
Abstract—A method is proposed to compute the continuum of paths, from shortest paths to all random paths between all pairs of nodes at once in a unified way. The analysis is based on treating the network as a random walk with an additional absorbing state named evaporating state reachable
Random Walks on ...
, 1988
"... For each positive integer n 3 let Zi be the direct product of n copies of Z i e Zz = { a a aJ ai = or for all i = n} and let {W} o be a random walk on ZZ such that P { Wá A} = n for all A's in Zz and P { W _ n _ a a an " WJ at a a n} P{Wn J +t = a a3 a n Wl a a a n} =z for all j = I and ..."
Abstract
 Add to MetaCart
For each positive integer n 3 let Zi be the direct product of n copies of Z i e Zz = { a a aJ ai = or for all i = n} and let {W} o be a random walk on ZZ such that P { Wá A} = n for all A's in Zz and P { W _ n _ a a an " WJ at a a n} P{Wn J +t = a a3 a n Wl a a a n} =z for all j = I
Results 1  10
of
284,616