Displaying 201 – 220 of 1497

Showing per page

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...

Asymptotic spectral analysis of generalized Erdős-Rényi random graphs

Song Liang, Nobuaki Obata, Shuji Takahashi (2007)

Banach Center Publications

Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.

Average convergence rate of the first return time

Geon Choe, Dong Kim (2000)

Colloquium Mathematicae

The convergence rate of the expectation of the logarithm of the first return time R n , after being properly normalized, is investigated for ergodic Markov chains. I. Kontoyiannis showed that for any β > 0 we have l o g [ R n ( x ) P n ( x ) ] = o ( n β ) a.s. for aperiodic cases and A. J. Wyner proved that for any ε >0 we have - ( 1 + ε ) l o g n l o g [ R n ( x ) P n ( x ) ] l o g l o g n eventually, a.s., where P n ( x ) is the probability of the initial n-block in x. In this paper we prove that E [ l o g R ( L , S ) - ( L - 1 ) h ] converges to a constant depending only on the process where R ( L , S ) is the modified first return time with...

Balanced Gray codes.

Bhat, Girish S., Savage, Carla D. (1996)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 201 – 220 of 1497