138 search results - page 8 / 28 » Graph Laplacians and their convergence on random neighborhoo... |
AUTOMATICA
2006
13 years 7 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
ML
2010
ACM
13 years 2 months ago
2010
ACM
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...