On merging and dividing of Barabási-Albert-graphs

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

Externe Organisationen

  • Otto-von-Guericke-Universität Magdeburg
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksIEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014
Untertitel2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten17-24
Seitenumfang8
ISBN (elektronisch)9781479944958
PublikationsstatusVeröffentlicht - 13 Jan. 2014
Extern publiziertJa
Veranstaltung2014 IEEE Symposium on Evolving and Autonomous Learning Systems, EALS 2014 - Orlando, USA / Vereinigte Staaten
Dauer: 9 Dez. 201412 Dez. 2014

Publikationsreihe

NameIEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings

Abstract

The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albert-model, and five strategies to reverse them. First we compared these algorithms by edge preservation, which describes the ratio of the inner structure kept after altering. To check if hubs in the initial graphs are hubs in the resulting graphs as well, we used the node-degree rank correlation. Finally we tested how well the node-degree distribution follows the power-law function from the Barabási-Albert-model.

ASJC Scopus Sachgebiete

Zitieren

On merging and dividing of Barabási-Albert-graphs. / Held, Pascal; Dockhorn, Alexander; Kruse, Rudolf.
IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. S. 17-24 7009499 (IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Held, P, Dockhorn, A & Kruse, R 2014, On merging and dividing of Barabási-Albert-graphs. in IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings., 7009499, IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings, Institute of Electrical and Electronics Engineers Inc., S. 17-24, 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, EALS 2014, Orlando, USA / Vereinigte Staaten, 9 Dez. 2014. https://doi.org/10.1109/EALS.2014.7009499
Held, P., Dockhorn, A., & Kruse, R. (2014). On merging and dividing of Barabási-Albert-graphs. In IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings (S. 17-24). Artikel 7009499 (IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/EALS.2014.7009499
Held P, Dockhorn A, Kruse R. On merging and dividing of Barabási-Albert-graphs. in IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings. Institute of Electrical and Electronics Engineers Inc. 2014. S. 17-24. 7009499. (IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings). doi: 10.1109/EALS.2014.7009499
Held, Pascal ; Dockhorn, Alexander ; Kruse, Rudolf. / On merging and dividing of Barabási-Albert-graphs. IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. S. 17-24 (IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings).
Download
@inproceedings{9930a37e3408468a96ca15ca3b2b447b,
title = "On merging and dividing of Barab{\'a}si-Albert-graphs",
abstract = "The Barab{\'a}si-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barab{\'a}si-Albert-model, and five strategies to reverse them. First we compared these algorithms by edge preservation, which describes the ratio of the inner structure kept after altering. To check if hubs in the initial graphs are hubs in the resulting graphs as well, we used the node-degree rank correlation. Finally we tested how well the node-degree distribution follows the power-law function from the Barab{\'a}si-Albert-model.",
author = "Pascal Held and Alexander Dockhorn and Rudolf Kruse",
note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, EALS 2014 ; Conference date: 09-12-2014 Through 12-12-2014",
year = "2014",
month = jan,
day = "13",
doi = "10.1109/EALS.2014.7009499",
language = "English",
series = "IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "17--24",
booktitle = "IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014",
address = "United States",

}

Download

TY - GEN

T1 - On merging and dividing of Barabási-Albert-graphs

AU - Held, Pascal

AU - Dockhorn, Alexander

AU - Kruse, Rudolf

N1 - Publisher Copyright: © 2014 IEEE.

PY - 2014/1/13

Y1 - 2014/1/13

N2 - The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albert-model, and five strategies to reverse them. First we compared these algorithms by edge preservation, which describes the ratio of the inner structure kept after altering. To check if hubs in the initial graphs are hubs in the resulting graphs as well, we used the node-degree rank correlation. Finally we tested how well the node-degree distribution follows the power-law function from the Barabási-Albert-model.

AB - The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albert-model, and five strategies to reverse them. First we compared these algorithms by edge preservation, which describes the ratio of the inner structure kept after altering. To check if hubs in the initial graphs are hubs in the resulting graphs as well, we used the node-degree rank correlation. Finally we tested how well the node-degree distribution follows the power-law function from the Barabási-Albert-model.

UR - http://www.scopus.com/inward/record.url?scp=84946691455&partnerID=8YFLogxK

U2 - 10.1109/EALS.2014.7009499

DO - 10.1109/EALS.2014.7009499

M3 - Conference contribution

AN - SCOPUS:84946691455

T3 - IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings

SP - 17

EP - 24

BT - IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, EALS 2014

Y2 - 9 December 2014 through 12 December 2014

ER -

Von denselben Autoren