What is the probability that a random graph contains an independent set of size at least j ?
- From: Francois Delbot <francois.delbot@xxxxxxxxx>
- Date: Wed, 19 Sep 2007 15:55:36 -0000
Dear all,
i am looking for the probability that a graph has at least one
independent set of size j.
The graph is a random graph: we have V vertexes and an edge (i,k)
exist with probability x.
if i have a set of j vertexes, i can said that this set is an
independent set with probability (1-x)^(j*(j-1)/2).
so, i enumerate the number of sets of size j in my graph, and i
multiply by the probability that a set is an independent set:
binomial(V, j)*(1-x)^((1/2)*j*(j-1))
but, for exemple, when V=10, and x=0.2, i obtained 36.0.
Clearly, it cannot be a probability. I dont understand how i can
calculate the probability that a graph G(V,x) contains an independent
set.
Can you help me please?
thank you very much
Francois Delbot
.
- Follow-Ups:
- Prev by Date: Need help to check/extend a proof.
- Next by Date: Re: What is the probability that a random graph contains an independent set of size at least j ?
- Previous by thread: Need help to check/extend a proof.
- Next by thread: Re: What is the probability that a random graph contains an independent set of size at least j ?
- Index(es):
Relevant Pages
|