Fandom

VroniPlag Wiki

Quelle:Nm/Stephenson and Zelen 1989

< Quelle:Nm

31.354Seiten 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     Stephenson, Karen and Zelen, Marvin
Titel    Rethinking Centrality: Methods and Examples
Zeitschrift    Social Networks
Ausgabe    11
Jahr    1989
Seiten    1-37
URL    http://www.sciencedirect.com/science/article/pii/0378873389900166

Literaturverz.   

ja
Fußnoten    nein
Fragmente    6


Fragmente der Quelle:
[1.] Nm/Fragment 100 24 - Diskussion
Zuletzt bearbeitet: 2012-05-21 10:48:00 WiseWoman
Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 100, Zeilen: 24-30
Quelle: Stephenson and Zelen 1989
Seite(n): 2-3, Zeilen: p.2, 31-35 - p.3, 1-3
A review of key centrality concepts can be found in the papers by Freeman (1978, 1979). This work has contributed significantly to the conceptual clarification and theoretical application of centrality. He provides three general measures of centrality termed “degree”, “closeness”, and “betweenness”. His development was partially motivated by the structural properties of the center of a star graph. [page 2]

A review of key centrality concepts can be found in the papers by Freeman (1979a,b). His work has significantly contributed to the conceptual clarification and theoretical application of centrality. Motivated by the work of Nieminen (1974), Sabidussi (1966), and Bavelas (1948), he provides three general measures of centrality termed

[page 3]

“degree”, “closeness”, and “betweenness”. His development is partially motivated by the structural properties of the center of a star graph.

Anmerkungen

Shortened but otherwise identical. Not marked as a citation, no reference given.

Sichter
(Graf Isolan), WiseWoman

[2.] Nm/Fragment 104 02 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:21:30 Hindemith
Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 103, Zeilen: 2-8
Quelle: Stephenson and Zelen 1989
Seite(n): 3, Zeilen: 10-16
The third measure is called betweenness and is the frequency at which a node occurs on a geodesic that connects a pair of nodes. Thus, any node that falls on the shortest path between other nodes can potentially control the transmission of information or effect exchange by being an intermediary. “It is the potential for control that defines the centrality of these nodes” (Frantz, T. and K. M. Carley, 2005). The third measure is called betweenness and is the frequency at which a point occurs on the geodesic that connects pairs of points. Thus, any point that falls on the shortest path between other points can potentially control the transmission of information or effect exchange by being an intermediary. “It is this potential for control that defines the centrality of these points” (Freeman 1979a: 221).
Anmerkungen

nothing is marked as a citation, the source remains unnamed.

Sichter
(Graf Isolan), Hindemith

[3.] Nm/Fragment 143 02 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:21:49 Hindemith
Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 143, Zeilen: 2-5
Quelle: Stephenson and Zelen 1989
Seite(n): 26-27, Zeilen: p.26,36-37 - p.27,1
Above Section proposed, developed and illustrated a new measure of centrality called dependence centrality, which may be applied to terrorist networks. This measure reflects the information contained in the shortest paths in a network. [page 26]

We have proposed, developed and illustrated by the use of examples a new measure of centrality called information, which may be applied to

[page 27]

nondirected networks. This measure reflects the information contained in all possible paths in a network.

Anmerkungen

adapted to fit the theme of the thesis, otherwise identical; nothing is marked as a citation, no reference given.

Sichter
(Graf Isolan), Hindemith

[4.] Nm/Fragment 144 13 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:22:25 Hindemith
Fragment, Gesichtet, KomplettPlagiat, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 144, Zeilen: 13-15
Quelle: Stephenson and Zelen 1989
Seite(n): 27, Zeilen: 34-36
This chapter attempted to illustrate the calculation of centralities to these prototypical situations. However we regard our efforts in this direction as only a beginning. We have attempted to illustrate the calculation of centralities to these prototypical situations. However we regard our efforts in this direction as only a beginning.
Anmerkungen

This piece is taken word-for-word from the conclusion of the paper which functioned as an unreferenced source. The sentences following will be taken from one of the second of the paper's introductory chapters.

Sichter
(Graf Isolan), Hindemith

[5.] Nm/Fragment 144 16 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:21:09 Hindemith
Fragment, Gesichtet, KomplettPlagiat, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 144, Zeilen: 16-21
Quelle: Stephenson and Zelen 1989
Seite(n): 3, Zeilen: 28-33
It is possible that information will take a more circuitous route either by random communication or may be intentionally channelled through many intermediaries in order to “hide” or “shield” information in a way not captured by geodesic paths. These considerations raise questions as to how to include all possible paths in a centrality [measure.] It is quite possible that information will take a more circuitous route either by random communication or may be intentionally channeled through many intermediaries in order to “hide” or “shield” information in a way not captured by geodesic paths. These considerations raise questions as to how to include all possible paths in a centrality measure.
Anmerkungen

This is supposed to be a part of a summary, which Nm did for this chapter. But in fact it stems verbatim from the unnamed source. This section will appear a second time in Nm's thesis as Nm/Fragment_242_09.

Sichter
(Graf Isolan), Hindemith

[6.] Nm/Fragment 242 09 - Diskussion
Zuletzt bearbeitet: 2012-05-22 19:22:44 Hindemith
Fragment, Gesichtet, KomplettPlagiat, Nm, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 242, Zeilen: 9-14
Quelle: Stephenson and Zelen 1989
Seite(n): 3, Zeilen: 28-33
It is possible that information will take a more circuitous route either by random communication or may be intentionally channeled through many intermediaries in order to “hide” or “shield” information in a way not captured by geodesic paths. These considerations raise questions as to how to include all possible paths in a centrality measure. It is quite possible that information will take a more circuitous route either by random communication or may be intentionally channeled through many intermediaries in order to “hide” or “shield” information in a way not captured by geodesic paths. These considerations raise questions as to how to include all possible paths in a centrality measure.
Anmerkungen

Nearly identical, not marked as a citation, no reference given. See also Nm/Fragment_144_16.

Sichter
(Graf Isolan), Hindemith

Auch bei Fandom

Zufälliges Wiki