  In this paper, we study some functional inequalities (such as Poincar\'e
inequalities, logarithmic Sobolev inequalities, generalized Cheeger
isoperimetric inequalities, transportation-information inequalities and
transportation-entropy inequalities) for reversible nearest-neighbor Markov
processes on a connected finite graph by means of (random) path method. We
provide estimates of the involved constants.
