Wildberger gave a method to construct a finite hermitian discrete hypergroup from a random walk on a certain kind of finite graphs. In this article, we reveal that his method is applicable to a random walk on certain kinds of infinite graphs. Moreover, we make some observations of finite or infinite graphs on which a random walk produces a hermitian discrete hypergroup.