On the public citation graph

A Bernstein-Type Bound on Shannon Entropy Over Countably Infinite Alphabets

https://doi.org/10.2139/ssrn.4601987

0 signed · 11 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-extracted

A Mathematical Theory of Communication

inferredcites →https://doi.org/10.1002/rsa.10019openalex-extracted

Convergence properties of functional estimates for discrete distributions

inferredcites →https://doi.org/10.1016/j.spl.2020.108779openalex-extracted

A note on new Bernstein-type inequalities for the log-likelihood function of Bernoulli variables

inferredcites →https://doi.org/10.1016/j.spl.2023.109803openalex-extracted

Optimal non-asymptotic concentration of centered empirical relative entropy in the high-dimensional regime

inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-extracted

Concentration of Measure for the Analysis of Randomized Algorithms

inferredcites →https://doi.org/10.1017/cbo9780511921889openalex-extracted

Information Theory

inferredcites →https://doi.org/10.1088/1742-5468/2013/04/p04010openalex-extracted

Infinite Shannon entropy

inferredcites →https://doi.org/10.1186/s13660-023-02995-1openalex-extracted

Optimal distribution-free concentration for the log-likelihood function of Bernoulli variables

inferredcites →https://doi.org/10.1561/0100000064openalex-extracted

Concentration of Measure Inequalities in Information Theory, Communications, and Coding

inferredcites →https://doi.org/10.3150/21-bej1403openalex-extracted

An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting

inferredcites →https://doi.org/10.48550/arxiv.1909.00250openalex-extracted

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.