Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a random graph $G = (V, E)$ and each edge is in the graph with probability $p$.

I need to show that the probability that $G$ is $\delta$-edge-expander* when $\delta= \frac{np}{4}$ goes to $1$ as $n=|V|\to\infty$.

*A graph is $\delta$-edge-expander if for every set of nodes $S$ of size at most $\frac{n}{2}$ it holds that the number of edges from $S$ to $S'$ (where $S'$ is all the nodes that don't appear in $S$) is at least $\delta$. You can see the definition in this wiki page.

share|cite|improve this question
please elaborate on what is a δ−edge−expander – Koushik Dec 27 '12 at 8:16
It's unclear what you mean by the event that $G$ is "$\delta--edge--expander$. And you should mention that $n$ is the number of vertices of the graph $G$, if that's what $n$ is here. – coffeemath Dec 27 '12 at 8:18
The definition on the wiki page requires the edge boundary to be at least $\mathrm{const}\,|S|$, and you wrote "at least $\delta$", without $|S|$. – user53153 Dec 27 '12 at 17:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.