A New Class of the Planar Networks with High Clustering and High Entropy

Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topol...

Full description

Saved in:
Bibliographic Details
Published in:Abstract and Applied Analysis 2013-01, Vol.2013 (2013), p.780-784-1079
Main Authors: Hu, Guona, Xiao, Yuzhi, Jia, Huanshen, Zhao, Haixing
Format: Article
Language:English
Subjects:
Algorithms
Clustering (Computers)
Computer science
Entropy (Information theory)
Fractals
Mathematical research
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33
cites cdi_FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33
container_end_page 784-1079
container_issue 2013
container_start_page 780
container_title Abstract and Applied Analysis
container_volume 2013
creator Hu, Guona
Xiao, Yuzhi
Jia, Huanshen
Zhao, Haixing
description Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topological properties of the model, such as the degree distribution, clustering coefficient, and diameter. Meanwhile, according to the special structure of the model, we derive analytically the exact numbers of spanning trees in the planar networks. The results show that the model has a discrete exponential degree distribution, high clustering coefficient, short diameter, and high entropy.
doi_str_mv 10.1155/2013/795682
format article
fullrecord <record><control><sourceid>gale_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_a1aa5fdd4be34b608917d45f756849a8</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A369794817</galeid><airiti_id>P20160825001_201312_201609070065_201609070065_780_784_1079</airiti_id><doaj_id>oai_doaj_org_article_a1aa5fdd4be34b608917d45f756849a8</doaj_id><sourcerecordid>A369794817</sourcerecordid><originalsourceid>FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33</originalsourceid><addsrcrecordid>eNqFUdGKEzEUHUTBdfXJZ2HAN2V2k0kySd4sZbULRVfU53A7SdrU7qQmKWX_3ttO6bJPSwhJTs49nHtPVb2n5IpSIa5bQtm11KJT7YvqgnZKNoQT_RLvRImGMSleV29yXhNCmOT8oppN6u9uX083kHMdfV1Wrr7bwAAJ8bKP6W-u96Gs6llYrpC2y8WlMCxrGOyI3Qwlxe3D2-qVh012707nZfXr683v6ayZ__h2O53MGxCalsb1rl20hChCaM86AYIyDmpBNFAluW294JIQTikXPYBjSjHPndWeWc_YZXU7qtoIa7NN4R7Sg4kQzBGIaWkgldBvnAEKILy1fOEYX3REaSotF17idLgGhVpfRq1timvXF7frN8E-EZ3-mZ_Q0wEAhjLNONeKtCjx8Szxb-dyMeu4SwP2byiXtGWt1AfTVyNrCegrDD6WBD0u6-5DHwfnA-IT1mmpuaISCz6PBX2KOSfnz6YoMYegzSFoMwaN7E8jexUGC_vwDPnDSHZIcR7OZGxIqoPXn-M_hBRKeOznDlVwiK3A4I6KtDVHSBPMqxNPH1IR3Bwt4AD-A-AUxA0</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1471232793</pqid></control><display><type>article</type><title>A New Class of the Planar Networks with High Clustering and High Entropy</title><source>Wiley-Blackwell Open Access Collection</source><source>Publicly Available Content Database</source><creator>Hu, Guona ; Xiao, Yuzhi ; Jia, Huanshen ; Zhao, Haixing</creator><contributor>Cao, Jinde</contributor><creatorcontrib>Hu, Guona ; Xiao, Yuzhi ; Jia, Huanshen ; Zhao, Haixing ; Cao, Jinde</creatorcontrib><description>Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topological properties of the model, such as the degree distribution, clustering coefficient, and diameter. Meanwhile, according to the special structure of the model, we derive analytically the exact numbers of spanning trees in the planar networks. The results show that the model has a discrete exponential degree distribution, high clustering coefficient, short diameter, and high entropy.</description><identifier>ISSN: 1085-3375</identifier><identifier>EISSN: 1687-0409</identifier><identifier>DOI: 10.1155/2013/795682</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Limiteds</publisher><subject>Algorithms ; Clustering (Computers) ; Computer science ; Entropy (Information theory) ; Fractals ; Mathematical research</subject><ispartof>Abstract and Applied Analysis, 2013-01, Vol.2013 (2013), p.780-784-1079</ispartof><rights>Copyright © 2013 Guona Hu et al.</rights><rights>COPYRIGHT 2013 John Wiley &amp; Sons, Inc.</rights><rights>Copyright © 2013 Guona Hu et al. Guona Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</rights><rights>Copyright 2013 Hindawi Publishing Corporation</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33</citedby><cites>FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33</cites><orcidid>0000-0003-0324-533X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1471232793/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1471232793?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,776,780,881,25731,27901,27902,36989,44566,74869</link.rule.ids></links><search><contributor>Cao, Jinde</contributor><creatorcontrib>Hu, Guona</creatorcontrib><creatorcontrib>Xiao, Yuzhi</creatorcontrib><creatorcontrib>Jia, Huanshen</creatorcontrib><creatorcontrib>Zhao, Haixing</creatorcontrib><title>A New Class of the Planar Networks with High Clustering and High Entropy</title><title>Abstract and Applied Analysis</title><description>Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topological properties of the model, such as the degree distribution, clustering coefficient, and diameter. Meanwhile, according to the special structure of the model, we derive analytically the exact numbers of spanning trees in the planar networks. The results show that the model has a discrete exponential degree distribution, high clustering coefficient, short diameter, and high entropy.</description><subject>Algorithms</subject><subject>Clustering (Computers)</subject><subject>Computer science</subject><subject>Entropy (Information theory)</subject><subject>Fractals</subject><subject>Mathematical research</subject><issn>1085-3375</issn><issn>1687-0409</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNqFUdGKEzEUHUTBdfXJZ2HAN2V2k0kySd4sZbULRVfU53A7SdrU7qQmKWX_3ttO6bJPSwhJTs49nHtPVb2n5IpSIa5bQtm11KJT7YvqgnZKNoQT_RLvRImGMSleV29yXhNCmOT8oppN6u9uX083kHMdfV1Wrr7bwAAJ8bKP6W-u96Gs6llYrpC2y8WlMCxrGOyI3Qwlxe3D2-qVh012707nZfXr683v6ayZ__h2O53MGxCalsb1rl20hChCaM86AYIyDmpBNFAluW294JIQTikXPYBjSjHPndWeWc_YZXU7qtoIa7NN4R7Sg4kQzBGIaWkgldBvnAEKILy1fOEYX3REaSotF17idLgGhVpfRq1timvXF7frN8E-EZ3-mZ_Q0wEAhjLNONeKtCjx8Szxb-dyMeu4SwP2byiXtGWt1AfTVyNrCegrDD6WBD0u6-5DHwfnA-IT1mmpuaISCz6PBX2KOSfnz6YoMYegzSFoMwaN7E8jexUGC_vwDPnDSHZIcR7OZGxIqoPXn-M_hBRKeOznDlVwiK3A4I6KtDVHSBPMqxNPH1IR3Bwt4AD-A-AUxA0</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Hu, Guona</creator><creator>Xiao, Yuzhi</creator><creator>Jia, Huanshen</creator><creator>Zhao, Haixing</creator><general>Hindawi Limiteds</general><general>Hindawi Puplishing Corporation</general><general>Hindawi Publishing Corporation</general><general>John Wiley &amp; Sons, Inc</general><general>Hindawi Limited</general><scope>188</scope><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-0324-533X</orcidid></search><sort><creationdate>20130101</creationdate><title>A New Class of the Planar Networks with High Clustering and High Entropy</title><author>Hu, Guona ; Xiao, Yuzhi ; Jia, Huanshen ; Zhao, Haixing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Clustering (Computers)</topic><topic>Computer science</topic><topic>Entropy (Information theory)</topic><topic>Fractals</topic><topic>Mathematical research</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hu, Guona</creatorcontrib><creatorcontrib>Xiao, Yuzhi</creatorcontrib><creatorcontrib>Jia, Huanshen</creatorcontrib><creatorcontrib>Zhao, Haixing</creatorcontrib><collection>Chinese Electronic Periodical Services (CEPS)</collection><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East &amp; Africa Database</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>test</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><collection>Directory of Open Access Journals</collection><jtitle>Abstract and Applied Analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hu, Guona</au><au>Xiao, Yuzhi</au><au>Jia, Huanshen</au><au>Zhao, Haixing</au><au>Cao, Jinde</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A New Class of the Planar Networks with High Clustering and High Entropy</atitle><jtitle>Abstract and Applied Analysis</jtitle><date>2013-01-01</date><risdate>2013</risdate><volume>2013</volume><issue>2013</issue><spage>780</spage><epage>784-1079</epage><pages>780-784-1079</pages><issn>1085-3375</issn><eissn>1687-0409</eissn><abstract>Small-world networks are ubiquitous in real-life systems, such as the World Wide Web, communication networks, and electric power grids, and most of them are stochastic. In this paper, we present a model that generates a small-world network in a simple deterministic way and analyze the relevant topological properties of the model, such as the degree distribution, clustering coefficient, and diameter. Meanwhile, according to the special structure of the model, we derive analytically the exact numbers of spanning trees in the planar networks. The results show that the model has a discrete exponential degree distribution, high clustering coefficient, short diameter, and high entropy.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Limiteds</pub><doi>10.1155/2013/795682</doi><orcidid>https://orcid.org/0000-0003-0324-533X</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1085-3375
ispartof Abstract and Applied Analysis, 2013-01, Vol.2013 (2013), p.780-784-1079
issn 1085-3375
1687-0409
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_a1aa5fdd4be34b608917d45f756849a8
source Wiley-Blackwell Open Access Collection; Publicly Available Content Database
subjects Algorithms
Clustering (Computers)
Computer science
Entropy (Information theory)
Fractals
Mathematical research
title A New Class of the Planar Networks with High Clustering and High Entropy
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T13%3A51%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20New%20Class%20of%20the%20Planar%20Networks%20with%20High%20Clustering%20and%20High%20Entropy&rft.jtitle=Abstract%20and%20Applied%20Analysis&rft.au=Hu,%20Guona&rft.date=2013-01-01&rft.volume=2013&rft.issue=2013&rft.spage=780&rft.epage=784-1079&rft.pages=780-784-1079&rft.issn=1085-3375&rft.eissn=1687-0409&rft_id=info:doi/10.1155/2013/795682&rft_dat=%3Cgale_doaj_%3EA369794817%3C/gale_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a591t-ece2b2008001c365a5134a8b09a1874d2f5470041145caae3883f4ed9f3df33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1471232793&rft_id=info:pmid/&rft_galeid=A369794817&rft_airiti_id=P20160825001_201312_201609070065_201609070065_780_784_1079&rfr_iscdi=true