Lecture 11: October 4 11.1 Network Reliability

نویسندگان

  • Alistair Sinclair
  • Cameron Hill
  • Arnab Sen
  • Sharmodeep Bhattacharyya
چکیده

Consider a connected undirected graph G with n vertices and m edges, where each edge has some probability p of failing. What is the probability that G becomes disconnected under random, independent edge failures? This can also be viewed as a counting problem, except that each item now has an associated weight: in particular, we want to compute the sum of the weights of all disconnected subgraphs of G, where the weight of a subgraph with t fewer edges than G is p(1 − p)m−t. We can also generalize the problem to allow a different failure probability for each edge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture 11: October 8 11.1 Primal and Dual Problems

j=1 vj`j(x). Lagrange multipliers u ∈ R, v ∈ R. Lemma 11.1 At each feasible x, f(x) = supu≥0,v L(x, u, v), and the supremum is taken iff u ≥ 0 satisfying uihi(x) = 0, i = 1, · · · ,m. Proof: At each feasible x, we have hi(x) ≤ 0 and `(x) = 0, thus L(x, u, v) = f(x) + ∑m i=1 uihi(x) + ∑r j=1 vj`j(x) ≤ f(x). The last inequality becomes equality iff uihi(x) = 0, i = 1, · · · ,m. Proposition 11.2 T...

متن کامل

Foundations of Intelligent Systems, 12th International Symposium, ISMIS 2000, Charlotte, NC, USA, October 11-14, 2000, Proceedings

Only for you today! Discover your favourite foundations of intelligent systems 12th international symposium ismis 2000 charlotte nc usa october 11 14 2000 proceedings lecture notes in computer science book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available ...

متن کامل

Software Language Engineering, Second International Conference, SLE 2009, Denver, CO, USA, October 5-6, 2009, Revised Selected Papers

When there are many people who don't need to expect something more than the benefits to take, we will suggest you to have willing to reach all benefits. Be sure and surely do to take this software language engineering second international conference sle 2009 denver co usa october 5 6 2009 revised selected papers lecture notes in computer science that gives the best reasons to read. When you rea...

متن کامل

NETWORKING 2009, 8th International IFIP-TC 6 Networking Conference, Aachen, Germany, May 11-15, 2009. Proceedings

medical image computing and computer-assisted intervention-miccai 2015 18th international conference munich germany october 5-9 2015 proceedings part i lecture notes in computer science PDF

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011