Journal
RANDOM STRUCTURES & ALGORITHMS
Volume 49, Issue 2, Pages 379-405Publisher
WILEY
DOI: 10.1002/rsa.20645
Keywords
spectral theory; random walks; simplicial complexes
Funding
- NIH (System Biology) [5P50-GM081883]
- AFOSR [FA9550-10-1-0436]
- NSF [CCF-1049290, DMS-1045153, DMS-12-09155]
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [1418261] Funding Source: National Science Foundation
Ask authors/readers for more resources
In this paper, we introduce a class of random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension d, a random walk with an absorbing state is defined which relates to the spectrum of the k-dimensional Laplacian for 1kd. We study an example of random walks on simplicial complexes in the context of a semi-supervised learning problem. Specifically, we consider a label propagation algorithm on oriented edges, which applies to a generalization of the partially labelled classification problem on graphs. (c) 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 379-405, 2016
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available