Network theory in risk assessment

<h2 id="risk-assessment-key-components">Risk assessment key components</h2>
Main article: <a href="/facts/Risk_assessment/vlG9Uf0h">Risk assessment</a>

Risk assessment is a method for dealing with uncertainty. For it to be beneficial to the overall risk management and decision making process, it must be able to capture extreme and catastrophic events. Risk assessment involves two parts: risk analysis and risk evaluation, although the term “risk assessment” can be seen used indistinguishable with “risk analysis”. In general, risk assessment can be divided into these steps:<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>

<ol><li>Plan and prepare the risk analysis.</li>
<li>Define and delimit the system and the scope of the analysis.</li>
<li>Identify hazards and potential hazardous events.</li>
<li>Determine causes and frequency of each hazardous event.</li>
<li>Identify accident scenarios (i.e. even sequences) that may be initiated by each hazardous event.</li>
<li>Select relevant and typical accident scenarios. </li>
<li>Determine the consequences of each accident scenario.</li>
<li>Determine the frequency of each accident scenario.</li>
<li>Assess the uncertainty.</li>
<li>Establish and describe the risk picture.</li>
<li>Report the analysis.</li>
<li>Evaluate the risk against risk acceptance criteria</li>
<li>Suggest and evaluate potential risk-reducing measures.</li></ol>
Naturally, the number of steps required varies with each assessment. It depends on the scope of the analysis and the complexity of the study object.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> Because these is always varies degrees of uncertainty involved in any risk analysis process, sensitivity and uncertainty analysis are usually carried out to mitigate the level of uncertainty and therefore improve the overall risk assessment result.

<h2 id="network-theory-key-components">Network theory key components</h2>
Main article: <a href="/facts/Network_theory/m6CQovwm">Network theory</a>
A network is a simplified representation that reduces a system to an abstract structure. Simply put, it is a collection of points linked together by lines. Each point is known as a “<a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertex</a>” (multiple: “vertices”) or “nodes”, and each line as “edges” or “links”.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> Network modeling and studying have already been applied in many areas, including computer, physical, biological, ecological, logistical and social science. Through the studying of these models, we gain insights into the nature of individual components (i.e. vertices), connections or interactions between those components (i.e. edges), as well as the pattern of connections (i.e. network).
Undoubtedly, modifications of the structure (or pattern) of any given network can have a big effect on the behavior of the system it depicts. For example, connections in a social network affect how people communicate, exchange news, travel, and, less obviously, spread diseases. In order to gain better understanding of how each of these systems functions, some knowledge of the structure of the network is necessary.

<h3>Basic terminology</h3>
Small-World Effect Further information: <a href="/facts/Small-world_network/dALPpt9m">Small-world network</a>
The small-world effect is one of the most remarkable network phenomena. It describes a finding that in many (perhaps most) networks the mean path distances between vertices are surprisingly small.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a> It has many implications in various areas of network studies. For instance, in <a href="/facts/Social_network/kQg6aEVf">social network</a>, one can ruminate how fast a rumor (or a contagious disease) is spread in a community. From a mathematical point of view, since path lengths in networks are typically scale as log n (where n = number of network vertices), it is only logical it remains a small number even with large complex networks.
Another idea comes along with the <a href="/facts/Small_world_effect/5ksGm26o">small-world effect</a> is called funneling.<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> It was derived from a <a href="/facts/Small_world_experiment/5ksGm26o">social network experiment</a> conducted by the experimental psychologist <a href="/facts/Stanley_Milgram/F2dcafH0">Stanley Milgram</a> in the 1960s. In that experiment he concluded, along with the <a href="/facts/Small_world_effect/5ksGm26o">small-world effect</a> phenomenon, that in any given social network, there were always few that were especially well connected. These few individuals were therefore responsible for the connection between any members and the rest of the world.
Degree, Hubs, and Paths

Degree of a vertex is the number of edges connected to it. For example, on Figure 4, vertex 3 has a degree of five. Hubs are vertices in a network with a relatively higher degree. Vertex 3 again is a good example. In a social network, hubs can mean individuals with many acquaintances. In risk assessment, it can mean a hazardous event with multiple triggers (or the causal part of a bow-tie diagram). A path in a network is a route between a vertex and another across the network. From the same figure, an example of a path from vertex 1 to 6 can be 1→5→3→6.

Centrality

<a href="/facts/Centrality/4n24KqLt">Centrality</a> is a measure of how important (or central) certain vertices are in a network. It can be measured by counting the number of edges connected to it (i.e its degree). The vertices with the highest degree therefore have a high degree centrality.
<a href="/facts/Centrality/4n24KqLt">Degree centrality</a> can have many implications. In a social network, a person with high degree centrality may have more influence over others, more access to information, or more opportunities than those with fewer connections. In a citation network, a paper with high degree centrality may suggest it is more influential and thus has a greater impact on its respective area of research.<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a>

