Fandom

VroniPlag Wiki

Quelle:Nm/Freeman 1980

< Quelle:Nm

31.388Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0

Störung durch Adblocker erkannt!


Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite.

Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.

Angaben zur Quelle [Bearbeiten]

Autor     Linton C. Freeman
Titel    The gatekeeper, Pair-dependency and Structural Centrality
Zeitschrift    Quality and Quantity
Ort    Amsterdam
Verlag    Elsevier
Jahr    1980
Nummer    14
Seiten    585-592
DOI    10.1007/BF00184720
URL    http://moreno.ss.uci.edu/31.pdf

Literaturverz.   

no
Fußnoten    no
Fragmente    3


Fragmente der Quelle:
[1.] Nm/Fragment 138 12 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:51:38 Hindemith
Fragment, Freeman 1980, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 138, Zeilen: 12-20
Quelle: Freeman 1980
Seite(n): 587, Zeilen: 17-24
Consider a network representing a symmetrical relation, “communicates with” for a set of nodes. When a pair of nodes (say, u and v) is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more modes (u, v, w) such that u would like to communicate with w, using node v, then how many times node u uses node v to reach node w and how many shortest paths node u uses to reach node w. There can, of course, be more than one geodesic, linking any pair of nodes. Consider a graph representing the symmetrical relation, "communicates with" for a set of people. When a pair of points is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more points (pi, pj, pk) such that pi is adjacent to pj and pj is adjacent to pk constitute a path from pi to pk. The shortest path linking a pair of points is called a geodesic. There can, of course, be more than one geodesic linking any pair of points.
Anmerkungen

A barely concealed mostly verbatim adaption of what can be found in Freeman (1980). Where Nm leaves the path of the original text the definition becomes nearly incomprehensible and mathematically unsound (although the definition of a path given by Freeman also leaves a bit to be desired).

Sichter
(Graf Isolan), Hindemith

[2.] Nm/Fragment 139 11 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:53:58 Hindemith
Fragment, Freeman 1980, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 139, Zeilen: 11-14
Quelle: Freeman 1980
Seite(n): 588, Zeilen: 1-4
The dependence centrality is defined as the degree to which a node, u, must depend upon another, v, to relay its messages along geodesics to and from all other reachable nodes in the network. Thus, for a network containing n nodes [...] Now we can define pair-dependency as the degree to which a point, pi, must depend upon another, pj, to relay its messages along geodesics to and from all other reachable points in the network. Thus, for a network containing n points, [...]
Anmerkungen

The interpretation of the mathematical definitions is word-for-word the same (although the definitions differ actually).

Sichter
(Graf Isolan), Hindemith

[3.] Nm/Fragment 140 01 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:54:11 Hindemith
Fragment, Freeman 1980, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 140, Zeilen: 1-6
Quelle: Freeman 1980
Seite(n): 588, Zeilen: 10-14
Each entry in D is an index of the degree to which the node designated by the row of a matrix must depend on the vertex designated by the column to relay messages to and from others. Thus D captures the importance of each node as gatekeeper with respect to every other node—facilitating or perhaps inhibiting its communication. Each entry in D is an index of the degree to which the point designated by the row of the matrix must depend on the point designated by the column to relay messages to and from others. Thus D captures the importance of each point as a gatekeeper with respect to each other point - facilitating or perhaps inhibiting its communication.
Anmerkungen

Even though nearly identical, a reference to the source is completely missing.

Sichter
(Graf Isolan), Hindemith

Auch bei Fandom

Zufälliges Wiki