We study several distinct notions of average distances between points belonging to graph‐directed self‐similar subsets of double-struckR. In particular, we compute the average distance with respect to graph‐directed self‐similar measures, and with respect to the normalised Hausdorff measure. As an application of our main results, we compute the average distance between two points belonging to the Drobot–Turner set TNfalse(c,mfalse) with respect to the normalised Hausdorff measure, i.e. we compute
trueleft1scriptHs(TNfalse(c,mfalse))2∫TN(c,m)2false|x−yfalse|dfalse(Hs×Hsfalse)false(x,yfalse),where s denotes the Hausdorff dimension of TNfalse(c,mfalse) and Hs is the s‐dimensional Hausdorff measure; here the Drobot–Turner set (introduced by Drobot & Turner in 1989) is defined as follows, namely, for positive integers N and m and a positive real number c, the Drobot–Turner set TNfalse(c,mfalse) is the set of those real numbers x∈[0,1] for which any m consecutive base N digits in the N‐ary expansion of x sum up to at least c. For example, if N=2, m=3 and c=2, then our results show that
trueleft1scriptHs(T2false(2,3false))2∫T2(2,3)2false|x−yfalse|dfalse(Hs×Hsfalse)false(x,yfalse)left126.0pt0.28em0.28em1em1em=4444λ2+2071λ+303012141λ2+5650λ+8281=0.36610656…,where λ=1.465571232… is the unique positive real number such that λ3−λ2−1=0.