Contextual analysis of~the~bipolar~structures~connectivity

A. S. Losev

Prikladnaâ diskretnaâ matematika, no. 1 (2024), pp. 102-108.

Résumé

The paper discusses an original approach to the analysis of network structures of various natures, which are represented in the form of graphs. It is assumed that the probability of connectivity of individual edges functionally depends on their physical characteristics (edge length) and tends to zero. The issue of increasing the connectivity probability of the entire graph is being addressed, which is defined as the probability of the existence of a sequential set of edges connecting the selected start and end vertices. A distinctive feature of the proposed method is the move away from the traditional reservation of obviously weak connection points towards a functional impact on individual connections of the structure, changing their physical characteristics. Based on the theory of systems functioning and the theory of dominants, contextual approach is being developed aimed at identifying the dominant connections of the graph, reflecting the functional and meaningful meaning of the connections between the vertices of the original modeled object. As a result, a set of dominants $\mathcal{S}$ is identified, consisting of edges whose parameters meet the given criteria. The selection criterion is the length of the edge included in the asymptotic relation, which characterizes the connectivity probability of the entire graph. It has been proven that changing the length of edges from a given set by $\varepsilon>0$ increases the probability of connectedness of the original graph in the maximum case in $h^{- \varepsilon}$ or $ h^{-\varepsilon \beta} $ times, where $h\to 0$ and $ \beta $ is a parameter depending on the number of graph paths passing through this edge. Various methods have been proposed to increase the connectivity probability of the graph under consideration: from the point of view of the point effect, by reducing the length of a single edge from the set $\mathcal{S}$; from the position of influencing the maximum set of edges from $\mathcal{S}$, allowing to obtain the overall maximum effect. A comparative analysis of the proposed ways to increase the probability of graph connectivity has been carried out, and the appropriate conditions have been identified to achieve the maximum effect from the selected methods of influence.

Détail

Keywords: connectivity, bipolar network, set of dominants, network structure.

Bibliographie

[1] Aksenov S. V., Organization and Use of Neural Networks (Methods and Technologies), NTL Publ., Tomsk, 2006, 128 pp. (in Russian)

[2] Bogachev K. Yu., Basics of Parallel Programming, BINOM Publ., M., 2003 (in Russian)

[3] Voevodin V. V., “Supercomputers: yesterday, today, tomorrow”, Nauka i Zhizn', 2000, no. 5, 76–83 (in Russian)

[4] Voevodin V. V., Parallel Computing, BKhV Publ., Saint Petersburg, 2002 (in Russian)

[5] Krug P. G., Neural Networks and Neurocomputers, MPEI Publ., M., 2002, 176 pp. (in Russian)

[6] Collinger J. L., “High-performance neuroprosthetic control by an individual with tetraplegia”, The Lancet, 6736:12 (2012), 61816–61819

[7] Culloch W. S. and Pitts W. H., “Logical calculus of ideas immanent in nervous activity”, Bull. Math. Biophysics, 5 (1943), 115–119 | DOI | MR

[8] Hopfield J. J., “Neural networks and physical systems with emergent collective computational abilities”, Proc. National Academy of Sci., 79 (1982), 2554–2558 | DOI | MR | Zbl

[9] Hopfield J. J., “Neural computation of decision in optimization problems”, Biol. Cybernet., 52 (1985), 141–152 | DOI | MR | Zbl

[10] Anokhin P. K., Selected Works: Cybernetics of Functional Systems, Meditsina, M., 1998, 400 pp. (in Russian)

[11] Ukhtomskiy A. A., Dominant, Piter, Saint Petersburg, 2002, 448 pp. (in Russian)

[12] Ukhtomskiy A. A., Dominant: Physiology of Behavior, AST Publ., M., 2020, 117 pp. (in Russian)

[13] Losev A. S., “Asymptotic analysis of the reliability of stochastic networks”, Informatika i Sistemy Upravleniya, 2008, no. 4(18), 101–105 (in Russian)

[14] Tsitsiashvili G. Sh., Losev A. S., and Osipova M. A., “Asymptotic formulas for the connectedness probabilities of random graphs”, Avtomatika i Vychislitel'naya Tekhnika, 2013, no. 2, 22–28 (in Russian)