Ergodic Capacity of Cognitive TAS/GSC Relaying in Nakagami-m Fading Channels

We examine the impact of transmit antenna selection with receive generalized selection combining (TAS/GSC) for cognitive decode-and-forward (DF) relaying in Nakagami-m fading channels. We select a single transmit antenna at the secondary transmitter which maximizes the receive signal-to-noise ratio (SNR) and combine a subset of receive antennas with the largest SNRs at the secondary receiver. In an effort to assess the performance, we first derive the probability density function and cumulative distribution function of the end-to-end SNR using the moment generating function. We then derive new exact closed-form expression for the ergodic capacity. More importantly, by deriving the asymptotic expression for the high SNR approximation of the ergodic capacity, we gather deep insights into the high SNR slope and the power offset. Our results show that the high SNR slope is 1/2 under the proportional interference power constraint. Under the fixed interference power constraint, the high SNR slope is zero.

Recurrence and higher ergodic properties for quenched random Lorentz tubes in dimension bigger than two

We consider the billiard dynamics in a non-compact set of ℝ d that is constructed as a bi-infinite chain of translated copies of the same d-dimensional polytope. A random configuration of semi-dispersing scatterers is placed in each copy. The ensemble of dynamical systems thus defined, one for each global realization of the scatterers, is called quenched random Lorentz tube. Under some fairly general conditions, we prove that every system in the ensemble is hyperbolic and almost every system is recurrent, ergodic, and enjoys some higher chaotic properties.

Ergodic properties of triangle partitions

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Ergodic crossover in partially self-avoiding stochastic walks

Consider a one-dimensional environment with N randomly distributed sites. An agent explores this random medium moving deterministically with a spatial memory μ. A crossover from local to global exploration occurs in one dimension at a well-defined memory value μ1=log2N. In its stochastic version, the dynamics is ruled by the memory and by temperature T, which affects the hopping displacement. This dynamics also shows a crossover in one dimension, obtained computationally, between exploration schemes, characterized yet by the trajectory size (Np) (aging effect). In this paper we provide an analytical approach considering the modified stochastic version where the parameter T plays the role of a maximum hopping distance. This modification allows us to obtain a general analytical expression for the crossover, as a function of the parameters μ, T, and Np. Differently from what has been proposed by previous studies, we find that the crossover occurs in any dimension d. These results have been validated by numerical experiments and may be of great value for fixing optimal parameters in search algorithms. © 2013 American Physical Society.

Bifurcation effects on the plasma edge of tokamaks with ergodic limiter.

In the present paper, we solve a twist symplectic map for the action of an ergodic magnetic limiter in a large aspect-ratio tokamak. In this model, we study the bifurcation scenarios that occur in the remnants regular islands that co-exist with chaotic magnetic surfaces. The onset of atypical local bifurcations created by secondary shearless tori are identified through numerical profiles of internal rotation number and we observe that their rupture can reduce the usual magnetic field line escape at the tokamak plasma edge.

On ergodic least-squares estimators of the generalized diffusion coefficient for fractional Brownian motion

We analyse a class of estimators of the generalized diffusion coefficient for fractional Brownian motion Bt of known Hurst index H, based on weighted functionals of the single time square displacement. We show that for a certain choice of the weight function these functionals possess an ergodic property and thus provide the true, ensemble-averaged, generalized diffusion coefficient to any necessary precision from a single trajectory data, but at expense of a progressively higher experimental resolution. Convergence is fastest around H ? 0.30, a value in the subdiffusive regime.

Ergodic theorems along sequences and Hardy fields.

Let a(x) be a real function with a regular growth as x --> infinity. [The precise technical assumption is that a(x) belongs to a Hardy field.] We establish sufficient growth conditions on a(x) so that the sequence ([a(n)])(infinity)(n=1) is a good averaging sequence in L2 for the pointwise ergodic theorem. A sequence (an) of positive integers is a good averaging sequence in L2 for the pointwise ergodic theorem if in any dynamical system (Omega, Sigma, m, T) for f [symbol, see text] in L2(Omega) the averages [equation, see text] converge for almost every omicron in. Our result implies that sequences like ([ndelta]), where delta > 1 and not an integer, ([n log n]), and ([n2/log n]) are good averaging sequences for L2. In fact, all the sequences we examine will turn out to be good averaging for Lp, p > 1; and even for L log L. We will also establish necessary and sufficient growth conditions on a(x) so that the sequence ([a(n)]) is good averaging for mean convergence. Note that for some a(x) (e.g., a(x) = log2 x), ([a(n)]) may be good for mean convergence without being good for pointwise convergence.

ERGODIC : computing with a combination of stochastic and bundle processing /

"UIUCDCS-R-74-630"

Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies

ACM Computing Classification System (1998): E.4, C.2.1.

An effective approach to verbose queries using a limited dependencies language model

Intuitively, any `bag of words' approach in IR should benefit from taking term dependencies into account. Unfortunately, for years the results of exploiting such dependencies have been mixed or inconclusive. To improve the situation, this paper shows how the natural language properties of the target documents can be used to transform and enrich the term dependencies to more useful statistics. This is done in three steps. The term co-occurrence statistics of queries and documents are each represented by a Markov chain. The paper proves that such a chain is ergodic, and therefore its asymptotic behavior is unique, stationary, and independent of the initial state. Next, the stationary distribution is taken to model queries and documents, rather than their initial distri- butions. Finally, ranking is achieved following the customary language modeling paradigm. The main contribution of this paper is to argue why the asymptotic behavior of the document model is a better representation then just the document's initial distribution. A secondary contribution is to investigate the practical application of this representation in case the queries become increasingly verbose. In the experiments (based on Lemur's search engine substrate) the default query model was replaced by the stable distribution of the query. Just modeling the query this way already resulted in significant improvements over a standard language model baseline. The results were on a par or better than more sophisticated algorithms that use fine-tuned parameters or extensive training. Moreover, the more verbose the query, the more effective the approach seems to become.