<a href="/facts/Eigenvector_centrality/VNWYSNEc">Eigenvector centrality</a> is an extension of the concept of degree centrality, based on the fact that in many networks not all vertices have the same weight or importance. A vertex's importance in its network increases if it has more connections to important vertices. <a href="/facts/Eigenvector_centrality/VNWYSNEc">Eigenvector centrality</a>, therefore, can be view as a centrality scoring system for not just one but its neighboring vertices as well.
Components

Subgroups, or subsets of vertices, in a disconnected network. Disconnected network means in such network, there is at least a pair of vertices that no path connecting between them at all. Vice verse is known as a connected network, where all vertices within are connected by at least one path. One can therefore say a connected network has only one component.
Directed Networks

Main article: <a href="/facts/Directed_graph/YBdfQ0um">Directed graph</a>
Networks of which each edge has a direction from one vertex to another. The edges are therefore known as directed edges. Example of such network include a link from the reference section on this page which will leads you to another, but not the other way around. In terms of food web, a prey eaten by a predator is another example.
Directed networks can be cyclic or acyclic. A cyclic directed network is one with a closed loop of edges. An acyclic directed network does not contain such loop. Since a self-edge – an edge connecting a vertex to itself – is considered a cycle, it is therefore absent from any acyclic network.
A <a href="/facts/Bayesian_network/Ry31vq6T">Bayesian network</a> is an example of an acyclic directed network.
Weighted Network

Main article: <a href="/facts/Weighted_network/SwCU0DQ9">weighted network</a>
In reality, not all edges shares the same importance or weight (connections in a social network and keystone species in a food web, for example). A weighted network adds such element to its connections. It is widely used in genomic and systems biologic applications.
Trees

Undirected networks with no closed loops. A tree can be part of a network but isolated as a separate component. If all parts of a network are trees, such network is called a forest. An administrative body can sometime be viewed as a forest.
<h2 id="other-examples-of-network-theory-application">Other Examples of Network Theory Application</h2>
<h3>Social network</h3>
Main article: <a href="/facts/Social_Network/kQg6aEVf">Social Network</a>
Early social network studies can be traced back to the end of the nineteenth century. However well-documented studies and foundation of this field are usually attributed to a psychiatrist named Jacob Moreno. He published a book entitled Who Whall Survive? in 1934 which laid out the foundation for sociometry (later known as social network analysis).
Another famous contributor to the early development of social network analysis is a perimental psychologist known as <a href="/facts/Stanley_Milgram/F2dcafH0">Stanley Milgram</a>. His <a href="/facts/Small_world_experiment/5ksGm26o">"small-world" experiments</a> gave rise to concepts such as <a href="/facts/Six_degrees_of_separation/7WgNIXsJ">six degrees of separation</a> and well-connected acquaintances (also known as "sociometric superstars"). This experiment was recently repeated by Dodds et al. by means of email messages, and the basic results were similar to Milgram's. The estimated true average path length (that is, the number of edges the email message has to pass from one unique individual to the intended targets in different countries) for the experiment was around five to seven, which is not much deviated from the original six degree of separation.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a>

<h3>Food web</h3>

See also: <a href="/facts/Ecological_network/0UasEblS">ecological network</a>
A <a href="/facts/Food_web/YaakLo08">food web</a>, or <a href="/facts/Food_chain/mvDKQTGu">food chain</a>, is an example of directed network which describes the prey-predator relationship in a given ecosystem. Vertices in this type of network represent species, and the edges the prey-predator relationship. A collection of species may be represented by a single vertex if all members in that collection prey upon and are preyed on by the same organisms. A food web is often acyclic, with few exceptions such as adults preys on juveniles and parasitism.<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a>

Note: In the <a href="/facts/Food_web/YaakLo08">food web</a> main article, a food web was depicted as cyclic. That is based on the flow of the carbon and energy sources in a given ecosystem. The food web described here based solely on prey-predator roles; Organisms active in the <a href="/facts/Carbon_cycle/gVusRaPF">carbon</a> and <a href="/facts/Nitrogen_cycle/0X1z74dN">nitrogen cycles</a> (such as decomposers and fixers) are not considered in this description.
<h3>Epidemiology</h3>

Main article: <a href="/facts/Epidemic_model/APq4DFha">epidemic model</a>
Further information: <a href="/facts/Compartmental_models_in_epidemiology/APq4DFha">compartmental models in epidemiology</a>
<a href="/facts/Epidemiology/wgTmxoMA">Epidemiology</a> is closely related to social network. Contagious diseases can spread through connection networks such as work space, transportation, intimate body contacts and water system (see Figure 7 and 9). Though it only exists virtually, a computer viruses spread across internet networks are not much different from their physical counterparts. Therefore, understanding each of these network patterns can no doubt aid us in more precise prediction of the outcomes of epidemics and preparing better disease prevention protocols.
The simplest model of infection is presented as a SI (susceptible - infected) model. Most diseases, however, do not behave in such simple manner. Therefore, many modifications to this model were made such as the SIR (susceptible – infected – recovered), the SIS (the second S denotes reinfection) and SIRS models. The idea of <a href="/facts/Latency_period/bYJKCJ68">latency</a> is taken into accounts in models such as SEIR (where E stands for exposed). The SIR model is also known as the Reed-Frost model.<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a>
To factor these into an outbreak network model, one must consider the degree distributions of vertices in the giant component of the network (outbreaks in small components are isolation and die out quickly, which does not allow the outbreaks to become epidemics). Theoretically, weighted network can provide more accurate information on exposure probability of vertices but more proofs are needed. Pastor-Satorras et al. pioneered much work in this area, which began with the simplest form (the SI model) and applied to networks drawn from the configuration model.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a>
The biology of how an infection causes disease in an individual is complicated and is another type of disease pattern specialists are interested in (a process known as <a href="/facts/Pathogenesis/o9kHHK0U">pathogenesis</a> which involves immunology of the host and <a href="/facts/Virulence_factor/jw099pff">virulence factors</a> of the pathogen).

