Random walks in distributed networks and their applications
This thesis studies random walks and its algorithmic applications in distributed networks. Random walk is a fundamental technique which has found numerous applications in computer science, mathematics, statistics, physics, and among others. The simulation of random walks in a network is an important...
Saved in:
Main Author: | Anisur Rahaman Molla |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/58914 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The ride sharing routing problem : an optimization algorithm
by: Lawrence, Lucas
Published: (2021) -
Toxicity prediction via algebraic graph-assisted bidirectional transformers
by: Ooi, Yen Sun
Published: (2023) -
Chromatic polynomials of signed graphs
by: Utomo, Charissa Irene
Published: (2023) -
Eigenvalues of the perfect matching derangement graph
by: Koh, Samuel Zhi Kang
Published: (2023) -
Graphs with three eigenvalues
by: Xiong, Zhiyuan
Published: (2019)