scientific article

Publication date: 22 November 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items

Centrality measures for node-weighted networks via line graphs and the matrix exponential, On Distance Signless Laplacian Estrada Index and Energy of Graphs, COVID-19 and SARS-CoV-2. Modeling the present, looking at the future, New block quadrature rules for the approximation of matrix functions, An optimization model for minimizing systemic risk, The many facets of the Estrada indices of graphs and networks, Network bipartitioning in the anti-communicability Euclidean space, Equitable partition and star set formulas for the subgraph centrality of graphs, Graphs with maximum Laplacian and signless Laplacian Estrada index, On generalized adjacency Estrada index of graphs, The expected adjacency and modularity matrices in the degree corrected stochastic block model, Updating and Downdating Techniques for Optimizing Network Communicability, Generalized averaged Gauss quadrature rules for the approximation of matrix functionals, Statistical-mechanical theory of topological indices, Concentric network symmetry, From networked SIS model to the Gompertz function, A bag-of-paths framework for network data analysis, Higher order assortativity in complex networks, Explosive synchronization in populations of cooperative and competitive oscillators, Degree-biased advection–diffusion on undirected graphs/networks, Subgraph centrality and walk-regularity, Bounds on the \(\alpha \)-distance energy and \(\alpha \)-distance Estrada index of graphs, Topological melting in networks of granular materials, Random walks and diffusion on networks, Matrix functions in network analysis, Perron communicability and sensitivity of multilayer networks, Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds, Complexity is a matter of distance, Analysis of directed networks via the matrix exponential, Hierarchical Network Models for Exchangeable Structured Interaction Processes, Spectral analysis of weighted neighborhood networks, The structure and dynamics of networks with higher order interactions, Controlling centrality: The inverse ranking problem for spectral centralities of complex networks, Communicability cosine distance: similarity and symmetry in graphs/networks, Tuned communicability metrics in networks. The case of alternative routes for urban traffic, Long-Range Interactions and Network Synchronization, Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease, A note on walk entropies in graphs, Metaplex Networks: Influence of the Exo-Endo Structure of Complex Systems on Diffusion, Risk-Dependent Centrality in Economic and Financial Networks, Functions and eigenvectors of partially known matrices with applications to network analysis, New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks, Estimating the error in matrix function approximations, On coindices of graphs and their complements, Chimeras, \texttt{PQser:} a Matlab package for spectral seriation, Two-walks degree assortativity in graphs and networks, A relaxed version of Šoltés's problem and cactus graphs, Block matrix models for dynamic networks, A note on some bounds of the \(\alpha\)-Estrada index of graphs, The ABC matrix, The accumulative law and its probability model: an extension of the Pareto distribution and the log-normal distribution, Hubs-biased resistance distances on graphs and networks, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, Second-order consensus protocols based on transformed \(d\)-path Laplacians, Synchronizability of two neurons with switching in the coupling, Orthogonal expansion of network functions, Developments in the theory of randomized shortest paths with a comparison of graph node distances, Community Detection in Networks via Nonlinear Modularity Eigenvectors, ``Melting of complex networks. A mathematical model of complex networks resilience to external stress, Sparse randomized shortest paths routing with Tsallis divergence regularization, Edge importance in a network via line graphs and the matrix exponential, `Hubs-repelling' Laplacian and related diffusion on graphs/networks, Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels, Spatiotemporal patterns in a 2D lattice with linear repulsive and nonlinear attractive coupling, The synchronized dynamics of time-varying networks, Generalized block anti-Gauss quadrature rules, An algorithm to compute data diversity index in spatial networks, Nonlocal pagerank, On the distance signless Laplacian Estrada index of graphs, Where to cut to delay a pandemic with minimum disruption? mathematical analysis based on the SIS model