핵심 개념
Git 그래프의 무작위 생성 알고리즘에 대한 연구
통계
"The uniform model"에서 "The average number of commits in the main branch is asymptotically equivalent to n/2."
"Proposition 1. Let u be any real positive number."
"Proposition 2. Let k(γn) be the number of commits in the main branch of a graph γn taken at random with probability P(γn) = uk(γn)k(γn)!1/fGn(u)."
인용구
"Most Git graphs look alike under the uniform distribution."
"A large random Git graph is with high probability of the same shape."
"The purpose of this paper is to develop an efficient random sampler for DAGs that respect a particular workflow."