Network analysis using entropy component analysis | Zendy

Cheng Ye | Zendy; Richard C. Wilson | Zendy; Edwin R. Hancock | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Network analysis using entropy component analysis

Author(s) -

Cheng Ye,

Richard C. Wilson,

Edwin R. Hancock

Publication year - 2017

Publication title -

journal of complex networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.555

H-Index - 23

eISSN - 2051-1329

pISSN - 2051-1310

DOI - 10.1093/comnet/cnx045

Subject(s) - entropy (arrow of time) , histogram , degree distribution , computer science , mathematics , vertex (graph theory) , pattern recognition (psychology) , graph , algorithm , combinatorics , complex network , artificial intelligence , physics , quantum mechanics , image (mathematics)

Structural complexity measures have found widespread use in network analysis. For instance, entropy can be used to distinguish between different structures. Recently, we have reported an approximate network von Neumann entropy measure, which can be conveniently expressed in terms of the degree configurations associated with the vertices that define the edges in both undirected and directed graphs....

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research