We propose a new expected value of rooted graph in this article,that is, when G is a rooted graph that each vertex may independently succeed with probability p when catastrophic thing happened, we consider the expecte...We propose a new expected value of rooted graph in this article,that is, when G is a rooted graph that each vertex may independently succeed with probability p when catastrophic thing happened, we consider the expected number of edges in the operational component of G which containing the root. And we get a very important and useful compute formula which is called deletion-contraction edge formula. By using this formula, we get the computational formulas of expected value for some special graphs. We also discuss the mean of expected value when parameter p has certain prior distribution. Finally, we propose mean-variance optimality when rooted graph has the equilibrium point which has larger mean and smaller variance.展开更多
基金Supported by the National Natural Science Foundation of China(No:6087206011071158)+1 种基金the Science Foundation of Shanghai Education Committee(No:12ZZ193)the Natural Science Foundation of Shanghai city(No:12ZR1421000)
文摘We propose a new expected value of rooted graph in this article,that is, when G is a rooted graph that each vertex may independently succeed with probability p when catastrophic thing happened, we consider the expected number of edges in the operational component of G which containing the root. And we get a very important and useful compute formula which is called deletion-contraction edge formula. By using this formula, we get the computational formulas of expected value for some special graphs. We also discuss the mean of expected value when parameter p has certain prior distribution. Finally, we propose mean-variance optimality when rooted graph has the equilibrium point which has larger mean and smaller variance.
