Daniil Ryabko

Dr. Daniil Ryabko

inria (on leave from); Fishlife Research

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 March 2010 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
DRDaniil Ryabko
Daniil Ryabko
Boris RyabkoBoris Ryabko
Boris Ryabko
In this work, a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary ergodic. Namely, three problems are considered: goodness-of-fit (or identity) testing, process classification, and the change point problem. For each of the problems a test is constructed that is asymptotically accurate for the case when the data is generated by stationary ergodic processes. The tests are based on empirical estimates of distributional distance.

2 December 2009 in Journal of Theoretical Probability
Verified
Journal Article
Closed access
PDF file
DRDaniil Ryabko
Daniil Ryabko

6 May 2011 in TEST
Verified
Journal Article
Closed access
PDF file
DRDaniil Ryabko
Daniil Ryabko

30 September 2011 in Information and Computation
Verified
Journal Article
Closed access
Boris RyabkoBoris Ryabko
Boris Ryabko
DRDaniil Ryabko
Daniil Ryabko

1 June 2007
Verified
Conference Paper
Closed access
Boris RyabkoBoris Ryabko
Boris Ryabko
DRDaniil Ryabko
Daniil Ryabko
We propose a simple universal (that is, distribution- free) steganographic system in which covertexts with and without hidden texts are statistically indistinguishable. The stegosystem can be applied to any source generating i.i.d. covertexts with unknown distribution, and the hidden text is transmitted exactly, with zero probability of error. Sequences of covertexts with and without hidden information obey the same distribution (the stegosystem is perfectly secure). The proposed steganographic system has two important properties. First, the rate of transmission of hidden information approaches the Shannon entropy of the covertext source as the size of blocks used for hidden text encoding tends to infinity. Second, if the size of the alphabet of the covertext source and its minentropy tend to infinity then the number of bits of hidden text per letter of covertext tends to log(n!)/n where n is the (fixed) size of blocks used for hidden text encoding. Besides, the resource complexity of the proposed algorithms grows only polynomially.

1 June 2007
Verified
Conference Paper
Closed access
DRDaniil Ryabko
Daniil Ryabko
MHMarcus Hutter
Marcus Hutter
Suppose we are given two probability measures on the set of one-way infinite finite-alphabet sequences. Consider the question when one of the measures predicts the other, that is, when conditional probabilities converge (in a certain sense), if one of the measures is chosen to generate the sequence. This question may be considered a refinement of the problem of sequence prediction in its most general formulation: for a given class of probability measures, does there exist a measure which predicts all of the measures in the class? To address this problem, we find some conditions on local absolute continuity which are sufficient for prediction and generalize several different notions that are known to be sufficient for prediction. We also formulate some open questions to outline a direction for finding the conditions on classes of measures for which prediction is possible.