Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhiyan Shi
dblp:144/0837
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0002-3190-8121ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Coding theory · 58% Information theory · 42% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures › entropy
asymptotic equipartition property |
1.0 | 1 | 2026 | The AEP for Hidden Markov Tree Models · IEEE Trans. Inf. Theory 2026 |
Coding theory › source coding
lossless compression |
1.0 | 1 | 2026 | The AEP for Hidden Markov Tree Models · IEEE Trans. Inf. Theory 2026 |
Coding theory
source coding |
1.0 | 1 | 2026 | The AEP for Hidden Markov Tree Models · IEEE Trans. Inf. Theory 2026 |
Information theory
ergodic theory |
0.2 | 1 | 2015 | The Strong Law of Large Numbers and the Entropy Ergodic Theorem for Nonhomogeneous Bifurcating Markov Chains Indexed by a Binary Tree · IEEE Trans. Inf. Theory 2015 |
Information theory › probability theory
stochastic processes |
0.2 | 1 | 2015 | The Strong Law of Large Numbers and the Entropy Ergodic Theorem for Nonhomogeneous Bifurcating Markov Chains Indexed by a Binary Tree · IEEE Trans. Inf. Theory 2015 |
Methods — techniques the papers use, named apart from their topics
strong law of large numbers · 1.2typical set analysis · 1.0limit theorems · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The AEP for Hidden Markov Tree ModelsabstractThe asymptotic equipartition property (AEP) plays an important role in establishing lossless source coding theorems and asymptotic coding theorems through the concepts of typical sets and typical sequences in information theory. In this paper, we shall study the strong law of large numbers and the AEP for hidden Markov tree models. First, we give a strict definition of hidden Markov tree models, and study their key properties and equivalent characterizations. In fact, hidden Markov tree models are closely related to the tree-indexed Markov chains, therefore, we also introduce the definition of tree-indexed Markov chains and their equivalent properties. We also establish a strong law of large numbers for hidden Markov tree models indexed by a Cayley tree. As corollaries, we obtain some strong laws of large numbers for the parameters and the AEP for these models. Zhiyan Shi, Bao Wang 0002, Weiguo Yang |
IEEE Trans. Inf. Theory | 1 |
| 2015 | The Strong Law of Large Numbers and the Entropy Ergodic Theorem for Nonhomogeneous Bifurcating Markov Chains Indexed by a Binary TreeabstractGuyon (Guyon J. Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging. Ann Appl Probab, 2007, 17: 1538-1569) introduced an important model for homogeneous bifurcating Markov chains indexed by a binary tree taking values in general state space and studied their limit theorems. The results were applied to detect cellular aging. In this paper, we define a discrete form of nonhomogeneous bifurcating Markov chains indexed by a binary tree and discuss the equivalent properties for them. The strong law of large numbers and the entropy ergodic theorem are studied for these Markov chains with finite state space. In contrast to previous work, we use a new approach to prove the main results of this paper. Hui Dang, Weiguo Yang, Zhiyan Shi |
IEEE Trans. Inf. Theory | 3 |