|
|
| Line 1: |
Line 1: |
| '''Average path length''' is a concept in [[network topology]] that is defined as the average number of steps along the shortest paths for all possible pairs of network [[Node (networking)|nodes]]. It is a measure of the efficiency of information or mass transport on a network. | | They contact me Emilia. For years I've been working as a payroll clerk. To gather cash is one of the issues I adore most. North Dakota is our birth location.<br><br>my blog post :: [http://www.neweracinema.com/tube/blog/181510 std testing at home] |
| | |
| __TOC__
| |
| | |
| ==Concept==
| |
| Average path length is one of the three most robust measures of network topology, along with its [[clustering coefficient]] and its [[degree distribution]]. Some examples are: the average number of clicks which will lead you from one website to another, or the number of people you will have to communicate through, on an average, to contact a complete stranger. It should not be confused with the [[diameter]] of the network, which is defined as the longest [[geodesic]], i.e., the longest [[shortest path]] between any two nodes in the network (see [[Distance (graph theory)]]).
| |
| | |
| The average path length distinguishes an easily negotiable network from one, which is complicated and inefficient, with a shorter average path length being more desirable. However, the average path length is simply what the path length will most likely be. The network itself might have some very remotely connected nodes and many nodes, which are neighbors of each other.
| |
| | |
| ==Definition==
| |
| Consider an unweighted [[Graph (mathematics)|graph]] <math>G</math> with the set of vertices <math>V</math>. Let <math>d(v_1, v_2)</math>, where <math>v_1, v_2 \in V</math> denote the shortest distance between <math>v_1</math> and <math>v_2</math>.
| |
| Assume that <math>d(v_1, v_2) = 0</math> if <math>v_2</math> cannot be reached from <math>v_1</math>. Then, the average path length <math>l_G</math> is:
| |
| | |
| <math>l_G = \frac{1}{n \cdot (n - 1)} \cdot \sum_{i \ne j} d(v_i, v_j)</math>
| |
| | |
| , where <math>n</math> is the number of vertices in <math>G</math>.
| |
| | |
| ==Applications==
| |
| In a real network like the [[World Wide Web]], a short average path length facilitates the quick transfer of information and reduces costs. The efficiency of mass transfer in a [[Metabolic network modelling|metabolic network]] can be judged by studying its average path length. A [[power grid]] network will have less losses if its average path length is minimized.
| |
| | |
| Most real networks have a very short average path length leading to the concept of a [[Watts and Strogatz model|small world]] where everyone is connected to everyone else through a very short path.
| |
| | |
| As a result, most models of real networks are created with this condition in mind. One of the first models which tried to explain real networks was the [[Erdős–Rényi model|random network model]]. It was later followed by the [[Watts and Strogatz model]], and even later there were the [[scale-free networks]] starting with the [[BA model]]. All these models had one thing in common: they all predicted very short average path length. The average path lengths of some networks are listed in Table.[1].<ref name=bara>Barabási, A.-L., and R. Albert, 2002, Rev. Mod. Phys. 74, 47.</ref> <br/>
| |
| <!-- Deleted image removed: [[Image:Comb0000.jpg|center|frame|]] -->
| |
| | |
| The average path length depends on the system size but does not change drastically with it. Small world network theory predicts that the average path length changes proportionally to log n, where n is the number of nodes in the network.
| |
| | |
| ==References==
| |
| <references/>
| |
| | |
| {{DEFAULTSORT:Average Path Length}}
| |
| [[Category:Network theory]]
| |
| [[Category:Graph invariants]]
| |
They contact me Emilia. For years I've been working as a payroll clerk. To gather cash is one of the issues I adore most. North Dakota is our birth location.
my blog post :: std testing at home