Fandom

VroniPlag Wiki

Quelle:Nm3/Newman 2006

< Quelle:Nm3

31.366Seiten 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     Mark E. J. Newman
Titel    The mathematics of networks
Jahr    2006
Anmerkung    appears on Newman's list of publications in June 2005 (cp. https://web.archive.org/web/20050627235423/http://www-personal.umich.edu/~mejn/pubs.html)
URL    https://web.archive.org/web/20060511022545/http://www-personal.umich.edu/~mejn/papers/palgrave.pdf

Literaturverz.   

no
Fußnoten    no
Fragmente    2


Fragmente der Quelle:
[1.] Nm3/Fragment 1045 33 - Diskussion
Zuletzt bearbeitet: 2014-02-01 20:17:24 Hindemith
Fragment, Gesichtet, KomplettPlagiat, Newman 2006, Nm3, SMWFragment, Schutzlevel sysop

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 1045, Zeilen: 33-42
Quelle: Newman 2006
Seite(n): 4, Zeilen: 11-14, 18-22
The centrality measures address the question, “Who is the most important or central person in the network?” There are many answers to this question, depending on what we mean by important. Perhaps the simplest of centrality measures is degree centrality, also called simply degree.

Though simple, degree is often a highly effective measure of the influence or importance of a node: in many social settings people with more connections tend to have more power.

A more sophisticated version of the same idea is the so-called eigenvector centrality (which is also known as centrality of a centrality). Where degree centrality gives a [simple count of the number of connections a vertex has, eigenvector centrality acknowledges that not all connections are equal.]

[page 4]

Centrality measures address the question, “Who is the most important or central person in this network?” There are many answers to this question, depending on what we mean by important. Perhaps the simplest of centrality measures is degree centrality, also called simply degree.

[...]

Though simple, degree is often a highly effective measure of the influence or importance of a node: in many social settings people with more connections tend to have more power.

A more sophisticated version of the same idea is the so-called eigenvector centrality. Where degree centrality gives a simple count of the number of connections a vertex has, eigenvector centrality acknowledges that not all connections are equal.

Anmerkungen

Not a hint of the original source is given.

Sichter
(Graf Isolan), Hindemith

[2.] Nm3/Fragment 1046 01 - Diskussion
Zuletzt bearbeitet: 2014-02-01 20:19:29 Hindemith
Fragment, Gesichtet, KomplettPlagiat, Newman 2006, Nm3, SMWFragment, Schutzlevel sysop

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 1046, Zeilen: 1-2
Quelle: Newman 2006
Seite(n): 4, Zeilen: 20-22
[Where degree centrality gives a] simple count of the number of connections a vertex has, eigenvector centrality acknowledges that not all connections are equal. Where degree centrality gives a simple count of the number of connections a vertex has, eigenvector centrality acknowledges that not all connections are equal.
Anmerkungen

Source is not given.

Fragment presents the final sentence of the takeover begun in Nm3/Fragment_1045_33.

Sichter
(Graf Isolan), Hindemith

Auch bei Fandom

Zufälliges Wiki