# Nm/118

## < Nm

31.200Seiten in
diesem Wiki
Investigative Data Mining: Mathematical Models for Analyzing, Visualizing and Destabilizing Terrorist Networks

von Prof. Dr. Nasrullah Memon

vorherige Seite | zur Übersichtsseite | folgende Seite
Statistik und Sichtungsnachweis dieser Seite findet sich am Artikelende
 Zuletzt bearbeitet: 2012-08-05 01:46:48 Hindemith BauernOpfer, Fragment, Gesichtet, Latora and Marchiori 2004, Nm, SMWFragment, Schutzlevel sysop

 Typus BauernOpfer Bearbeiter Graf Isolan Gesichtet
Untersuchte Arbeit:
Seite: 118, Zeilen: 8, 12-25
Quelle: Latora and Marchiori 2004
Seite(n): 70, Zeilen: 4, 9-10, 18-19, 23-24, 27-31
3.6.1 The Efficiency of a Network

[...] (Latora and Marchiori, 2004). The network efficiency E(G) is a measure to quantify how efficiently the nodes of a network exchange information. To define efficiency of a network G, first we calculate the shortest path lengths $d_{ij}$ between the ith and the jth nodes. Let us now suppose that every node sends information along the network, through its links. The efficiency in the communication between the ith node and the jth node is inversely proportional to the shortest distance: when there is no path in the graph between the ith and the jth nodes, we get $d_{ij}= + \infty$ and efficiency becomes zero. Let N be known as the size of the network or the numbers of nodes in the graph, the average efficiency of the graph (network) of G can be defined as:

$C_{eff}=E(G)=\frac{1}{N(N-1)}\sum_{i\ne j \in G} \frac{1}{d_{ij} }\quad {\mathbf (6)}$

The above formula gives a value of $C_{eff} E$ in the interval of [0, 1].

2. The efficiency of a network

[...]

The network efficiency E, is a measure introduced in Refs. [5,6] to quantify how efficiently the nodes of the network exchange information.

[...]

To define the efficiency of G first we have to calculate the shortest path lengths $\{d_{ij}\}$ between two generic points i and j.

[...]

Let us now suppose that every vertex sends information along the network, through its edges. We assume that the efficiency $\epsilon_{ij}$ in the communication between vertex i and j is inversely proportional to the shortest distance: [...] when there is no path in the graph between i and j we get $d_{ij}= + \infty$ consistently $\epsilon_{ij}=0.$ Consequently the average efficiency of the graph G can be defined as [12]:

$E({\mathbf G})=\frac{\sum_{i\ne j \in G}\epsilon_{ij} }{N(N-1)}=\frac{1}{N(N-1)}\sum_{i\ne j \in G} \frac{1}{d_{ij} }.\quad {(1)}$

Such a formula (1) gives a value of E that can vary in the range $[0,\infty [$,

[...]

 Anmerkungen Though the source is given, there is no hint that the text following the reference is taken nearly word-for-word from the source (with some shortening). Also, it makes no sense to speak of the "ith" and "jth" node as there is no linear order on a graph. The nodes are just referred to as "i" and "j", as in the source. At the end, Nm produces a mathematical mistake by leaving out too much. Sichter (Graf Isolan), WiseWoman

vorherige Seite | zur Übersichtsseite | folgende Seite
Letzte Bearbeitung dieser Seite: durch Benutzer:WiseWoman, Zeitstempel: 20120425191542