Resumen de Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs
In this work we study a law of large numbers and a functional central limit theorem for the number os subgraphs of given size in a random graph which evolves with the lime. Our motivation comes from the study of reliability measures in communications networks.
