the class of random regular graphs has been the focus of extensive study highlighting its excellent expansion properties. for instance, it is well known that almost every regular graph of fixed degree is essentially ramanujan, and understanding this class of graphs sheds light on the general behavior of expanders. in this talk we will present several recent results on random regular graphs, focusing on the interplay between the spectrum, geometry and behavior of the simple random walk in these graphs. we will first discuss the relation between spectral properties and the abrupt convergence of the random walk to equilibrium, derived from precise asymptotics of the number of paths between vertices. following the study of the graph geometry we proceed to its random perturbation via exponential weights on the edges (first-passage-percolation). we then show how this allows the derivation of various key features of the classical erd\h{o}s-r\'enyi random graph near criticality, such as the asymptotics of the diameter of the largest component and the mixing time of the random walk on it. based on joint works with jian ding, jeong han kim, yuval peres and allan sly.