Fairest edge usage and minimum expected overlap for random spanning trees

Nathan Albin, Jason Clemens, Derek J. Hoare, Pietro Poggi-Corradini, Brandon Sit, Sarah Tymochko. Fairest edge usage and minimum expected overlap for random spanning trees. Discrete Mathematics, 344(5):112282, 2021. [doi]

@article{AlbinCHPST21,
  title = {Fairest edge usage and minimum expected overlap for random spanning trees},
  author = {Nathan Albin and Jason Clemens and Derek J. Hoare and Pietro Poggi-Corradini and Brandon Sit and Sarah Tymochko},
  year = {2021},
  doi = {10.1016/j.disc.2020.112282},
  url = {https://doi.org/10.1016/j.disc.2020.112282},
  researchr = {https://researchr.org/publication/AlbinCHPST21},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {344},
  number = {5},
  pages = {112282},
}