44 citations · 155 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LG2017★ 5 cited
Hypotheses testing on infinite random graphs
Daniil Ryabko
Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning…
cs.LG2017★ 2 cited
Independence clustering (without a matrix)
Daniil Ryabko
The independence clustering problem is considered in the following formulation: given a set of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k…