Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
303,281
Random walks for image segmentation
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2006
"... Abstract—A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach on ..."
Abstract
-
Cited by 385 (21 self)
- Add to MetaCart
segmentation, graph theory, random walks, combinatorial Dirichlet problem, harmonic functions, Laplace equation, graph cuts, boundary completion. Ç 1
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 (1962--1985) and for all subperiod for a variety of aggrega ..."
Abstract
-
Cited by 492 (18 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 (1962--1985) 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 in random environment
- In Lectures on probability theory and statistics
, 2004
"... Random walks in random environments (RWRE’s) have been a source of surprising phenomena and challenging problems since they began to be studied in the 70’s. Hitting times and, more recently, certain regeneration structures, have played a major role in our understanding of RWRE’s. We review these and ..."
Abstract
-
Cited by 130 (11 self)
- Add to MetaCart
Random walks in random environments (RWRE’s) have been a source of surprising phenomena and challenging problems since they began to be studied in the 70’s. Hitting times and, more recently, certain regeneration structures, have played a major role in our understanding of RWRE’s. We review
Results 1 - 10
of
303,281
