Statistical analyses of cyclic and starlike hierarchical dominances in directed graphs

G. Szabó, István Borsos, Borbála Leitner

Research output: Contribution to journalArticle

Abstract

The mathematical framework of matrix decomposition implies the possibility to perform statistical analyses of directed graphs focused on the distributions of the independent cyclic and starlike hierarchical components. In this approach the weighted directed graphs with n nodes are built up as a linear combination of starlike graphs with n outgoing edges and a suitable set of three-edge cyclic subgraphs. The applicability of this approach is illustrated by quantifying several general features: e.g., ratio of the cyclic and hierarchical components and asymmetry in the hierarchical components. The applicability of these methods is illustrated by considering the averages over random directed graphs and comparing these values with those characterizing simple directed graphs of tournaments.

Original languageEnglish
Article number032301
JournalPhysical Review E
Volume100
Issue number3
DOIs
Publication statusPublished - Sep 3 2019

Fingerprint

Directed Graph
Matrix Decomposition
Tournament
Weighted Graph
Simple Graph
Random Graphs
asymmetry
Asymmetry
Linear Combination
decomposition
Subgraph
matrices
Imply
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Cite this

Statistical analyses of cyclic and starlike hierarchical dominances in directed graphs. / Szabó, G.; Borsos, István; Leitner, Borbála.

In: Physical Review E, Vol. 100, No. 3, 032301, 03.09.2019.

Research output: Contribution to journalArticle

@article{9273ab3dd6784da4a7ef35d7d8cfb651,
title = "Statistical analyses of cyclic and starlike hierarchical dominances in directed graphs",
abstract = "The mathematical framework of matrix decomposition implies the possibility to perform statistical analyses of directed graphs focused on the distributions of the independent cyclic and starlike hierarchical components. In this approach the weighted directed graphs with n nodes are built up as a linear combination of starlike graphs with n outgoing edges and a suitable set of three-edge cyclic subgraphs. The applicability of this approach is illustrated by quantifying several general features: e.g., ratio of the cyclic and hierarchical components and asymmetry in the hierarchical components. The applicability of these methods is illustrated by considering the averages over random directed graphs and comparing these values with those characterizing simple directed graphs of tournaments.",
author = "G. Szab{\'o} and Istv{\'a}n Borsos and Borb{\'a}la Leitner",
year = "2019",
month = "9",
day = "3",
doi = "10.1103/PhysRevE.100.032301",
language = "English",
volume = "100",
journal = "Physical review. E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "3",

}

TY - JOUR

T1 - Statistical analyses of cyclic and starlike hierarchical dominances in directed graphs

AU - Szabó, G.

AU - Borsos, István

AU - Leitner, Borbála

PY - 2019/9/3

Y1 - 2019/9/3

N2 - The mathematical framework of matrix decomposition implies the possibility to perform statistical analyses of directed graphs focused on the distributions of the independent cyclic and starlike hierarchical components. In this approach the weighted directed graphs with n nodes are built up as a linear combination of starlike graphs with n outgoing edges and a suitable set of three-edge cyclic subgraphs. The applicability of this approach is illustrated by quantifying several general features: e.g., ratio of the cyclic and hierarchical components and asymmetry in the hierarchical components. The applicability of these methods is illustrated by considering the averages over random directed graphs and comparing these values with those characterizing simple directed graphs of tournaments.

AB - The mathematical framework of matrix decomposition implies the possibility to perform statistical analyses of directed graphs focused on the distributions of the independent cyclic and starlike hierarchical components. In this approach the weighted directed graphs with n nodes are built up as a linear combination of starlike graphs with n outgoing edges and a suitable set of three-edge cyclic subgraphs. The applicability of this approach is illustrated by quantifying several general features: e.g., ratio of the cyclic and hierarchical components and asymmetry in the hierarchical components. The applicability of these methods is illustrated by considering the averages over random directed graphs and comparing these values with those characterizing simple directed graphs of tournaments.

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

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

U2 - 10.1103/PhysRevE.100.032301

DO - 10.1103/PhysRevE.100.032301

M3 - Article

AN - SCOPUS:85072663284

VL - 100

JO - Physical review. E

JF - Physical review. E

SN - 2470-0045

IS - 3

M1 - 032301

ER -