JournalVolume 8, №2Minimax estimations of arc weights in integer networks with fixed node degrees (pages 216-226) A.A. Mironov, T.A. Levkina, V.I. Tsurkov Abstract. In this paper, we consider classes of integer networks (with loops, without loops, and bipartite) with mixed node degrees, where weights of arcs do not exceed a given parameter. Under the assumption that all networks from these classes are equiprobable, we build weighted expectation (and probability) matrices and show that the expectations of arc weihts with lesser node degrees do not exceed those of arcs with greater node degrees. We obtain the lower bound of the maximum matrix element and the upper bound of the minimum matrix element by applying the minimax concept for a class of networks in terms of node degrees. Results of the paper can be applied to multigraph random walk.
|
|