Computer Science – Information Theory
Scientific paper
2010-04-05
Computer Science
Information Theory
18 pages
Scientific paper
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and random matrix theory. We also show that these systems can be viewed as the limiting case of a properly defined sparse system. The latter result is useful when the sparse systems are easier to analyze than their dense counterparts. The list of problems we consider is by no means exhaustive. We believe that the ideas can be used in many other problems relevant for information theory.
Korada Satish Babu
Montanari Andrea
No associations
LandOfFree
Applications of Lindeberg Principle in Communications and Statistical Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Applications of Lindeberg Principle in Communications and Statistical Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of Lindeberg Principle in Communications and Statistical Learning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-636776