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

dc.creator	Fierro, Raúl
dc.creator	Figueroa, Gladys
dc.date	2018-04-03
dc.date.accessioned	2019-11-14T12:00:38Z
dc.date.available	2019-11-14T12:00:38Z
dc.identifier	https://www.revistaproyecciones.cl/article/view/2615
dc.identifier	10.22199/S07160917.1993.0001.00001
dc.identifier.uri	https://revistaschilenas.uchile.cl/handle/2250/113497
dc.description	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.	en-US
dc.format	application/pdf
dc.language	eng
dc.publisher	Universidad Católica del Norte.	es-ES
dc.relation	https://www.revistaproyecciones.cl/article/view/2615/2213
dc.rights	Derechos de autor 1993 Proyecciones. Journal of Mathematics	es-ES
dc.rights	https://creativecommons.org/licenses/by-nc/4.0/	es-ES
dc.source	Proyecciones. Journal of Mathematics; Vol 12 No 1 (1993); 1-11	en-US
dc.source	Proyecciones. Revista de Matemática; Vol. 12 Núm. 1 (1993); 1-11	es-ES
dc.source	0717-6279
dc.source	0716-0917
dc.subject	Functional central limit theorem	en-US
dc.subject	random graphs	en-US
dc.subject	differential equations	en-US
dc.title	Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs	en-US
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	Artículo revisado por pares	es-ES