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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
