I saw a paper on ArXiV yesterday called Kalman meets Shannon, which got me thinking: in how many papers has someone met Shannon, anyway? Krish blogged about this a few years ago, but since then Shannon has managed to meet some more people. I plugged “meets Shannon” into Google Scholar, and out popped:
- Fourier: Wang and Giannakis, Wireless Multicarrier Communications: Where Fourier Meets Shannon, IEEE Signal Processing Magazine, 2000.
- Bode: Elia, When Bode meets Shannon: control-oriented feedback communication schemes, IEEE Transactions on Automatic Control, 2004.
- Maxwell: Chakraborty and Franceschetti, Maxwell meets Shannon: Space-time duality in multiple antenna channels, Allerton 2006, and Lee and Chung, Capacity scaling of wireless ad hoc networks: Shannon meets Maxwell, IEEE Transactions on Information Theory, 2012.
- Carnot: Shental and Kanter, Shannon Meets Carnot: Generalized Second Thermodynamic Law, Europhysics Letters, 2009.
- Nash: Berry and Tse, Shannon Meets Nash on the Interference Channel, IEEE Transactions on Information Theory, 2011.
- Walras: Jorswieck and Mochaourab, Shannon Meets Walras on Interference Networks, ITA Workshop 2013.
- Nyqust: Chen, Eldar, and Goldsmith,
Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels, IEEE Transactions on Information Theory, 2013. - Strang and Fix: Dragotti, Vetterli, and Blu, Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets Strang–Fix, IEEE Transactions on Signal Processing, 2007.
- Blackwell and LeCam: Raginsky, Shannon meets Blackwell and Le Cam: channels, codes, and statistical experiments, ISIT 2011.
- Wiener: Forney, On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener, Allerton 2003, and Forney, Shannon meets Wiener II: On MMSE estimation in successive decoding schemes, Allerton 2004 and ArXiv 2004.
- Bellman: Meyn and Mathew, Shannon meets Bellman: Feature based Markovian models for detection and optimization, CDC 2008.
- Tesla: Grover and Sahai, Shannon meets Tesla: Wireless information and power transfer, ISIT 2010.
- Shortz: Efron, Shannon Meets Shortz: A Probabilistic Model of Crossword Puzzle Difficulty, Journal of the American Society for Information Science and Technology, 2008.
- Marconi: Tse, Modern Wireless Communication: When Shannon Meets Marconi, ICASSP 2006.
- Kalman: Gattami, Kalman meets Shannon, ArXiV 2014.
Sometimes people are meeting Shannon, and sometimes he is meeting them, but each meeting produces at least one paper.
Advertisements
“Nyquist Meets Bode on the z-Plane” (http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5715188)
Triadic closure?
Someone should quickly define the Shannon number…
So many meetings! Why can’t I be at these meetings? I bet they’re fun!
I should look up my slides from an ITW talk I gave on “Meeting Shannon” (http://dx.doi.org/10.1109/ITW.2008.4578610) for you!
Santiago Ramon y Cajal is someone I’ve had him meet: https://calendar.csail.mit.edu/events/1248
It is interesting to compare to how many people Shannon actually collaborated with, and how a “Shannon Number” is usually just a “Gallager Number” + 1 or sometimes a “Berlekamp Number” +1
About Shannon numbers, I wrote a thing way back for the IT Society newsletter: http://www.itsoc.org/publications/newsletters/past-newsletters/2007-newsletters/itNL0307.pdf/at_download/file (PDF, starts on page 10)
One problem is that Shannon has an Erdos number of 3 … and Erdos’s connections swamp Shannon’s. For example, my own Erdos number is smaller than my Shannon number.
Shannon Number thing I had made for that talk: http://www.ifp.illinois.edu/~varshney/shannon.html
Actually I was thinking of Shannon number in terms of “A meets B” on paper titles.
For example –
Robinson Crusoe meets Walras and Keynes
D McFadden – Mimeographed, University of California at Berkeley, 1975
Competitive equilibrium: Walras meets Darwin
S Didrik Flåm, B Sandvik – Optimization, 2000 – Taylor & Francis
Thereby giving Darwin, Keynes and Robinson Crusoe a Shannon number (upper bound) of 3…