this is for holding javascript data
Dan Gifford edited untitled.tex
about 10 years ago
Commit id: f1236a38b2d7c718163d74b553b994291e94e696
deletions | additions
diff --git a/untitled.tex b/untitled.tex
index d445083..6cbb0bf 100644
--- a/untitled.tex
+++ b/untitled.tex
...
\end{equation}
Really there are completeness and purity terms in there as well, but lets ignore those for a second. So that is our expected distribution for a given $M$, but we are binning! That means that we have a distribution of masses in our bin that we must integrate over. What does this integral look like?
\begin{equation}
\langle \hat{\sigma} \rangle =
\int_{min(bin)}^{max_bin} \int_{min(bin)}^{max(bin)} dM \frac{d \langle n \rangle}{dM} P(\hat{\sigma} | M)
\end{equation}