output
20102026
most citedBayesian latent time joint mixed effect models for multicohort longitudinal data

81 citations

Showing cs.ITShow all

8 papers · 1 filter

cs.IT2020

Large Deviation Principle for Empirical SINR Measure of Critical Telecommunication Networks

Enoch Sakyi-Yeboah, Charles Kwofie, Kwabena Doku-Amponsah

For a \emph{ powered Poisson process}, we define \emph{Signal-to-Interference-plus-Noise Ratio}(SINR) and thesinr network as a Telecommunication Network. We define the Empirical Me…

cs.IT2019★ 2 cited

Local Large Deviation Principle, Large Deviation Principle and Information theory for the Signal -to- Interference -Plus- Noise Ratio Graph Models

E. Sakyi-Yeboah, L. Asiedu, Kwabena Doku-Amponsah

Given devices space , an intensity measure , a transition kernel from the space to positive real numbers a path-loss function (which depend…

cs.IT2017★ 2 cited

Local Large deviation: A McMillian Theorem for Coloured Random Graph Processes

Kwabena Doku-Amponsah

For a finite typed graph on nodes and with type law we define the so-called spectral potential of the graph.From the we obtain Kullb…

cs.IT2017★ 2 cited

Lossy Asymptotic Equipartition Property For Geometric Networked Data Structures

Kwabena Doku-Amponsah

This article extends the Generalized Asypmtotic Equipartition Property of Networked Data Structures to cover the Wireless Sensor Network modelled as coloured geometric random graph…

cs.IT2016★ 3 cited

Lossy Asymptotic Equipartition property for Networked Data Structures

K. Doku-Amponsah

In this article we prove a Generalized Asypmtotic Equipartition Property for Networked Data Structures modelled as coloured random graphs. The main techniques in this article remai…

cs.IT2015★ 2 cited

Large deviation, Basic Information Theory for Wireless Sensor Networks

Kwabena Doku-Amponsah

In this article, we prove Shannon-MacMillan-Breiman Theorem for Wireless Sensor Networks modelled as coloured geometric random graphs. For large we show that a Wireless Sensor…

cs.IT2013

Large deviations, Basic information theorem for fitness preferential attachment random networks

K. Doku-Amponsah, F. O. Mettle, T. Narh-Ansah

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…

cs.IT2010★ 11 cited

Asymptotic Equipartition Properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured…