An algorithmically random family of MultiAspect Graphs and its
  topological properties

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

This article presents a theoretical investigation of incompressibility and randomness in generalized representations of graphs along with its implications on network topological properties. We extend previous studies on plain algorithmically random classical graphs to plain and prefix algorithmically random MultiAspect Graphs (MAGs). First, we show that there is an infinite recursively labeled infinite family of nested MAGs (or, as a particular case, of nested classical graphs) that behaves like (and is determined by) an algorithmically random real number. Then, we study some of their important topological properties, in particular, vertex degree, connectivity, diameter, and rigidity.

Related collections

Most cited references 18

Record: found
Abstract: found
Article: not found

Scale-free networks: a decade and beyond.

Albert-László Barabási (2009)

For decades, we tacitly assumed that the components of such complex systems as the cell, the society, or the Internet are randomly wired together. In the past decade, an avalanche of research has shown that many real networks, independent of their age, function, and scope, converge to similar architectures, a universality that allowed researchers from different disciplines to embrace network theory as a common paradigm. The decade-old discovery of scale-free networks was one of those events that had helped catalyze the emergence of network science, a new research field with its distinct set of challenges and accomplishments.