Talk:Rejection sampling

	This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics
???	This article has not yet received a rating on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the importance scale.

as a layman I find the present page too hard to understand, e.g. I don't know the terms "subgraph of a function" or "marginally"
how does it compare to alternatives?
I was looking for this information using the term "rejection algorithm", is that a common alternative name?
Yes, I agree. Too full of jargon to be useful for outsiders! In the algorithm, how does one 'sample from g(x)'?

Example is good, but incomplete

The circle in square example is very clear, but it lacks the random rejection aspect of the algorithm; once the point is chosen, whether it will be accepted or not is already determined regardless of u. It would be nice to have a more complete example.

Another way of saying this is that this example is more of an example for importance sampling, which does not involve a random u.

—Preceding unsigned comment added by Rodrigo braz (talk • contribs) 02:12, 23 December 2007 (UTC) Rodrigo de Salvo Braz (talk) 02:15, 23 December 2007 (UTC)[reply]

Naming

Is this method perhaps known in English as von Neumann method? And if it is, should we make a redirect (I tried to find it as a von Neumann method, since it is what we call it in Serbian)? -- Obradović Goran (ta^lk 19:16, 28 April 2008 (UTC)[reply]