<h2 id="notes">Notes</h2>

<ul><li>Dolgoarshinnykh, Regina. "Criticality in Epidemic Models". Columbia University, New York. <a href="http://www.stat.columbia.edu/~regina/research/risk.pdf">Criticality in Epidemic Models</a></li>
<li>Legrain, Amaury, and Tom Auwers. The Principal-agent Model and the Network Theory as Framework for Administrative Procedures: Social Security in Belgium. EGPA Conference "Public Manager under Pressure: between Politics, Professionalism and Civil Society" (2006): 1-40</li>
<li>Martinez, Neo, and Dunne, Jennifer. "Foodwebs.org". Pacific Ecoinformatics and Computational Ecology Lab., 2011. <a href="http://www.foodwebs.org">foodwebs.org</a></li>
<li>Meyers, Lauren A., M.E.J. Newman, and Stephanie Schrag. Applying Network Theory to Epidemics: Control Measures for Mycoplasma Pneumoniae Outbreaks. Emerging Infectious Diseases 9.2 (2003): 204-10</li>
<li>National Research Council (NRC). Risk Assessment in the Federal Government: Understanding the Process. Washington D.C.: National Academy Press, 1983.</li>
<li>National Research Council (NRC). Understanding Risk: Informing Decisions in a Democratic Society. Washington D.C.: National Academy Press, 1996.</li>
<li>Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0199206650 .</li>
<li>Pielke Jr., Roger A. Policy, Politics and Perspective. Nature 416 (2002): 367-68.</li>
<li>Rausand, Marvin. Risk Assessment: Theory, Methods, and Applications. Hoboken, NJ: John Wiley & Sons, 2011.</li>
<li>Rothman, Kenneth J., Sander Greenland, and Timothy L. Lash. Modern Epidemiology. 3rd ed. Philadelphia: Wolters Kluwer Health/Lippincott Williams & Wilkins, 2008.</li>
<li>Rowland, Todd and Weisstein, Eric W. "Causal Network." From MathWorld—A Wolfram Web Resource. <a href="http://mathworld.wolfram.com/CausalNetwork.html">Causal Network</a></li>
<li>Slovic, Paul. Perception of Risk. Science 236 (1987): 280-85.</li>
<li>Taleb, Nassim N. Errors, Robustness, and the Fourth Quadrant. International Journal of Forecasting 25.4 (2009): 744-59</li>
<li>Wolfram, Stephen. A New Kind of Science. Champaign, IL: Wolfram Media, 2002.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.2 <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">National Research Council (NRC). Red Book Paradigm. Risk Assessment in the Federal Government: Understanding the Process. Washington D.C.: National Academy Press, 1983. <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Pielke Jr., Roger A. Policy, Politics and Perspective. Nature 416 (2002): 367-68. <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Slovic, Paul. Perception of Risk. Science 236 (1987): 280-85. <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">National Research Council (NRC). Orange Book Paradigm. Understanding Risk: Informing Decisions in a Democratic Society. Washington D.C.: National Academy Press, 1996. <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Rausand, Marvin. Risk Assessment: Theory, Methods, and Applications. Hoboken, NJ: John Wiley & Sons, 2011. p.295. <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Rausand, Marvin. Risk Assessment: Theory, Methods, and Applications. Hoboken, NJ: John Wiley & Sons, 2011. p.266-302. <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Rausand, Marvin. "Chapter 5 Risk Management." Risk Assessment: Theory, Methods, and Applications. Hoboken, NJ: John Wiley & Sons, 2011. p.117-36. <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Rausand, Marvin. Risk Assessment: Theory, Methods, and Applications. Hoboken, NJ: John Wiley & Sons, 2011. p.124. <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.1 <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.241 <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.243 <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.168 <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.54-58 <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Newman, Mark E. J. “Chapter 5.3 Ecological Networks”. Networks: an Introduction. Oxford: Oxford UP, 2010. p.99-104 <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">http://www.stat.columbia.edu/~regina/research/risk.pdf [bare URL PDF] <a href="http://www.stat.columbia.edu/~regina/research/risk.pdf" target="_blank">http://www.stat.columbia.edu/~regina/research/risk.pdf</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Newman, Mark E. J. Networks: an Introduction. Oxford: Oxford UP, 2010. p.657-664 <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
</ol>

Network theory in risk assessment open-in-new

Network theory in risk assessment