# How can a finite graph be viewed as a discrete analogue of a Riemann surface?

In the paper "Riemann–Roch and Abel–Jacobi theory on a finite graph" by Baker and Norine, the first line of the abstract states: "It is well known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface". Perhaps this is indeed well known, but not to me. Nor can I find any material online that explains this concept in detail. If someone could point me in the right direction it would be much appreciated. I am interested how an arbitrary finite graph can be viewed as a discrete Riemann surface, not a graph that simply results from a triangulation.

What they are saying is somewhat true: A connected graph can be regarded as a metric space (when equipped with the graph metric) and as such can be used for approximation of geometry of Riemann surfaces (say, hyperbolic ones) as well as higher dimensional Riemannian manifolds. When done properly, one can derive some conclusions about, say, spectral properties of manifolds from spectral properties of approximating graphs. Take a look for instance at this paper by Brooks and Makover for some constructions and references. One of the most famous interactions of graph theory and theory of algebraic curves (over $\bar Q$) is via Belyi's theorem and "dessins d'enfants".