Determination of structural complication of decentralizing networks TCNS of special control system by the methods of graphs spectral theory
Main Article Content
Abstract
In the article the use of methods of spectral theory of the graphs is offered for the estimation of structural complication of decentralizing TCNS of special control system, by research of statistical properties which characterize the conduct of network and forecast its conduct at the change of structural properties. For finding of spectrum of adjacency of count of TCN matrix the use of direct method is offered with the decision of the system of linear equalizations of algebra by the method of secant. It is rotined that a direct method on the basis of method of secant has beautiful convergence and allows to define an approximate decision for the eventual amount of iterations. The offered index of complication of network is invariant and can be used for the decision of tasks of verification of isomorphism of counts, laying out of counts, on clusters and others like that.
Reference 10, figures 3
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
Andreev A. M. (2011), [Analiz basic descriptions of the computer systems by the methods of spectral theory of the graphs]. Electronic resource 10, October is a access: http://www.technomag.edu.ru/doc/233774.html (Rus)
Buvaylo D.P. (2002), [The Rapid high-performance algorithm for the division of irregular counts]. Zaporozhia: Announcer of the Zaporozhia state university. No 2, P.10. (Ukr)
E. á. Yudin, V.N. Zadorozhnyy. (2012), [Methods of structural authentication of large stochastic networks and generation of casual counts]. A management is in the technical, ergatic, organizational and network systems – UTEOSS-2012, Saint Petersburg, on October, 9-11, pp. 515-518 p. (Rus)
Barabasi A., Albert R. (1999), [Emergence of csaling in random networks]. Science. 1999. Vol.286. pp.500-512.
Melnikova E.A., Sayfullina E.F. (2012), [Application of different invariants of counts to verification of isomorphism of some types of counts]. Problems of informatics are in education, management, economy and technique: Collection of reasons of the XII International scientific and technical conference is Penza: PDZ, pp. 40-42. (Rus)
Cvetkovich, D. (1984), [Spektry counts [Text]: Theory and application]. Trudged. with angl. of V. P. Korolyuka; Under red. V. P. Korolyuka. — a 2th publ. is Kiev: Naukova dumka, P. 384. (Rus)
Ryashko L.B., Bashkirceva I.A. (2013), [Spectral criterion of stochastic firmness of invariant solutions]. Cybernetics and analysis of the systems. No 1. pp. 82-90. (Ukr)
Mekenyan O., Bonchev D. (1988). [Topological indices for molecular fragments and new graph invariants]. Journal of Mathematical Chemistry. no 3. pp. 347-375.
Skorobogatov V.A., Dobrynin A.A. (1988), [Metric analysis of graphs]. MATCH – Communications in Mathematical and in Computer Chemistry. No 23. pp. 105-151.
Mudrov A.E. (1991), [The Numeral methods for PEVM on languages Basic, Fortran and Paskal]. it is Tomsk: MT of «RASKO», P. 272. (Rus)
