Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism

Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism

Many real systems exhibit the processes of growth and shrink. In this paper, we propose a network evolution model based on the simultaneous application of both node addition and deletion rules. To obtain a higher clustering that is present in real social networks, the model employs the triadic forma...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-12
Hauptverfasser: Sidorov, Sergei, Mironov, Sergei, Emelianov, Timofei D
Format: Artikel
Sprache:eng
Schlagworte:
Clustering
Deletion
Iterative methods
Social networks
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Sidorov, Sergei
Mironov, Sergei
Emelianov, Timofei D
description Many real systems exhibit the processes of growth and shrink. In this paper, we propose a network evolution model based on the simultaneous application of both node addition and deletion rules. To obtain a higher clustering that is present in real social networks, the model employs the triadic formation step at each iteration. The results show that the degree distribution in the networks generated based on this model follows a power law.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2900745939</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2900745939</sourcerecordid><originalsourceid>FETCH-proquest_journals_29007459393</originalsourceid><addsrcrecordid>eNqNikEKwjAUBYMgWLR3-OC6EJPW2rUo7nUvMfm1qWmiSUqvbygewNXjzcyCZIzzXXEoGVuRPISeUsr2NasqnpH-KoXBovWIYDFOzr_giRa9iNpZGJxCA5OOHQil9MyEVZAozse1YFMT4CECKkgkei2UliCNC6NHGFB2wuowbMiyFSZg_ts12Z5Pt-OleHv3GTHEe-9Gb5O6s4bSuqwa3vD_qi8iX0j4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2900745939</pqid></control><display><type>article</type><title>Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism</title><source>Free E- Journals</source><creator>Sidorov, Sergei ; Mironov, Sergei ; Emelianov, Timofei D</creator><creatorcontrib>Sidorov, Sergei ; Mironov, Sergei ; Emelianov, Timofei D</creatorcontrib><description>Many real systems exhibit the processes of growth and shrink. In this paper, we propose a network evolution model based on the simultaneous application of both node addition and deletion rules. To obtain a higher clustering that is present in real social networks, the model employs the triadic formation step at each iteration. The results show that the degree distribution in the networks generated based on this model follows a power law.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Clustering ; Deletion ; Iterative methods ; Social networks</subject><ispartof>arXiv.org, 2023-12</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Sidorov, Sergei</creatorcontrib><creatorcontrib>Mironov, Sergei</creatorcontrib><creatorcontrib>Emelianov, Timofei D</creatorcontrib><title>Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism</title><title>arXiv.org</title><description>Many real systems exhibit the processes of growth and shrink. In this paper, we propose a network evolution model based on the simultaneous application of both node addition and deletion rules. To obtain a higher clustering that is present in real social networks, the model employs the triadic formation step at each iteration. The results show that the degree distribution in the networks generated based on this model follows a power law.</description><subject>Clustering</subject><subject>Deletion</subject><subject>Iterative methods</subject><subject>Social networks</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNikEKwjAUBYMgWLR3-OC6EJPW2rUo7nUvMfm1qWmiSUqvbygewNXjzcyCZIzzXXEoGVuRPISeUsr2NasqnpH-KoXBovWIYDFOzr_giRa9iNpZGJxCA5OOHQil9MyEVZAozse1YFMT4CECKkgkei2UliCNC6NHGFB2wuowbMiyFSZg_ts12Z5Pt-OleHv3GTHEe-9Gb5O6s4bSuqwa3vD_qi8iX0j4</recordid><startdate>20231209</startdate><enddate>20231209</enddate><creator>Sidorov, Sergei</creator><creator>Mironov, Sergei</creator><creator>Emelianov, Timofei D</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20231209</creationdate><title>Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism</title><author>Sidorov, Sergei ; Mironov, Sergei ; Emelianov, Timofei D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_29007459393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Clustering</topic><topic>Deletion</topic><topic>Iterative methods</topic><topic>Social networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Sidorov, Sergei</creatorcontrib><creatorcontrib>Mironov, Sergei</creatorcontrib><creatorcontrib>Emelianov, Timofei D</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sidorov, Sergei</au><au>Mironov, Sergei</au><au>Emelianov, Timofei D</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism</atitle><jtitle>arXiv.org</jtitle><date>2023-12-09</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Many real systems exhibit the processes of growth and shrink. In this paper, we propose a network evolution model based on the simultaneous application of both node addition and deletion rules. To obtain a higher clustering that is present in real social networks, the model employs the triadic formation step at each iteration. The results show that the degree distribution in the networks generated based on this model follows a power law.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-12
issn 2331-8422
language eng
recordid cdi_proquest_journals_2900745939
source Free E- Journals
subjects Clustering
Deletion
Iterative methods
Social networks
title Scale-free network generation model with addition and deletion of nodes based on triadic closure mechanism
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A16%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Scale-free%20network%20generation%20model%20with%20addition%20and%20deletion%20of%20nodes%20based%20on%20triadic%20closure%20mechanism&rft.jtitle=arXiv.org&rft.au=Sidorov,%20Sergei&rft.date=2023-12-09&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2900745939%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2900745939&rft_id=info:pmid/&rfr_iscdi=true