Rotated multifractal network generator

Gergely Palla, Péter Pollner, T. Vicsek

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The recently introduced multifractal network generator (MFNG), has been shown to provide a simple and flexible tool for creating random graphs with very diverse features. The MFNG is based on multifractal measures embedded in 2d, leading also to isolated nodes, whose number is relatively low for realistic cases, but may become dominant in the limiting case of infinitely large network sizes. Here we discuss the relation between this effect and the information dimension for the 1d projection of the link probability measure (LPM), and argue that the node isolation can be avoided by a simple transformation of the LPM based on rotation.

Original languageEnglish
Article numberP02003
JournalJournal of Statistical Mechanics: Theory and Experiment
Volume2011
Issue number2
DOIs
Publication statusPublished - Feb 2011

Fingerprint

generators
Generator
Probability Measure
Vertex of a graph
Random Graphs
Isolation
isolation
Limiting
projection
Projection
Node
Random graphs

Keywords

  • analysis of algorithms
  • network reconstruction
  • networks
  • random graphs

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistical and Nonlinear Physics
  • Statistics, Probability and Uncertainty

Cite this

Rotated multifractal network generator. / Palla, Gergely; Pollner, Péter; Vicsek, T.

In: Journal of Statistical Mechanics: Theory and Experiment, Vol. 2011, No. 2, P02003, 02.2011.

Research output: Contribution to journalArticle

@article{c057141ab6164e70a9227a6543258cc7,
title = "Rotated multifractal network generator",
abstract = "The recently introduced multifractal network generator (MFNG), has been shown to provide a simple and flexible tool for creating random graphs with very diverse features. The MFNG is based on multifractal measures embedded in 2d, leading also to isolated nodes, whose number is relatively low for realistic cases, but may become dominant in the limiting case of infinitely large network sizes. Here we discuss the relation between this effect and the information dimension for the 1d projection of the link probability measure (LPM), and argue that the node isolation can be avoided by a simple transformation of the LPM based on rotation.",
keywords = "analysis of algorithms, network reconstruction, networks, random graphs",
author = "Gergely Palla and P{\'e}ter Pollner and T. Vicsek",
year = "2011",
month = "2",
doi = "10.1088/1742-5468/2011/02/P02003",
language = "English",
volume = "2011",
journal = "Journal of Statistical Mechanics: Theory and Experiment",
issn = "1742-5468",
publisher = "IOP Publishing Ltd.",
number = "2",

}

TY - JOUR

T1 - Rotated multifractal network generator

AU - Palla, Gergely

AU - Pollner, Péter

AU - Vicsek, T.

PY - 2011/2

Y1 - 2011/2

N2 - The recently introduced multifractal network generator (MFNG), has been shown to provide a simple and flexible tool for creating random graphs with very diverse features. The MFNG is based on multifractal measures embedded in 2d, leading also to isolated nodes, whose number is relatively low for realistic cases, but may become dominant in the limiting case of infinitely large network sizes. Here we discuss the relation between this effect and the information dimension for the 1d projection of the link probability measure (LPM), and argue that the node isolation can be avoided by a simple transformation of the LPM based on rotation.

AB - The recently introduced multifractal network generator (MFNG), has been shown to provide a simple and flexible tool for creating random graphs with very diverse features. The MFNG is based on multifractal measures embedded in 2d, leading also to isolated nodes, whose number is relatively low for realistic cases, but may become dominant in the limiting case of infinitely large network sizes. Here we discuss the relation between this effect and the information dimension for the 1d projection of the link probability measure (LPM), and argue that the node isolation can be avoided by a simple transformation of the LPM based on rotation.

KW - analysis of algorithms

KW - network reconstruction

KW - networks

KW - random graphs

UR - http://www.scopus.com/inward/record.url?scp=79952733387&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952733387&partnerID=8YFLogxK

U2 - 10.1088/1742-5468/2011/02/P02003

DO - 10.1088/1742-5468/2011/02/P02003

M3 - Article

AN - SCOPUS:79952733387

VL - 2011

JO - Journal of Statistical Mechanics: Theory and Experiment

JF - Journal of Statistical Mechanics: Theory and Experiment

SN - 1742-5468

IS - 2

M1 - P02003

ER -