3 years ago

Algorithmic aspects of graph-indexed random walks.

Jan Bok

We study three problems regarding the so called graph-indexed random walks (or equivalently Lipschitz mappings of graphs). Computing the average range of graph-indexed random walk of a graph. Computing the maximum range of graph-indexed random walk for a given graph. Deciding if we can extend partial GI random walk into full GI random walk for a given graph. We show that while the first problem is $\#$P-complete, the other two problems can be solved in polynomial time.

Publisher URL: http://arxiv.org/abs/1801.05496

DOI: arXiv:1801.05496v1

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.