Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Game-Theoretic Centrality Measures for Weighted Graphs

Mazalov V. V., Trukhina L. I., Avrachenkov K. E., Tsynguev B. T.

Fundamenta Informaticae

2016

Vol. 145, nr 3

341--358

The betweenness centrality is one of the basic concepts in the analysis of the social networks. Initial definition for the betweenness of a node in the graph is based on the fraction of the number of geodesics (shortest paths) between any two nodes that given node lies on, to the total number of the shortest paths connecting these nodes. This method has polynomial complexity. We propose a new concept of the betweenness centrality for weighted graphs using the methods of cooperative game theory. The characteristic function is determined by special way for different coalitions (subsets of the graph). Two approaches are used to determine the characteristic function. In the first approach the characteristic function is determined via the number of direct and indirect weighted connecting paths in the coalition. In the second approach the coalition is considered as an electric network and the characteristic function is determined as a total current in this network. We use the Kirchhoff's law. After that the betweenness centrality is determined as the Myerson value. The results of computer simulations for some examples of networks, in particular, for the popular social network "VKontakte", as well as the comparing with the PageRank method are presented.

Iterative Learning Control for Over-Determined, Under-Determined, and Ill-Conditioned Systems

Avrachenkov K. E., Longman R. W.

International Journal of Applied Mathematics and Computer Science

2003

Vol. 13, no 1

113-122

This paper studies iterative learning control (ILC) for under-determined and over-determined systems, i.e., systems for which the control action to produce the desired output is not unique, or for which exact tracking of the desired trajectory is not feasible. For both cases we recommend the use of the pseudoinverse or its approximation as a learning operator. The Tikhonov regularization technique is discussed for computing the pseudoinverse to handle numerical instability. It is shown that for over-determined systems, the minimum error is never reached by a repetition invariant learning controller unless one knows the system exactly. For discrete time uniquely determined systems it is indicated that the inverse is usually ill-conditioned, and hence an approximate inverse based on a pseudoinverse is appropriate, treating the system as over-determined. Using the structure of the system matrix, an enhanced Tikhonov regularization technique is developed which converges to zero tracking error. It is shown that the Tikhonov regularization is a form of linear quadratic ILC, and that the regularization approach solves the important practical problem of how to intelligently pick the weighting matrices in the quadratic cost. It is also shown how to use a modification of the Tikhonov-based quadratic cost in order to produce a frequency cutoff. This robustifies good learning transients, by reformulating the problem as an over-determined system.