Computing inter-encounter time distributions for multiple random walkers on graphs

Quynh Nguyen, Bhaskar Krishnamachari. Computing inter-encounter time distributions for multiple random walkers on graphs. In 2017 Information Theory and Applications Workshop, ITA 2017, San Diego, CA, USA, February 12-17, 2017. pages 1-5, IEEE, 2017. [doi]

@inproceedings{NguyenK17-7,
  title = {Computing inter-encounter time distributions for multiple random walkers on graphs},
  author = {Quynh Nguyen and Bhaskar Krishnamachari},
  year = {2017},
  doi = {10.1109/ITA.2017.8023456},
  url = {https://doi.org/10.1109/ITA.2017.8023456},
  researchr = {https://researchr.org/publication/NguyenK17-7},
  cites = {0},
  citedby = {0},
  pages = {1-5},
  booktitle = {2017 Information Theory and Applications Workshop, ITA 2017, San Diego, CA, USA, February 12-17, 2017},
  publisher = {IEEE},
  isbn = {978-1-5090-5293-6},
}