Network reliability: Heading out on the highway
A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as...
Gespeichert in:
| Veröffentlicht in: | Networks 2021-01, Vol.77 (1), p.146-160 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 160 |
|---|---|
| container_issue | 1 |
| container_start_page | 146 |
| container_title | Networks |
| container_volume | 77 |
| creator | Brown, Jason I. Colbourn, Charles J. Cox, Danielle Graves, Christina Mol, Lucas |
| description | A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory, real and complex analysis, algebraic topology, commutative algebra, the design and analysis of algorithms, and computational complexity. In this paper we describe the landscape of various notions of network reliability, the roads well traveled, and some that appear likely to lead to meaningful and important journeys. |
| doi_str_mv | 10.1002/net.21977 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2469250133</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2469250133</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2977-5cb521bf12c954208f13f6566cf6b436d3a956da3141225806d3b05aeb5c8a1f3</originalsourceid><addsrcrecordid>eNp1kLFOwzAQhi0EEqEw8AaRmBjS3Nmxk7ChqqVIVVnKbDmp3biEpDiporw9hrAynXT3_fdLHyH3CHMEoHGj-znFPE0vSICQpxEASy9J4G9ZxCDh1-Sm644AiByzgMRb3Q-t-widrq0qbG378Slca7W3zSFsz33YNmFf6bCyh2pQ4y25Mqru9N3fnJH31XK3WEebt5fXxfMmKqkvj3hZcIqFQVrmPKGQGWRGcCFKI4qEiT1TORd7xTBBSnkGflMAV7rgZabQsBl5mP6eXPt11l0vj-3ZNb5S0kTklAMy5qnHiSpd23VOG3ly9lO5USLIHx_S-5C_PjwbT-xgaz3-D8rtcjclvgHnLV99</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2469250133</pqid></control><display><type>article</type><title>Network reliability: Heading out on the highway</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Brown, Jason I. ; Colbourn, Charles J. ; Cox, Danielle ; Graves, Christina ; Mol, Lucas</creator><creatorcontrib>Brown, Jason I. ; Colbourn, Charles J. ; Cox, Danielle ; Graves, Christina ; Mol, Lucas</creatorcontrib><description>A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory, real and complex analysis, algebraic topology, commutative algebra, the design and analysis of algorithms, and computational complexity. In this paper we describe the landscape of various notions of network reliability, the roads well traveled, and some that appear likely to lead to meaningful and important journeys.</description><identifier>ISSN: 0028-3045</identifier><identifier>EISSN: 1097-0037</identifier><identifier>DOI: 10.1002/net.21977</identifier><language>eng</language><publisher>Hoboken, USA: John Wiley & Sons, Inc</publisher><subject>Algorithms ; Applications of mathematics ; coherent system ; Combinatorial analysis ; Complexity ; Design analysis ; digraph ; Enumeration ; fixed point ; graph ; Graph theory ; inflection point ; Logistics ; matroid ; network ; Network reliability ; optimal graph ; Optimization ; Probability theory ; reliability ; reliability polynomial ; root ; Statistical analysis ; System reliability ; Topology</subject><ispartof>Networks, 2021-01, Vol.77 (1), p.146-160</ispartof><rights>2020 Wiley Periodicals LLC.</rights><rights>2021 Wiley Periodicals LLC.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2977-5cb521bf12c954208f13f6566cf6b436d3a956da3141225806d3b05aeb5c8a1f3</citedby><cites>FETCH-LOGICAL-c2977-5cb521bf12c954208f13f6566cf6b436d3a956da3141225806d3b05aeb5c8a1f3</cites><orcidid>0000-0001-9794-7310 ; 0000-0002-4721-8985 ; 0000-0002-4295-0632</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnet.21977$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnet.21977$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1416,27923,27924,45573,45574</link.rule.ids></links><search><creatorcontrib>Brown, Jason I.</creatorcontrib><creatorcontrib>Colbourn, Charles J.</creatorcontrib><creatorcontrib>Cox, Danielle</creatorcontrib><creatorcontrib>Graves, Christina</creatorcontrib><creatorcontrib>Mol, Lucas</creatorcontrib><title>Network reliability: Heading out on the highway</title><title>Networks</title><description>A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory, real and complex analysis, algebraic topology, commutative algebra, the design and analysis of algorithms, and computational complexity. In this paper we describe the landscape of various notions of network reliability, the roads well traveled, and some that appear likely to lead to meaningful and important journeys.</description><subject>Algorithms</subject><subject>Applications of mathematics</subject><subject>coherent system</subject><subject>Combinatorial analysis</subject><subject>Complexity</subject><subject>Design analysis</subject><subject>digraph</subject><subject>Enumeration</subject><subject>fixed point</subject><subject>graph</subject><subject>Graph theory</subject><subject>inflection point</subject><subject>Logistics</subject><subject>matroid</subject><subject>network</subject><subject>Network reliability</subject><subject>optimal graph</subject><subject>Optimization</subject><subject>Probability theory</subject><subject>reliability</subject><subject>reliability polynomial</subject><subject>root</subject><subject>Statistical analysis</subject><subject>System reliability</subject><subject>Topology</subject><issn>0028-3045</issn><issn>1097-0037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp1kLFOwzAQhi0EEqEw8AaRmBjS3Nmxk7ChqqVIVVnKbDmp3biEpDiporw9hrAynXT3_fdLHyH3CHMEoHGj-znFPE0vSICQpxEASy9J4G9ZxCDh1-Sm644AiByzgMRb3Q-t-widrq0qbG378Slca7W3zSFsz33YNmFf6bCyh2pQ4y25Mqru9N3fnJH31XK3WEebt5fXxfMmKqkvj3hZcIqFQVrmPKGQGWRGcCFKI4qEiT1TORd7xTBBSnkGflMAV7rgZabQsBl5mP6eXPt11l0vj-3ZNb5S0kTklAMy5qnHiSpd23VOG3ly9lO5USLIHx_S-5C_PjwbT-xgaz3-D8rtcjclvgHnLV99</recordid><startdate>202101</startdate><enddate>202101</enddate><creator>Brown, Jason I.</creator><creator>Colbourn, Charles J.</creator><creator>Cox, Danielle</creator><creator>Graves, Christina</creator><creator>Mol, Lucas</creator><general>John Wiley & Sons, Inc</general><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-9794-7310</orcidid><orcidid>https://orcid.org/0000-0002-4721-8985</orcidid><orcidid>https://orcid.org/0000-0002-4295-0632</orcidid></search><sort><creationdate>202101</creationdate><title>Network reliability: Heading out on the highway</title><author>Brown, Jason I. ; Colbourn, Charles J. ; Cox, Danielle ; Graves, Christina ; Mol, Lucas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2977-5cb521bf12c954208f13f6566cf6b436d3a956da3141225806d3b05aeb5c8a1f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Applications of mathematics</topic><topic>coherent system</topic><topic>Combinatorial analysis</topic><topic>Complexity</topic><topic>Design analysis</topic><topic>digraph</topic><topic>Enumeration</topic><topic>fixed point</topic><topic>graph</topic><topic>Graph theory</topic><topic>inflection point</topic><topic>Logistics</topic><topic>matroid</topic><topic>network</topic><topic>Network reliability</topic><topic>optimal graph</topic><topic>Optimization</topic><topic>Probability theory</topic><topic>reliability</topic><topic>reliability polynomial</topic><topic>root</topic><topic>Statistical analysis</topic><topic>System reliability</topic><topic>Topology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brown, Jason I.</creatorcontrib><creatorcontrib>Colbourn, Charles J.</creatorcontrib><creatorcontrib>Cox, Danielle</creatorcontrib><creatorcontrib>Graves, Christina</creatorcontrib><creatorcontrib>Mol, Lucas</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brown, Jason I.</au><au>Colbourn, Charles J.</au><au>Cox, Danielle</au><au>Graves, Christina</au><au>Mol, Lucas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Network reliability: Heading out on the highway</atitle><jtitle>Networks</jtitle><date>2021-01</date><risdate>2021</risdate><volume>77</volume><issue>1</issue><spage>146</spage><epage>160</epage><pages>146-160</pages><issn>0028-3045</issn><eissn>1097-0037</eissn><abstract>A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory, real and complex analysis, algebraic topology, commutative algebra, the design and analysis of algorithms, and computational complexity. In this paper we describe the landscape of various notions of network reliability, the roads well traveled, and some that appear likely to lead to meaningful and important journeys.</abstract><cop>Hoboken, USA</cop><pub>John Wiley & Sons, Inc</pub><doi>10.1002/net.21977</doi><tpages>29</tpages><orcidid>https://orcid.org/0000-0001-9794-7310</orcidid><orcidid>https://orcid.org/0000-0002-4721-8985</orcidid><orcidid>https://orcid.org/0000-0002-4295-0632</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0028-3045 |
| ispartof | Networks, 2021-01, Vol.77 (1), p.146-160 |
| issn | 0028-3045 1097-0037 |
| language | eng |
| recordid | cdi_proquest_journals_2469250133 |
| source | Wiley Online Library Journals Frontfile Complete |
| subjects | Algorithms Applications of mathematics coherent system Combinatorial analysis Complexity Design analysis digraph Enumeration fixed point graph Graph theory inflection point Logistics matroid network Network reliability optimal graph Optimization Probability theory reliability reliability polynomial root Statistical analysis System reliability Topology |
| title | Network reliability: Heading out on the highway |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T23%3A34%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Network%20reliability:%20Heading%20out%20on%20the%20highway&rft.jtitle=Networks&rft.au=Brown,%20Jason%20I.&rft.date=2021-01&rft.volume=77&rft.issue=1&rft.spage=146&rft.epage=160&rft.pages=146-160&rft.issn=0028-3045&rft.eissn=1097-0037&rft_id=info:doi/10.1002/net.21977&rft_dat=%3Cproquest_cross%3E2469250133%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2469250133&rft_id=info:pmid/&rfr_iscdi=true |