I will define the unimodularity of random graphs and then I will give several examples of applications concerning tessellations, optimization, dynamic systems, etc. If time permits, I will also show how unimodularity allows to develop analysis tools for random graphs which in a sense generalize Palm calculus of point processes.