Katalin Marton | Academic Influence

Katalin Marton's AcademicInfluence.com Rankings

Katalin Marton

Mathematics

#1984

World Rank

#3137

Historical Rank

Group Theory

#238

World Rank

#282

Historical Rank

Algebra

#260

World Rank

#374

Historical Rank

Measure Theory

#3441

World Rank

#4059

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Katalin Marton's Degrees

PhD Mathematics Eötvös Loránd University
Masters Mathematics Eötvös Loránd University

Why Is Katalin Marton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Katalin Marton was a Hungarian mathematician, born in Budapest. Education and career Marton obtained her PhD from Eötvös Loránd University in 1965 and worked at the Department of Numerical Mathematics, Central Research Institute for Physics, Budapest from 1965 to 1973. Important influences on her early career were her attendance at the combinatorics seminar organised by Alfréd Rényi from 1966, meeting Roland Dobrushin in Debrecen in 1967 , and her collaboration with Imre Csiszár which began in 1972. From 1973 she worked at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences in Budapest, visiting the United States in 1977 and in 1979–80 .

(See a Problem?)

Katalin Marton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A coding theorem for the discrete memoryless broadcast channel (1979) (603)
How to encode the modulo-two sum of binary sources (Corresp.) (1979) (339)
General broadcast channels with degraded message sets (1977) (294)
Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration (1996) (250)
A measure concentration inequality for contracting markov chains (1996) (209)
A simple proof of the blowing-up lemma (1986) (180)
Error exponent for source coding with a fidelity criterion (1974) (178)
Entropy splitting for antiblocking corners and perfect graphs (1990) (109)
New Bounds for Perfect Hashing via Information Theory (1988) (101)
Images of a set via two channels and their role in multi-user communication (1977) (75)
Measure concentration for a class of random processes (1998) (75)
Measure concentration for Euclidean distance in the case of dependent random variables (2004) (52)
The positive-divergence and blowing-up properties (1994) (48)
Measure concentration and strong mixing (2003) (42)
On the Shannon Capacity of Probabilistic Graphs (1993) (42)
Graphs that Split Entropies (1988) (42)
Entropy and the Consistent Estimation of Joint Distributions (1993) (38)
Logarithmic Sobolev inequalities in discrete product spaces: a proof by a transportation cost distance (2015) (27)
Correction: "Entropy and the consistent estimation of joint distributions" (1994) (27)
An inequality for relative entropy and logarithmic Sobolev inequalities in Euclidean spaces (2012) (20)
Logarithmic Sobolev inequalities in discrete product spaces (2019) (19)
Almost sure waiting time results for weak and very weak Bernoulli processes (1994) (18)
Random access communication and graph entropy (1988) (17)
On the capacity of uniform hypergraphs (1990) (13)
Almost-sure waiting time results for weak and very weak Bernoulli processes (1995) (13)
Erratum to "A Measure Concentration Inequality for Contracting Markov Chains" (1997) (10)
How many future measures can there be? (2002) (7)
The structure of isomorphisms of discrete memoryless correlated sources (1981) (5)
Relative capacity and dimension of graphs (2001) (4)
Correction. Measure concentration for Euclidean distance in the case of dependent random variables. (2010) (4)
Ergodic Processes And Zero Divergence (1991) (4)
An explicit bound on the Logarithmic Sobolev constant of weakly dependent random variables (2006) (3)
The problem of isomorphy for general discrete memoryless stationary correlated sources (1983) (2)
Stationary processes having the blowing-up property (1994) (1)
Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless (1987) (1)
Bounding relative entropy by the relative entropy of local specifications in product spaces (2009) (1)
Isomorphisms of certain correlated probability spaces and of discrete memoryless correlated sources (1987) (0)
On weak asymptotic isomorphy of memoryless correlated sources (1987) (0)
干渉通信路研究の潮流 Streams of Study for the Interference Channel 韓太舜 (2015) (0)
From Information Theory to Combinatorics A workshop in honour of Jànos Körner ’ s research world (2017) (0)
Entropy splitting for antiblocking pairs and perfect graphs by (2007) (0)

This paper list is powered by the following services:

Other Resources About Katalin Marton

en.wikipedia.org

What Schools Are Affiliated With Katalin Marton?

Katalin Marton is affiliated with the following schools:

Eötvös Loránd University

Image Attributions

Image Source for Katalin Marton