Advanced Search
MyIDEAS: Login to save this article or follow this journal

On the distribution of the domination number for random class cover catch digraphs


Author Info

  • Priebe, Carey E.
  • DeVinney, Jason G.
  • Marchette, David J.
Registered author(s):


    In this article we initiate the study of class cover catch digraphs, a special case of intersection digraphs motivated by applications in machine learning and statistical pattern recognition. Our main result is the exact distribution of the domination number for a data-driven model of random interval catch digraphs.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Statistics & Probability Letters.

    Volume (Year): 55 (2001)
    Issue (Month): 3 (December)
    Pages: 239-246

    as in new window
    Handle: RePEc:eee:stapro:v:55:y:2001:i:3:p:239-246

    Contact details of provider:
    Web page:

    Order Information:

    Related research

    Keywords: Random graph Intersection digraph Domination number Distribution;


    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Elvan Ceyhan, 2012. "The distribution of the relative arc density of a family of interval catch digraph based on uniform data," Metrika, Springer, vol. 75(6), pages 761-793, August.
    2. Xiang, Pengfei & Wierman, John C., 2009. "A CLT for a one-dimensional class cover problem," Statistics & Probability Letters, Elsevier, vol. 79(2), pages 223-233, January.
    3. Ceyhan, Elvan & Priebe, Carey E. & Wierman, John C., 2006. "Relative density of the random r-factor proximity catch digraph for testing spatial patterns of segregation and association," Computational Statistics & Data Analysis, Elsevier, vol. 50(8), pages 1925-1964, April.
    4. Wierman, John C. & Xiang, Pengfei, 2008. "A general SLLN for the one-dimensional class cover problem," Statistics & Probability Letters, Elsevier, vol. 78(9), pages 1110-1118, July.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:55:y:2001:i:3:p:239-246. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.