On the significance of edges for connectivity in uncertain random graphs
Abstract:
In practical applications of graph theory, indeterminacy factors always appear in graphs. Uncertain random graph was proposed via chance theory, in which some edges exist with degrees in probability measure and others exist with degrees in uncertain measure. This paper discusses the contributions of edges for connectivity of an uncertain random graph and proposes concepts about significance of edges, according to which edges are classified. In addition, this paper presents algorithms for calculating connectivity index and significance of edges of an uncertain random graph. Examples are given to illustrate algorithms and methods.
Related Concept Videos
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks
Critical Region, Critical Values and Significance Level
In hypothesis testing, a sample statistic is converted to a test statistic using z, t, or chi-square distribution. A critical region is an area under the curve in probability distributions demarcated by the critical value. When the test statistic falls in this region, it suggests that the null hypothesis must be rejected. As this region contains all those values of the...
Propagation of Uncertainty from Random Error
Intracellular Signaling Affects Focal Adhesions
Some...
Notch Signaling Pathway
The Notch gene came into the limelight in 1914 after the discovery that its mutation in Drosophila melanogaster leads to a serrated (or "notched") wing margin phenotype. It was not...


