Disintegration Processes and Connectivity in Random Graphs
نویسنده
چکیده
The subject of this paper are Markov chains arising from the study of random graphs. The processes into consideration are interpreted as a discrete-time disintegration of radioactive atoms with anomalies. Our approach is based on (multivariate) generating functions which allow both exact analyses and asymptotic estimates. In particular, we investigate a traversing algorithm on random graphs and we derive distributions and moments for the number of isolated connected substructures in a random graph.
منابع مشابه
Incidence cuts and connectivity in fuzzy incidence graphs
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملDisintegration, Yule Process and Random Graphs
In this paper we demonstrate that the disintegration process of radioactive atoms in the discrete time model has a natural interpretation in the theory of random graphs. Moreover, we reduce some problems in this area to disintegration processes with anomalies. For instance , we derive exact closed formull for the probabilities and the moments of the number of isolated vertices in Bernoulli grap...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کامل