Content deleted Content added
Line 99:
If pairs of positive integers <math>m, n</math> are sampled from a distribution <math>f(n,m)</math> and used to generate ratios <math>q=n/(n+m)</math>, this gives rise to a distribution <math>g(q)</math> on the rational numbers. If the integers are independent the distribution can be viewed as a [[convolution]] over the rational numbers, <math display="inline">g(a/(a+b)) = \sum_{t=1}^\infty f(ta)f(tb)</math>. Closed form solutions exist for [[power-law]] distributions with a cut-off. If <math>f(k) =k^{-\alpha} e^{-\beta k}/\mathrm{Li}_\alpha(e^{-\beta})</math> (where <math>\mathrm{Li}_\alpha</math> is the [[polylogarithm]] function) then <math>g(a/(a+b)) = (ab)^{-\alpha} \mathrm{Li}_{2\alpha}(e^{-(a+b)\beta})/\mathrm{Li}^2_{\alpha}(e^{-\beta})</math>. In the case of uniform distributions on the set <math>\{1,2,\ldots , L\}</math> <math>g(a/(a+b)) = (1/L^2) \lfloor L/\max(a,b) \rfloor</math>, which is very similar to Thomae's function.<ref name="Trifonov" />
Probability distributions related to Thomae's function can also be derived from recurrent processes generated from uniform discrete distributions. Such uniform discrete distributions can be pi digits, flips of a fair dice or live casino spins. In greater detail, the recurrent process is characterized as follows: A random variable C{{sub|i}} is repeatedly sampled N times from a discrete uniform distribution, where i ranges from 1 to N. For instance, consider integer values ranging from 1 to 10. Moments of occurrence, T{{sub|k}}, signify when events
[[File:Thomae's_function_like_distribution.jpg|thumb|Thomae's function like distribution]]
==The ruler function==
| |||