IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v54y2010i7p1777-1790.html
   My bibliography  Save this article

Statistical inference on attributed random graphs: Fusion of graph features and content

Author

Listed:
  • Grothendieck, John
  • Priebe, Carey E.
  • Gorin, Allen L.

Abstract

Many problems can be cast as statistical inference on an attributed random graph. Our motivation is change detection in communication graphs. We prove that tests based on a fusion of graph-derived and content-derived metadata can be more powerful than those based on graph or content features alone. For some basic attributed random graph models, we derive fusion tests from the likelihood ratio. We describe the regions in parameter space where the fusion improves power, using both numeric results from selected small examples and analytic results on asymptotically large graphs.

Suggested Citation

  • Grothendieck, John & Priebe, Carey E. & Gorin, Allen L., 2010. "Statistical inference on attributed random graphs: Fusion of graph features and content," Computational Statistics & Data Analysis, Elsevier, vol. 54(7), pages 1777-1790, July.
    • Handle: RePEc:eee:csdana:v:54:y:2010:i:7:p:1777-1790
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-9473(10)00032-0
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Carey E. Priebe & John M. Conroy & David J. Marchette & Youngser Park, 2005. "Scan Statistics on Enron Graphs," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 229-247, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. N. Lee & C. Priebe, 2011. "A latent process model for time series of attributed random graphs," Statistical Inference for Stochastic Processes, Springer, vol. 14(3), pages 231-253, October.
    2. Priebe, Carey E. & Park, Youngser & Marchette, David J. & Conroy, John M. & Grothendieck, John & Gorin, Allen L., 2010. "Statistical inference on attributed random graphs: Fusion of graph features and content: An experiment on time series of Enron graphs," Computational Statistics & Data Analysis, Elsevier, vol. 54(7), pages 1766-1776, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jana Diesner & Terrill L. Frantz & Kathleen M. Carley, 2005. "Communication Networks from the Enron Email Corpus “It's Always About the People. Enron is no Different”," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 201-228, October.
    2. Ze Li & Duoyong Sun & Renqi Zhu & Zihan Lin, 2017. "Detecting event-related changes in organizational networks using optimized neural network models," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-21, November.
    3. Ramin Moghaddass & Yongtao Guan, 2022. "Optimal Frameworks for Detecting Anomalies in Sensor-Intensive Heterogeneous Networks," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2583-2610, September.
    4. N. Lee & C. Priebe, 2011. "A latent process model for time series of attributed random graphs," Statistical Inference for Stochastic Processes, Springer, vol. 14(3), pages 231-253, October.
    5. Anurat Chapanond & Mukkai S. Krishnamoorthy & Bülent Yener, 2005. "Graph Theoretic and Spectral Analysis of Enron Email Data," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 265-281, October.
    6. Joseph Crawford & Tijana Milenković, 2018. "ClueNet: Clustering a temporal network based on topological similarity rather than denseness," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-25, May.
    7. Priebe, Carey E. & Park, Youngser & Marchette, David J. & Conroy, John M. & Grothendieck, John & Gorin, Allen L., 2010. "Statistical inference on attributed random graphs: Fusion of graph features and content: An experiment on time series of Enron graphs," Computational Statistics & Data Analysis, Elsevier, vol. 54(7), pages 1766-1776, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:54:y:2010:i:7:p:1777-1790. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.