Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 4 - Zipf’s Law of Meaning: The Degree Distribution of the Mind

  • from Part II - Language
  • Thomas T. Hills, University of Warwick
  • Book:
    Behavioral Network Science
    Published online:
    08 November 2024
    Print publication:
    30 November 2024, pp 63-74

  • Summary

    Degree is the simplest of the node-level measures, but its simplicity often hides its power. Here we will apply degree to the problem of mental structure. Specifically, what is the structure of the relationships between information in the mind? George Kingsley Zipf observed that word frequencies in natural language tend to a follow a scale-free distribution: The most frequent words are few, while the less frequent words are many with a specific linear relationship on a log-log plot. It has also been suggested that this power-law distribution applies to the relationships between words as well as to their meanings. Some words share meanings with many other words while others share few. This is a hypothesis based on the structural distribution of shared meanings, or polysemy (words with multiple meanings). This chapter will explain the theory underlying Zipf’s law of meaning and power laws. It will also show how we can combine these ideas with the most basic node-level network measure: degree.

  • Width of a scale-free tree

  • Part of
  • Zsolt Katona
  • Journal:
    Journal of Applied Probability / Volume 42 / Issue 3 / September 2005
    Published online by Cambridge University Press:
    14 July 2016, pp. 839-850
    Print publication:
    September 2005
    • Article
      • You have access
    • PDF
    • Export citation

  • Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices then this will be a tree. These graphs have been shown to have a power-law degree distribution, the same as that observed in some large real-world networks. We are interested in the width of the tree and we show that it is at the nth step; this also holds for a slight generalization of the model with another constant. We then see how this theoretical result can be applied to directory trees.