Abstract
The power series expansion of functions of the adjacency matrix for a network can be interpreted in terms of walks in the network. This makes matrix functions, such as the exponential or resolvent, useful for the analysis of graphs. For instance, these functions shed light on the relative importance of the nodes of the graph and on the overall connectivity. However, the power series expansions may converge slowly, and the coefficients of these expansions typically are not helpful in assessing how important longer walks are in the network. Expansions of matrix functions in terms of orthogonal or bi-orthogonal polynomials make it possible to determine scaling parameters so that a given network has a specified effective diameter (the length after which walks become essentially irrelevant for the connectivity of the network). We describe several approaches for generating orthogonal and bi-orthogonal polynomial expansions, and discuss their relative merits for network analysis.
Sign-in/Register to access full text options 
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.
