Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs

• Fierro, Raúl ^[1] ; Figueroa, Gladys ^[1]
  1. [1] Pontificia Universidad Católica de Valparaíso

     Pontificia Universidad Católica de Valparaíso

     Valparaíso, Chile

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 12, Nº. 1, 1993, págs. 1-11
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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.