weights, hamming cubes and random walks



1 way to project walks on graphs onto 1-dimension, and still add up weights to 1,

we saw this general idea, when learning about coverings. Especially, when seeing how in zigzag expanders use the wreath product, in which the net effect requires one to squish the “direction-giving” graph.


About home_pw

Computer Programmer who often does network administration with focus on security servers. Sometimes plays at slot machine programming.
This entry was posted in crypto. Bookmark the permalink.