860 search results - page 74 / 172 » Biased Random Walks |
100
click to vote
DMTCS
2008
15 years 24 days ago
2008
For Dyck paths (nonnegative symmetric) random walks, the location of the first maximum within the first sojourn is studied. Generating functions and explicit resp. asymptotic expre...
129
click to vote
PAMI
2007
15 years 6 days ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
126
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
110
Voted
ALT
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...