this is for holding javascript data
Alberto Pepe edited the fork factor.tex
almost 10 years ago
Commit id: 07150e31eeb23c0078e3c6eb4c6794cf1492ddb1
deletions | additions
diff --git a/the fork factor.tex b/the fork factor.tex
index f0008f9..aacd192 100644
--- a/the fork factor.tex
+++ b/the fork factor.tex
...
\begin{equation}
FF = N*(L^{\frac{1}{\sqrt{N}}}-1)
\end{equation}
Where N is the number of forks on your work and L their median length. In order to take into account the reproducibility of research data, the length of forks has a higher
weigh weight in the FF formula. Indeed, forks with length equal to one likely represent a failure to reproduce the forked research datum.
Anyone out there care to improve the formula
above or help us collect some data and test this out? Let us know at \verb|[email protected]| or by commenting here. above? For instance, would it be better if the FF would reach a plateau for L > 3 ?
Let us know at \verb|[email protected]| or by commenting here.