Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Avtomatika i Telemekhanika, 1981, Issue 3, Pages 175–180 (Mi at5750)  

Notes

Reliability of relay networks structured as a bipartite graph

V. A. Gadasin

Moscow
Abstract: The paper is concerned with probabilistic networks whose structure is specified as a random complete bipartite graph. An explicit expression is obtained for the probability of connectivity of the entire set of the graph vertices and for that of the set of vertices of one part. These characteristics are asymptotically estimated with increased cardinality of the sets of vertices, graph parts.

Received: 26.06.1979
Document Type: Article
UDC: 621.3.019.3:621.396.2:519.14
Language: Russian
Citation: V. A. Gadasin, “Reliability of relay networks structured as a bipartite graph”, Avtomat. i Telemekh., 1981, no. 3, 175–180
Citation in format AMSBIB
\Bibitem{Gad81}
\by V.~A.~Gadasin
\paper Reliability of relay networks structured as a bipartite graph
\jour Avtomat. i Telemekh.
\yr 1981
\issue 3
\pages 175--180
\mathnet{http://mi.mathnet.ru/at5750}
Linking options:
  • https://www.mathnet.ru/eng/at5750
  • https://www.mathnet.ru/eng/at/y1981/i3/p175
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:93
    Full-text PDF :37
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024