Circles of equal radii randomly placed on a plane: some rigorous results, asymptotic behavior, and application to transparent electrodes
Renat K. Akhunzhanov, Yuri Yu. Tarasevich, Irina V. Vodolazskaya

TL;DR
This paper derives exact and asymptotic distributions of arc lengths formed by randomly placed equal circles on a plane and applies these results to estimate the sheet resistance of transparent electrodes.
Contribution
It provides rigorous results for arc length distributions and their asymptotic behavior, and demonstrates an application to transparent electrode design.
Findings
Exact arc length distribution derived for intersecting circles.
Asymptotic exponential distribution of arc angles in dense systems.
Application to estimating sheet resistance of transparent electrodes.
Abstract
We consider circles of equal radii, , having their centers randomly placed within a square domain of size with periodic boundary conditions (). When two or more circles intersect each other, each circle is divided by the intersection points into several arcs. We found the exact length distribution of the arcs. In the limiting case of dense systems and large size of the domain ( in such a way that the number of circle per unit area, , is constant), the arc distribution approaches the probability density function (PDF) , where is the central angle subtended by the arc. This PDF is then used to estimate the sheet resistance of transparent electrodes based on conductive rings randomly placed onto a transparent insulating film.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Circles of equal radii randomly placed on a plane: some rigorous results, asymptotic behavior, and application to transparent electrodes
R K Akhunzhanov, Y Y Tarasevich, I V Vodolazskaya
Laboratory of Mathematical Modeling, Astrakhan State University, Astrakhan, 414056, Russia
Abstract
We consider circles of equal radii, , having their centers randomly placed within a square domain of size with periodic boundary conditions (). When two or more circles intersect each other, each circle is divided by the intersection points into several arcs. We found the exact length distribution of the arcs. In the limiting case of dense systems and large size of the domain ( in such a way that the number of circle per unit area, , is constant), the arc distribution approaches the probability density function (PDF) , where is the central angle subtended by the arc. This PDF is then used to estimate the sheet resistance of transparent electrodes based on conductive rings randomly placed onto a transparent insulating film.
ā ā :
- July 2019
Keywords: stochastic geometry, randomly placed circles, arcs, probability density function, transparent electrodes, random resistor network
1 Introduction
Problems relating to the covering of circles by randomly placed arcs of random length have been solved over recent decadesĀ [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]. Despite the seeming academicism, such problems have numerous applications. Thus, inĀ [14], covering a circle by randomly placed arcs was considered in connection with its application to the shading problem; inĀ [7, 11], the problem was associated with a random sequential adsorption of rods and a parking problem; inĀ [15], the approach was applied to the problems of genomics. Related problems of covering surfaces with circles are directly related to networks of sensorsĀ [16] and mobile connectionsĀ [17].
Films constituting a conductive mesh on a transparent insulating substrate are known as transparent electrodes. The mesh can be produced by different methods such as ink-jet printing, deposition, etc. A particular case of such electrodes is that of ring-based electrodes. Conductive rings can be created, e.g., by using the ācoffee-ring effectāĀ [18, 19] or by chemical methodsĀ [20, 21].
The rest of this paper is constructed as follows. InĀ sectionĀ 2, the model is described and all necessary quantities are defined. InĀ sectionĀ 3, we consider the intersection of only two circles (sectionĀ 3.1); then, we obtain results for a circle that is intersected by other circles (sectionĀ 3.2); finally, we derive a rigorous formula for a system of circles (sectionĀ 3.3). Asymptotic behavior is studied in sectionĀ 3.4. SectionĀ 4 is devoted to the sheet resistance of ring-based transparent electrodes. SectionĀ 5 summarizes our main results.
2 Model, definitions, and methods
Consider a square domain of a plane . Let the size of the domain be . The domain is subject to periodic boundary conditions (PBCs). PBCs are applied to simplify the consideration by eliminating any effects of borders.
The centers of the circles of radii are assumed to be independent and identically distributed (i.i.d.) in , i.e., , where are the coordinates of the center of the circle. The relation is assumed.
The number of circles per unit area
[TABLE]
is known as the number density. When asymptotic behavior is considered, any changes of the quantities and are supposed to be consistent in such a way as ensure preservation of the given value of the number density,Ā .
If some circles intersect each other, these circles are divided into several arcs. An isolated circle is supposed to have only one arc of length . We are looking for the length distribution of these arcs, and can characterize any arc by the angle that it subtends at the center of the circle. All angles are measured counterclockwise. For simplicity, when we refer to the length of an arc, we mean the angular distance of that arc. Since we are dealing only with circular arcs, we shall simply use the term āarcā.
An outline of our āroad mapā is as follows. To obtain the length distribution of the arcs in a system of circles, we are going to find the length distribution of the arcs in only one circle that intersects exactly other circles. With such a distribution in hand, we can apply a binomial distribution to obtain the arc length distribution in a system of circles. We will start with the simplest case , then, we will add some extra circles.
3 Rigorous results
3.1 Two intersecting circles
Let a circle (circleĀ 1) be intersected by another circle (circleĀ 2). Let us consider an arbitrary point on circleĀ 1. Let an arc starts from . When , circleĀ 2 intersects or touches circleĀ 1 within this arc if and only if (iff) the center of the circleĀ 2 is located within the hatched region in figureĀ 1. The area of the hatched region is the area of the sector with the central angle () plus the area of two semicircles with radii , i.e. the area of the circle with radius (), minus the area of the region in the form of a vesica piscis (). Hence, the probability that the intersection point is located between 0 and from point is
[TABLE]
When (figureĀ 1), circleĀ 2 intersects or touches circleĀ 1 within the arc iff the center of circleĀ 2 locates within the hatched region inĀ figureĀ 1. The area of this region is equal to the area of the sector (), plus the area of two isosceles triangles (), plus the area of the two sectors () (see figureĀ 1). Hence, the probability that the intersection point is located between 0 and from point is
[TABLE]
Finally,
[TABLE]
the PDF can be easily obtained fromĀ (2) by differentiation
[TABLE]
Hereinafter, we suppose that the upper line corresponds to the case , while the bottom line corresponds to the case .
3.2 Given circle is intersected by other circles
Let there be a circle (circleĀ 1) that is intersected by exactly other circles (). Let be an arbitrary point on circleĀ 1 and be the angle between this point and the nearest (counterclockwise) intersection point with another circle (). In fact, the case was considered inĀ sectionĀ 3.1, hence, now we start from .
Let us divide circles into two groups, viz., the first group consists of only one circle, while the other group consists of the rest of the circles. For each of the two groups, and are the angles between point and the nearest intersection point, respectively. and are assumed to be independent. (seeĀ figureĀ 2).
If , , and are random variables with the cumulative distribution functions (CDFs) and , then . Respectively, , if . Hence,
[TABLE]
Thereby
[TABLE]
AccountingĀ (2), the CDF is
[TABLE]
Hence, the PDF is
[TABLE]
3.3 System of circles
If circle 1 and circle 2 intersect each other (figureĀ 3), the probability that the distance, , between their centers does not exceed is
[TABLE]
Hence, the distance, , between the centers of the two intersecting circles obeys the PDF
[TABLE]
where , while the PDF of the central angle is
[TABLE]
(seeĀ figureĀ 3).
Let the random variable be the central angle corresponding to a random arc, Let a given circle (circleĀ 1) be intersected by exactly other circles. The intersection points between circleĀ 1 and these circles divide circleĀ 1 into arcs. The random variable is the central angle of a random arc produced by the intersection of an arbitrary circle with exactly other circles. Its PDF is , where . The PDF of an isolated circle (with central angle of the arc by agreement) is the -function
[TABLE]
Let circleĀ 1 be intersected by only one other circle. In this case, circleĀ 1 is divided into two arcs, viz., and . AccountingĀ (6), the PDF is
[TABLE]
The CDF can be found by integratingĀ (7)
[TABLE]
Let us consider a circle (circle 1). Add one circle to intersect circleĀ 1. Choose one of the two intersection points as a given point (point ). Now, add an extra circles intersecting circleĀ 1 (figureĀ 4), then
[TABLE]
Here, . Both the random variables and are assumed to be independent. Then,
[TABLE]
When , the PDF can be obtained using differentiation of the CDFĀ (9)
[TABLE]
AccountingĀ (4), (5),(7), andĀ (8),
[TABLE]
It is noteworthy that, despite the assumption , (10) is also correct for transforming intoĀ (7).
Two circles intersect each other, iff the distance between their centers , i.e., the center of the second circle is located inside a circle of radius concentric with the first circle (the shadowed region in figureĀ 3). Since the area of the shadowed region is , the probability of intersection of two arbitrary circles randomly located in is
[TABLE]
Accordingly, the probability that the two circles do not intersect each other is equal to
[TABLE]
The probability, , that a given circle is intersected by exactly other circles follows the binomial distribution
[TABLE]
Let circleĀ 1 be intersected by exactly other circles. Then, circleĀ 1 is divided into arcs
[TABLE]
where is the Kronecker delta.
The random variable is the number of circles intersecting a random arc, . Choose a random arc and consider the circle that this arc belongs to. Find the probability that this circle is intersected by other circles. The expected total number of arcs in the system is
[TABLE]
The expected total number of arcs belonging to the arcs divided exactly into arcs is . The probability of interest is
[TABLE]
The PDF, that a random arc subtending an angle upon the condition that the arc belongs to a circle intersected by exactly other circles, is equal to . Application of the formula of total probability gives
[TABLE]
Using obtained formulae for (13) and Ā (10), this transforms into
[TABLE]
Equation (14) together with definitionsĀ (11) andĀ (12) is the PDF of the central angles of the arcs produced by the intersections of circles of equal radii with i.i.d. centers within .
3.4 Asymptotic behavior
Let , the size of the domain under consideration , tends to infinity in such a way that , i.e., the number of circles varies as . Application of the toĀ (14) leads to the PDF ()
[TABLE]
FigureĀ 5 presents the PDFsĀ (15) for different values of the quantity . When , all arcs are equal to or less than occur with a probability . When , this probability is equal to 0.9999998. Since, for , using instead of produces an error of less than 3%, this value can be used as the threshold for small angles.
Now, let us consider the behavior ofĀ (15) when . In this case, almost all the arcs are small, i.e., , and the number of isolated circles is negligible. Hence, we can omit the term with the -function and ignore the bottom line inĀ (15). Since and , the PDF is equal to
[TABLE]
Note, thatĀ (16) can be derived in another way, directly from the consideration of a dense system and averaged quantities by omitting consideration of the common case (see A).
, where is the area of the deposited object, is known as the filling factor (see, e.g.,Ā [22]). is the surface coverage. In the case of discs with radii , , hence,
[TABLE]
4 Application to transparent electrodes
Recently, a formula for the sheet resistance of dense homogeneous random resistor networks (RRNs) has been proposedĀ [23, 24]. The derivation of this formula is based on the assumption that, along such a system, the electrical potential drops linearly. This idea has been adapted to ring-based conductive filmsĀ [21]. The following summary of the idea basically follows this articleĀ [21].
Let us consider an insulating film of size . Equally-sized conductive rings are randomly deposited onto this film. Since the system is supposed to be dense, almost all the rings belong to the giant component, i.e., they are involved in the electrical conductivity. A potential difference, , is applied to the opposite borders of the film (figureĀ 6). Due to the linear potential drop along the system, the equipotential (isopotential) is a straight line.
Potential difference between two intersection points (junctions), which are the ends of the arc (figureĀ 6), is proportional to the length of the vertical projection of the chord.
[TABLE]
The electrical conductivity of an arc is inversely proportional to its length, ,
[TABLE]
where is the conductivity of the wire. The electrical current through this arc is
[TABLE]
The total electrical current through the film is equal to
[TABLE]
where the summation extends over the all arcs intersecting an equipotential. The film resistance is
[TABLE]
Since we are considering a square sample, this quantity is the same as the sheet resistance. All orientations of the arcs are assumed to be equiprobable.
The sample mean
[TABLE]
is supposed to be close to the expected value
[TABLE]
where is the PDF of the arc size, , when the number density of the rings is equal to . Moving from summation to integration, we have
[TABLE]
where is the central angle, which is subtending by this arc. Since arc length is equal to , while the chord length is
[TABLE]
When the distance between the ring center and an equipotential (figureĀ 6) does not exceed , the equipotential intersects this arc. On average, each equipotential intersects each of rings twice.
Thus, in order to estimate the electrical conductance of the sample, the integralĀ (17) should be calculated and the number of intersections of each equipotential with different arcs, , should be found.
Using the PDF for large and dense systemsĀ (14),
[TABLE]
Since the PDF decreases rapidly, we have changed the upper limit of the integral (). The plot of this PDF is indistinguishable from the plot of the PDF fromĀ (15) even for (figureĀ 7).
Now, we turn to the number of different arcs intersected by an equipotential, . Consider an arbitrary straight line intersecting an arc of radius . Let the intersection points be and . The middle of the chord is denoted as (figureĀ 8()). Point uniquely defines a straight line, except for the case when is the center of this circle. When point is located within the double hatched area, the chord twice intersects the arc subtending the central angle . When point is located within the hatched area, the chord intersects this arc only once. When point is located within the empty area, the chord cannot intersect this arc.
Let the distance between point and the circle center be . The probability of finding point within the double hatched region is equal to the ratio of the length of an arc with radius , completely located within the double hatched region (), to the total circumference ()
[TABLE]
Let the origin of a coordinate system coincide with the circle center, while the abscissa goes through the ābeakā of the double hatched area (figureĀ 8()). Then, the coordinates of the ābeakā are
[TABLE]
The polar equations of the circles of radii that bound the double hatched region, in the polar coordinate system are
[TABLE]
or
[TABLE]
Thus,
[TABLE]
The probability, that the chord twice intersects the arc, is
[TABLE]
The probability, that the chord intersects the arc only once, is
[TABLE]
Finally, the probability, that a straight line that intersects an arc, intersects this arc exactly twice is equal to the ratio of the probability, that this straight line intersects the arc twice, to the probability, that this line intersects the arc any number of times,
[TABLE]
Thus, the fraction of arcs that are twice intersected by an equipotential,
[TABLE]
is very small, i.e., with high precision, the number of different arcs intersected by an equipotential is equal to double the number of intersected circles, i.e.,
[TABLE]
In such a way, for large values of the number density, , the sheet resistance of the ring-based conductive film is equal to
[TABLE]
This is exactly the same formula that was obtained previously using numerical estimations of arc length distributionsĀ [21].
5 Conclusion
We considered the distribution of arc sizes in a system of equal-sized rings, , the centers of which are i.i.d. within a square domain of size with PBCs (). For an arbitrary number of rings, , and domain size, , we derived the PDFĀ (14). When , the PDF reduces toĀ (15). When the number density is large (), additional simplification is possible, which leads toĀ (16). The latter PDF was used to estimate the sheet resistance of ring-based conductive films. This estimation was based on the assumption that the potential drop along a homogeneous dense random system is expected to be linearĀ [23, 24, 21]. Equation (16) allowed us to draw the conclusion that, in such the systems, the ratio of the arc length to the chord length is close to unity since almost all the arcs are short. Moreover, the probability, that a straight line intersects the same arc twice, is negligible for the same reason.
The consideration of rings with a given distribution of radius sizes looks like a promising future direction since, in real world systems, size dispersity of rings is observedĀ [21].
Appendix A PDF of large and dense systems
Expected number of intersections of a circle with other circles is , hence, any circle in average is divided into arcs. Expected value of the central angle subtended by the arc is
[TABLE]
The number of arcs per unit area is . Note that
[TABLE]
and
[TABLE]
Let the random variable be the central angle corresponding to an arc at which a point, randomly thrown on a random circle, falls. Its PDF is
[TABLE]
Expected angle
[TABLE]
can be calculated without a knowledge of the explicit kind of the PDF (seeĀ (18)). Hence,
[TABLE]
We define arcs corresponding to central angles as -arcs. Let be the average number of -rcs per unit area. We define all arcs belonging to initially deposited circles as old arcs. Let rings per unit area are added to the . Note that
[TABLE]
[TABLE]
[TABLE]
Variation of the number of -arcs per unit area when the number of arcs per unit area changes by value is
[TABLE]
Let
- ā¢
be the average number of -arcs per unit area belonging to newly added circles.
- ā¢
be the average number of -arcs per unit area arising due to intersections of old arcs with newly added circles.
- ā¢
be the average number of -arcs per unit area destroyed due to intersections of old arcs with newly added circles.
Obviously, that the equality
[TABLE]
is valid.
[TABLE]
[TABLE]
Therefore,
[TABLE]
Omitting terms with ,
[TABLE]
[TABLE]
SubstitutingĀ (21), (23), (24), and (25) intoĀ (22),
[TABLE]
Dividing by ,
[TABLE]
Finally,
[TABLE]
In the solution ofĀ (26)
[TABLE]
the constant depends on a way of normalization. Since, in dense systems, the fraction of long arcs is negligible,
[TABLE]
then , In this case, the PDF is
[TABLE]
or
[TABLE]
i.e., .
We would like to acknowledge funding from the Ministry of Science and Higher Education of the Russian Federation, Project No.Ā 3.959.2017/4.6.
References
- [1]
Dvoretzky A 1956 PNAS 42 199ā203 ISSN 0027-8424
- [2]
Shepp LĀ A 1972 Isr. J. Math. 11 328ā345 ISSN 1565-8511
- [3]
Flatto L 1973 Isr. J. Math. 15 167ā184 ISSN 1565-8511
- [4]
Solomon H 1978 Geometric Probability (Philadelphia: Society for Industrial and Applied Mathematics) ISBN 978-0-89871-025-0
- [5]
Holst L 1980 J. Appl. Probab. 17 284ā290 ISSN 00219002
- [6]
Siegel AĀ F and Holst L 1982 J. Appl. Probab. 19 373ā381 ISSN 00219002
- [7]
Hall P 1984 Stoch. Process. Their Appl. 18 239ā261 ISSN 0304-4149
- [8]
Holst L 1984 J. Sov. Math. 25 1231ā1233 ISSN 1573-8795
- [9]
Holst L and Hüsler J 1984 J. Appl. Probab. 21 558ā566 ISSN 00219002
- [10]
Huffer FĀ W and Shepp LĀ A 1987 J. Appl. Probab. 24 422ā429 ISSN 00219002
- [11]
Huillet T 2003 J. Phys. A: Math. Gen. 36 12143ā12155 ISSN 0305-4470
- [12]
Huillet T 2003 Adv. Appl. Probab. 35 563ā582 ISSN 0001-8678
- [13]
Durand A 2010 On Randomly Placed Arcs on the Circle (Boston: BirkhƤuser Boston) pp 343ā351 ISBN 978-0-8176-4888-6
- [14]
Yadin M and Zacks S 1982 J. Appl. Probab. 19 562ā577 ISSN 00219002
- [15]
Moriarty J, Marchesi JĀ R and Metcalfe A 2007 BMC Bioinformatics 8 70 ISSN 1471-2105
- [16]
Wang B 2011 ACM Comput. Surv. 43 32 ISSN 0360-0300
- [17]
Jhuang Y, Lin T, Nguyen TĀ D, Chu S, Liu B and Pham V 2017 A new overlap circle technique for reducing data aggregation time in wireless sensor networks 2017 International Conference on System Science and Engineering (ICSSE) pp 546ā549 ISSN 2325-0925
- [18]
Layani M, Gruchko M, Milo O, Balberg I, Azulay D and Magdassi S 2009 ACS Nano 3 3537ā3542 ISSN 1936-0851
- [19]
Shimoni A, Azoubel S and Magdassi S 2014 Nanoscale 6 11084ā11089 ISSN 2040-3372
- [20]
Azani MĀ R and Hassanpour A 2018 Chem. Eur. J. 24 19195ā19199 ISSN 0947-6539
- [21]
Azani MĀ R, Hassanpour A, Tarasevich YĀ Y, Vodolazskaya IĀ V and Eserkepov AĀ V 2019 J. Appl. Phys. 125 234903 ISSN 0021-8979
- [22]
Mertens S and Moore C 2012 Phys. Rev. E 86(6) 061109 ISSN 2470-0045
- [23]
Kumar A and Kulkarni GĀ U 2016 J. Appl. Phys. 119 015102 ISSN 0021-8979
- [24]
Kumar A, Vidhyadhiraja NĀ S and Kulkarni GĀ U 2017 J. Appl. Phys. 122 045101 ISSN 0021-8979
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Dvoretzky A 1956 PNAS 42 199ā203 ISSN 0027-8424
- 2[2] Shepp L A 1972 Isr. J. Math. 11 328ā345 ISSN 1565-8511
- 3[3] Flatto L 1973 Isr. J. Math. 15 167ā184 ISSN 1565-8511
- 4[4] Solomon H 1978 Geometric Probability (Philadelphia: Society for Industrial and Applied Mathematics) ISBN 978-0-89871-025-0
- 5[5] Holst L 1980 J. Appl. Probab. 17 284ā290 ISSN 00219002
- 6[6] Siegel A F and Holst L 1982 J. Appl. Probab. 19 373ā381 ISSN 00219002
- 7[7] Hall P 1984 Stoch. Process. Their Appl. 18 239ā261 ISSN 0304-4149
- 8[8] Holst L 1984 J. Sov. Math. 25 1231ā1233 ISSN 1573-8795
