Results 1  10
of
118,637
Typicality Graphs: Large Deviation Analysis
, 2010
"... Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any ε> 0, the set of nlength sequences x n and y n that are jointly typical [1] according to PXY can be represented on a bipartite graph. We present a formal definition of such ..."
Abstract
 Add to MetaCart
Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any ε> 0, the set of nlength sequences x n and y n that are jointly typical [1] according to PXY can be represented on a bipartite graph. We present a formal definition of such a graph, known as a typicality graph, and study some of its properties.
NorthHolland Largedeviation analysis of multiplicity fluctuations
, 1991
"... In this paper we introduce and briefly discuss some of the basic results of largedeviation theory. We propose that largedeviation analysis be used as a tool complementary to the usual intermittency analysis because, as we show, systems exhibiting similar factorial moment behaviour may be quite dif ..."
Abstract
 Add to MetaCart
In this paper we introduce and briefly discuss some of the basic results of largedeviation theory. We propose that largedeviation analysis be used as a tool complementary to the usual intermittency analysis because, as we show, systems exhibiting similar factorial moment behaviour may be quite
A large deviations analysis of scheduling in wireless networks
 Earlier versions of the paper appeared in the IEEE CDC 2004, IEEE CDC 2005 and IEEE ISIT
, 2006
"... We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queuelengthbased policy and a greedy scheduling ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
We consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queuelengthbased policy and a greedy scheduling policy) given an upper bound on the queue overflow probability or the delay violation probability. We first consider a simple channel model, where each channel is assumed to be in one of two states (ON or OFF). Given an upper bound on the delay violation probability or an upper bound on the queue overflow probability, we show that the total network throughput of the queuelengthbased policy is strictly larger than the throughput of the greedy policy for all N. Further, the throughput of the queuelengthbased policy is a strictly increasing function of N while the throughput of the greedy policy does not have this property. Finally, for general channel state models, we show that the relative performances of the the greedy and QLB policies have a similar behavior. policy.
A Large Deviations Analysis of Range Tracking Loops
, 1992
"... Large deviations theory is applied to the analysis of a discrete time range tracking loop. It is shown that the resulting asymptotics differ from those of the continuous time diffusion limit. ..."
Abstract
 Add to MetaCart
Large deviations theory is applied to the analysis of a discrete time range tracking loop. It is shown that the resulting asymptotics differ from those of the continuous time diffusion limit.
Perturbative large deviation analysis of nonequilibrium dynamics
, 2014
"... Macroscopic fluctuation theory has shown that a wide class of nonequilibrium stochastic dynamical systems obey a large deviation principle, but except for a few onedimensional examples these large deviation principles are in general not known in closed form. We consider the problem of constructing ..."
Abstract
 Add to MetaCart
Macroscopic fluctuation theory has shown that a wide class of nonequilibrium stochastic dynamical systems obey a large deviation principle, but except for a few onedimensional examples these large deviation principles are in general not known in closed form. We consider the problem
Bit dropping in ATM: A large deviations analysis
"... this paper is to illustrate the ideas behind this technique and to demonstrate its applicability. For more details on the general theory, on applications to the performance of other models and further details on the model under investigation here the reader is referred to [SW]. A sample of recent re ..."
Abstract
 Add to MetaCart
references to other work using the increasingly popular toollarge deviationsis also available in [SW]
On Large Deviation Analysis of Sampling from Typical Sets
, 2007
"... Consider a pair of correlated sources (X, Y). With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work, we study ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Consider a pair of correlated sources (X, Y). With the collection of typical sequences of X and Y, one can associate a nearly semiregular bipartite graph. The typical sequences of X and Y form vertices, and two sequences are connected by an edge if they are jointly typical. In this work, we study the structural properties of these graphs. In particular, we study regularity and sparcity of this graph by considering the asymptotic properties of samples taken from this graph. These results find applications in certain frameworks for transmission of correlated sources over multiuser channels.
Results 1  10
of
118,637