hig.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Defining least community as a homogeneous group in complex networks
University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management.ORCID iD: 0000-0002-2337-2486
University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management.
2015 (English)In: Physica A: Statistical Mechanics and its Applications, ISSN 0378-4371, E-ISSN 1873-2119, Vol. 428, 154-160 p.Article in journal (Refereed) Published
Abstract [en]

This paper introduces a new concept of least community that is as homogeneous as a random graph, and develops a new community detection algorithm from the perspective of homogeneity or heterogeneity. Based on this concept, we adopt head/tail breaks-a newly developed classification scheme for data with a heavy-tailed distribution-and rely on edge betweenness given its heavy-tailed distribution to iteratively partition a network into many heterogeneous and homogeneous communities. Surprisingly, the derived communities for any self-organized and/or self-evolved large networks demonstrate very striking power laws, implying that there are far more small communities than large ones. This notion of far more small things than large ones constitutes a new fundamental way of thinking for community detection. © 2015 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
2015. Vol. 428, 154-160 p.
Keyword [en]
Classification, Head/tail breaks, ht-index, k-means, Natural breaks, Scaling, Classification (of information), Iterative methods, Population dynamics, Complex networks
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hig:diva-19212DOI: 10.1016/j.physa.2015.02.029ISI: 000352328100015Scopus ID: 2-s2.0-84923791049OAI: oai:DiVA.org:hig-19212DiVA: diva2:805902
Available from: 2015-04-16 Created: 2015-04-16 Last updated: 2015-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jiang, BinMa, Ding
By organisation
Department of Industrial Development, IT and Land Management
In the same journal
Physica A: Statistical Mechanics and its Applications
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 527 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf