Large Deviation Bounds for Number of Forests (or Tutte polynomial) in G(n,p)

Does anyone know of results/references related to large deviation bounds on the number of subforests (or the Tutte polynomial) in G(n,p) (Erdos-Renyi random graphs)?

edited Apr 14 2011 at 5:36

asked Apr 13 2011 at 20:48

pranav-dandekar
43●2

I now know of results about the expectation and variance of the number of spanning trees in G(n,p) (journals.cambridge.org/action/…) and the expected number of forests in G(n,p). But still no results on large deviation bounds for the number of forests. – pranav-dandekar Apr 15 2011 at 23:37

Browse other questions tagged random-graphs co.combinatorics reference-request or ask your own question.

question feed

Large Deviation Bounds for Number of Forests (or Tutte polynomial) in G(n,p)

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Your Answer

Browse other questions tagged random-graphs co.combinatorics reference-request or ask your own question.

Welcome to MathOverflow

How to write math

Large Deviation Bounds for Number of Forests (or Tutte polynomial) in G(n,p)

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Your Answer

Browse other questions tagged random-graphs co.combinatorics reference-request or ask your own question.

Welcome to MathOverflow

Related

How to write math