Large Deviations, Basic Information Theorem for Fitness Preferential Attachment Random Networks
- K. Doku-Amponsah
- F. Mettle
- T. Ansah-Narh
Abstract
For fitness preferential attachment random networks, we define the empirical degree and pair measure, which counts the number of vertices of a given degree and the number of edges with given fits, and the sample path empirical degree distribution. For the empirical degree and pair distribution for the fitness preferential attachment random networks, we find a large deviation upper bound. From this result we obtain a weak law of large numbers for the empirical degree and pair distribution, and the basic information theorem or an asymptotic equipartition property for fitness preferential attachment random networks.- Full Text:
PDF
- DOI:10.5539/ijsp.v3n2p101
Journal Metrics
- h-index (December 2021): 20
- i10-index (December 2021): 51
- h5-index (December 2021): N/A
- h5-median(December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- CNKI Scholar
- COPAC
- DTU Library
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Google Scholar
- Harvard Library
- Infotrieve
- JournalTOCs
- LOCKSS
- MIAR
- Mir@bel
- PKP Open Archives Harvester
- Publons
- ResearchGate
- SHERPA/RoMEO
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- UCR Library
- WorldCat
Contact
- Wendy SmithEditorial Assistant
- ijsp@ccsenet.org