Fandom

VroniPlag Wiki

Quelle:Nm/Yang etal 2005

< 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     Huijie Yang, Wenxu Wang, Tao Zhou, Binghong Wang, Fangcui Zhao
Titel    Reconstruct the Hierarchical Structure in a Complex Network
Zeitschrift    arxiv.org
Datum    3. August 2005
URL    http://arxiv.org/abs/physics/0508026v1
Fragmente    1


Fragmente der Quelle:
[1.] Nm/Fragment 147 18 - Diskussion
Zuletzt bearbeitet: 2012-04-23 13:14:24 Hindemith
Fragment, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung, Yang etal 2005

Typus
Verschleierung
Bearbeiter
Hindemith
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 147, Zeilen: 18-29
Quelle: Yang_etal_2005
Seite(n): 2, Zeilen: 8ff
Hierarchy, as one common feature of many real world networks, attracts special attentions in recent years (Ravasz, E., A. L., Barabasi, 2003; Costa, L. D. F., 2004; Trusina, A. et al, 2004, Variano, E. A. et al, 2004). Hierarchy is one of the key aspects of a theoretical model to capture statistical characteristics of terrorist networks.

In literature, several concepts are proposed to measure the hierarchy in a network, such as the hierarchical path (Trusina, A. et al, 2004), the scaling law for the clustering coefficients of nodes in a network ( Ravasz, E., A. L., Barabasi, 2003), etc. These measures can tell us the existence and extent of hierarchy in a network. We address herein another problem how to construct hidden hierarchy of terrorist networks (which are known as horizontal networks).

Hierarchy, as one common feature for many real world networks, attracts special attentions in recent years [9-12]. [...] Hierarchy is one of the key aspects of a theoretical model [9,13] to capture the statistical characteristics of a large number of real networks, [...]

In literature, several concepts are proposed to measure the hierarchy in a network, such as the hierarchical path [10], the scaling law for the clustering coefficients of the nodes [9], the hierarchical components/degree [11], etc. These measures can tell us the existence and the extent of hierarchy in a network. We address herein another problem, that is, how to reconstruct the hierarchical structure in a network.


[9] E. Ravasz and A. -L. Barabasi, Phys. Rev. E 67, 026112(2003).

[10] A. Trusina, S. Maslov, P. Minnhagen and K. Sneppen, Phys. Rev. Lett. 92, 178702(2004).

[11] L. D. F. Costa, Phys. Rev. Lett. 93, 098702(2004).

[12] E. A. Variano, J. H. McCoy and H. Lipson, Phys. Rev. Lett. 92,188701(2004).

[13] Tao Zhou, Gang Yan and Binghong Wang, Phys. Rev. E 71, 046141 (2005).

Anmerkungen

Only minor adjustments. In particular also all the literature references are taken from Yang et al. (2005).

Note: the footnote 22, commenting the title of chapter 5 on page 146, reads as follows: "22 The parts of this chapter are already published in Memon N., Larsen Henrik Legind 2006c, 2006d, 2007c and Memon N., Qureshi A.R. (2005)." However, Memon N., Qureshi A.R. (2005) was published in November 2005 (see here), whereas Yang et al (2005) was published in August 2005.

Sichter
(Hindemith), Bummelchen

Auch bei Fandom

Zufälliges Wiki