Search
Exact matches only
Search in title
Search in content
Search in comments
Search in excerpt
Filter by Custom Post Type
{ "homeurl": "http://complexitylabs.io/", "resultstype": "isotopic", "resultsposition": "block", "itemscount": 4, "imagewidth": 70, "imageheight": 70, "resultitemheight": "70px", "showauthor": 0, "showdate": 0, "showdescription": 0, "charcount": 3, "noresultstext": "No results!", "didyoumeantext": "Did you mean:", "defaultImage": "http://solutionslab.io/academy/wp-content/uploads/sites/4/2016/10/Search-defualt.jpg", "highlight": 0, "highlightwholewords": 1, "openToBlank": 0, "scrollToResults": 0, "resultareaclickable": 1, "autocomplete": { "enabled": 1, "googleOnly": 1, "lang": "en", "mobile": 1 }, "triggerontype": 1, "triggeronclick": 1, "triggeronreturn": 1, "triggerOnFacetChange": 1, "trigger": { "delay": 300, "autocomplete_delay": 310 }, "overridewpdefault": 0, "override_method": "post", "redirectonclick": 0, "redirectClickTo": "results_page", "redirect_on_enter": 0, "redirectEnterTo": "results_page", "redirect_url": "?s={phrase}", "settingsimagepos": "right", "settingsVisible": 0, "hresulthidedesc": "1", "prescontainerheight": "400px", "pshowsubtitle": "0", "pshowdesc": "1", "closeOnDocClick": 1, "iifNoImage": "description", "iiRows": 2, "iiGutter": 5, "iitemsWidth": 200, "iitemsHeight": 200, "iishowOverlay": 1, "iiblurOverlay": 1, "iihideContent": 1, "loaderLocation": "auto", "analytics": 0, "analyticsString": "", "show_more": { "url": "?s={phrase}", "action": "ajax" }, "mobile": { "trigger_on_type": 1, "trigger_on_click": 1, "hide_keyboard": 0, "force_res_hover": 0, "force_sett_hover": 0, "force_sett_state": "closed" }, "compact": { "enabled": 0, "width": "100%", "closeOnMagnifier": 1, "closeOnDocument": 0, "position": "static", "overlay": 0 }, "animations": { "pc": { "settings": { "anim" : "fadedrop", "dur" : 300 }, "results" : { "anim" : "fadedrop", "dur" : 300 }, "items" : "fadeInDown" }, "mob": { "settings": { "anim" : "fadedrop", "dur" : 300 }, "results" : { "anim" : "fadedrop", "dur" : 300 }, "items" : "voidanim" } }, "autop": { "state": "disabled", "phrase": "", "count": 10 }, "fss_layout": "column" }

Degree of Connectivity

A node's degree of connectivity is a primary metric to its significance within a network

A node’s degree of connectivity is a primary metric to its significance within a network

The degree of connectivity to a node in a network is a measure of the number of in and out links the node has to other nodes. This degree of connectivity can be interpreted in terms of the immediate likelihood of a node catching whatever is flowing through the network.1 For example, the higher one’s degree of connectivity within a given social network the more likely you are to hear about some piece of news that is being shared, because you have many more channels through which to intercept it. Of course, this works both ways as it might not be news that is spreading on the network, but instead a virus.

Unweighted Network

If we are analyzing an undirected and unweighted network, a node’s degree of connectivity will then simply be a summation of all the links that the node has. If the graph is directed then we can refine our analysis by dividing this into a measure of the amount of in and out links. With an example of nations trading, the in-degree of any node would be the total number of import relations it has with other nations and the out-degree would be the total number of exporting relations it has. If this is a weighted graph, we can then, of course, refine our model further by placing quantitative values on each edge.

Adjacency Matrix

If an edge exists between node A and B, then we say they are adjacent. So if we take a map of a subway, we could say that each station or node is adjacent to any other station that is just one stop away from it. We can then capture all the relations within a network by creating an adjacency matrix. We can create a simple 2 by 2 matrix to capture the connections within a network by placing a 1 at the cross section between two nodes if they are adjacent and a 0 if not, with the end result being a table of all the connections within the system; this is how a graph is represented in computer code.

Path & Geodesic

Another thing we might be interested in is looking at how two nodes in a network are connected, that is to say, the channel or paths through a network from one node to another, and this is called a walk. A walk on a graph is a sequence of adjacent vertices where repetition is allowed. With a walk, we are simply going from one node to the next along a sequence of edges. A path is a walk without revisiting any nodes, that is a sequence of links from the first node to the last without repetition. As an example of why this might be of interest to us, we could cite the so-called traveling salesman problem, which involves a salesman that has to visit a number of different cities within a particular region. He, of course, wants to avoid walks where he will be retracing the same ground and try and find a path that will not involve any repetition of the cities he has to visit. The traveling salesman will also be interested in finding the shortest path between each place he has to visit. This shortest path between two nodes on a graph is called the geodesic, and it represents the fewest number of links we need to traverse in order to get from any given node to another.

Cite this article as: Joss Colchester, "Degree of Connectivity," in Complexity Labs, May 1, 2016, http://complexitylabs.io/network-connections/.
  1. View Source
2017-05-24T14:21:48+00:00