Pages that link to "Item:Q3066235"

The following pages link to Network Properties Revealed through Matrix Functions (Q3066235):

Displaying 50 items.

• New block quadrature rules for the approximation of matrix functions (Q281984) (← links)
• Generalized averaged Gauss quadrature rules for the approximation of matrix functionals (Q329025) (← links)
• Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs (Q342925) (← links)
• Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
• The walk distances in graphs (Q427888) (← links)
• On the radius of centrality in evolving communication networks (Q489692) (← links)
• Convergence rates for inverse-free rational approximation of matrix functions (Q501246) (← links)
• Accounting for the role of long walks on networks via a new matrix function (Q509007) (← links)
• \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
• The ABC matrix (Q683857) (← links)
• Simplified anti-Gauss quadrature rules with applications in linear algebra (Q684193) (← links)
• Betweenness in time dependent networks (Q728337) (← links)
• Centrality measures for node-weighted networks via line graphs and the matrix exponential (Q820712) (← links)
• Double Gaussianization of graph spectra (Q823400) (← links)
• A note on the graph's resolvent and the multifilar structure (Q837015) (← links)
• Returnability in complex directed networks (digraphs) (Q1014455) (← links)
• Gaussianization of the spectra of graphs and networks. Theory and applications (Q1630605) (← links)
• On the exponential generating function for non-backtracking walks (Q1669018) (← links)
• Maximal Estrada index of unicyclic graphs with perfect matching (Q1676996) (← links)
• Generalized walks-based centrality measures for complex biological networks (Q1715403) (← links)
• Ranking hubs and authorities using matrix functions (Q1938702) (← links)
• The e-MoM approach for approximating matrix functionals (Q1989169) (← links)
• Synchronizability of two neurons with switching in the coupling (Q2009253) (← links)
• Orthogonal expansion of network functions (Q2022395) (← links)
• Shifted extended global Lanczos processes for trace estimation with application to network analysis (Q2035644) (← links)
• Dynamic Katz and related network measures (Q2085424) (← links)
• Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number (Q2093515) (← links)
• The many facets of the Estrada indices of graphs and networks (Q2128861) (← links)
• Ordering starlike trees by the totality of their spectral moments (Q2140999) (← links)
• On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices (Q2163448) (← links)
• A spectral method to detect community structure based on the communicability modularity (Q2164584) (← links)
• Tuned communicability metrics in networks. The case of alternative routes for urban traffic (Q2201378) (← links)
• Functions and eigenvectors of partially known matrices with applications to network analysis (Q2227656) (← links)
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations (Q2228533) (← links)
• Estimating the error in matrix function approximations (Q2230689) (← links)
• Block matrix models for dynamic networks (Q2242768) (← links)
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature (Q2249727) (← links)
• Edge importance in a network via line graphs and the matrix exponential (Q2290932) (← links)
• Computing performability measures in Markov chains by means of matrix functions (Q2292012) (← links)
• Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas (Q2297101) (← links)
• A Fiedler center for graphs generalizing the characteristic set (Q2332427) (← links)
• Generalized block anti-Gauss quadrature rules (Q2334059) (← links)
• Bounding matrix functionals via partial global block Lanczos decomposition (Q2347487) (← links)
• Network bipartivity and the transportation efficiency of European passenger airlines (Q2357544) (← links)
• On the convergence of the minimally irreducible Markov chain method with applications to PageRank (Q2363682) (← links)
• A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching (Q2408146) (← links)
• Some bounds for total communicability of graphs (Q2418987) (← links)
• Subgraph centrality and walk-regularity (Q2419001) (← links)
• Topological melting in networks of granular materials (Q2419202) (← links)
• The increase in the resolvent energy of a graph due to the addition of a new edge (Q2423029) (← links)