Formal vs self-organised knowledge systems: a network approach

@article{Masucci2011FormalVS,
  title={Formal vs self-organised knowledge systems: a network approach},
  author={Adolfo Paolo Masucci},
  journal={ArXiv},
  year={2011},
  volume={abs/1105.1058}
}
  • A. P. Masucci
  • Published 5 May 2011
  • Computer Science, Mathematics
  • ArXiv
3 Citations

Figures from this paper

Semantic Space as a Metapopulation System: Modelling the Wikipedia Information Flow Network

The indefinite chain of meaning assumes a rhizomatic shape that can be represented and analysed via the modern techniques of network theory (Dorogovtsev and Mendes 2013).

Scale-invariant topology and bursty branching of evolutionary trees emerge from niche construction

A simple, coarse-grained statistical model of niche construction coupled to simple models of speciation that recapitulates both the scale-invariant topology and the bursty pattern of diversification in time shows how dynamical scaling laws of phylogenetic trees on long timescales can reflect the indelible imprint of the interplay between ecological and evolutionary processes.

References

SHOWING 1-10 OF 31 REFERENCES

Wikipedia Information Flow Analysis Reveals the Scale-Free Architecture of the Semantic Space

A stochastic model of content-based network, based on a copy and mutation algorithm and on the Heaps' law, is introduced that is able to capture the main statistical properties of the analysed semantic space, including the Zipf's law for the word frequency distribution.

Random graph models for directed acyclic networks.

  • B. KarrerM. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
This work proposes two specific models roughly analogous to the fixed edge number and fixed edge probability variants of traditional undirected random graphs for directed acyclic graphs, finding that theory and measurements agree surprisingly well-far better than the often poor agreement of other random graph models with their corresponding real-world networks.

Exploring the randomness of Directed Acyclic Networks

Two methods of DAG randomization as defined by the desired combination of two topological invariants (directed degree sequence and component distributions) aimed to be preserved are analyzed and results show how the interpretation of degree-degree relations in DAGs with respect to their randomized ensembles depends on the topologically invariants imposed.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Cut-offs and finite size effects in scale-free networks

Abstract.We analyze the degree distribution’s cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices N is ruled by the topological constraints

Network Analysis and the Law: Measuring the Legal Importance of Precedents at the U.S. Supreme Court

We construct the complete network of 26,681 majority opinions written by the U.S. Supreme Court and the cases that cite them from 1791 to 2005. We describe a method for using the patterns in

A general theory of bibliometric and other cumulative advantage processes

  • D. Price
  • Mathematics
    J. Am. Soc. Inf. Sci.
  • 1976
It is shown that such a stochastic law is governed by the Beta Function, containing only one free parameter, and this is approximated by a skew or hyperbolic distribution of the type that is widespread in bibliometrics and diverse social science phenomena.

Size and form in efficient transportation networks

The theory accounts in a general way for the quarter-power allometric scaling of living organisms and predicts scaling relations applicable to all efficient transportation networks, which is verified from observational data on the river drainage basins.

Principia Mathematica

THIS work contains some thousands of propositions, each, with its proof, expressed in a shorthand so concise that if they were all expanded into ordinary language, the room taken up would be ten

Universal Scaling in the Branching of the Tree of Life

This work examines the topological properties of a large set of interspecific and intraspecific phylogenies and shows that the branching patterns follow allometric rules conserved across the different levels in the Tree of Life, all significantly departing from those expected from the standard null models.