Abstract
We study a family of interval catch digraph called proportional-edge proximity catch digraph (PCD) which is also a special type of intersection digraphs parameterized with an expansion and a centrality parameter. PCDs are random catch digraphs that have been developed recently and have applications in classification and spatial pattern analysis. We investigate a graph invariant of the PCDs called relative arc density. We demonstrate that relative arc density of PCDs is a U-statistic and using the central limit theory of U-statistics, we derive the (asymptotic) distribution of the relative arc density of proportional-edge PCD for uniform data in one dimension. We also determine the parameters for which the rate of convergence to asymptotic normality is fastest.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.