Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Keywords
Random Walk

RW,Random Walk,random walks,random walking,Randomized Walking,randomized walk,Randomized Walks

Random Walk - RW
Publications: 21,935| Citation Count: 137,528
Stemming Variations: random walks, random walking, Randomized Walking, randomized walk, Randomized Walks
Cumulative Annual
    • A random walk is defined as a tour of an agent located at a vertex which can move its adjacent vertices at random. The vertex visited next is selected from the adjacent vertices at random with the same probability in an usual random walk on finite graphs. Meanwhile there exist various works related to fast random walks in both of the hitting time and the cover time with the different probability...

    Masashi Shiozaki, et al. A New Idea of Fast Random Walks on Finite Graphs

    • Random walk is a means of network node sampling that requires little index maintenance and can function on almost all connected network topologies. With careful guidance, node samples following a desired probability distribution can be generated with the only requirement that the sampling probabilities of each visited node and its direct neighbors are known at each walk step...

    Ming Zhong, et al. Random walk based node sampling in self-organizing networks

    • Random walks is a typical search schema in unstructured peer-to-peer network. It generates partial coverage problem and makes some resources indiscoverable. An efficient search schema WCBF is presented. WCBF utilizes compressed Bloom filter for representing the path information to enlarge the coverage of random walks and alleviates the problem with a low overhead. Experimental results show the coverage of WCBF is almost 6 times that of random walks in a Gnutella-like overlay network...

    Qianbing Zheng, et al. WCBF: Efficient and High-Coverage Search Schema in Unstructured Peer-t...

Sort by:

Publications (21935)

Share this on