81 search results - page 4 / 17 » Estimating and Sampling Graphs with Multidimensional Random ... |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
SDM
2012
SIAM
12 years 5 days ago
2012
SIAM
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
CPC
2006
13 years 9 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...