733 search results - page 9 / 147 » Recommending random walks |
96
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
CAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
CP
2000
Springer
15 years 2 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
67
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We consider the nearest-neighbor simple random walk on Zd, d 2, driven by a field of bounded random conductances xy [0, 1]. The conductance law is i.i.d. subject to the condition...
DRW
2003
14 years 11 months ago
2003
