344 search results - page 19 / 69 » Random Walks on Colored Graphs |
CSDA
2010
13 years 7 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
EJC
2007
13 years 7 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
AIRWEB
2007
Springer
14 years 1 months ago
2007
Springer
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
IPL
1998
13 years 7 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...