• Login
    View Item 
    •   Home
    • University Colleges
    • SUNY Brockport
    • Faculty/Staff Publications
    • Mathematics Faculty Publications
    • View Item
    •   Home
    • University Colleges
    • SUNY Brockport
    • Faculty/Staff Publications
    • Mathematics Faculty Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of SUNY Open Access RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsDepartmentThis CollectionPublication DateAuthorsTitlesSubjectsDepartmentAuthor ProfilesView

    My Account

    LoginRegister

    Campus Communities in SOAR

    Alfred State CollegeBrockportBroomeCantonDownstateEmpireFredoniaMaritimeNew PaltzOneontaOptometryOswegoPlattsburghSUNY Polytechnic InstituteSUNY Office of Community Colleges and the Education PipelineSUNY PressUpstate Medical

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Graph-Based Upper Bounds for the Probability of the Union of Events

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    mth_facpub/8/fulltext (1).pdf
    Size:
    127.1Kb
    Format:
    PDF
    Download
    Average rating
     
       votes
    Cast your vote
    You can rate an item by clicking the amount of stars they wish to award to this item. When enough users have cast their vote on this item, the average rating will also be shown.
    Star rating
     
    Your vote was cast
    Thank you for your feedback
    Author
    Veneziani, Pierangela
    Journal title
    Electronic Journal of Combinatorics
    Date Published
    2008-02-01
    Publication Volume
    15
    Publication Issue
    1
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/20.500.12648/2611
    Abstract
    We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic feasible solutions. The new upper bounds are based on underlying bipartite and threshold type graph structures.
    Citation
    Veneziani, P. (2008). Graph-Based Upper Bounds for the Probability of the Union of Events. Electronic Journal of Combinatorics, 15(1R), 1-11.
    Description
    First published in Electronic Journal of Combinatorics in 2008, published by the American Mathematical Society
    Collections
    Mathematics Faculty Publications

    entitlement

     

    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.