Publication:3066830

Publication date: 12 January 2011

orthogonal polynomials; adjacency matrix; density function; Laplacian matrix; graph spectra; eigensystem of matrices; spectra of complex networks

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

94C15: Applications of graph theory to circuits and networks

Related Items

Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices, Emergence of a spectral gap in a class of random matrices associated with split graphs, Random walks with long-range steps generated by functions of Laplacian matrices, Non-Archimedean Models of Morphogenesis, Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?, Prime stars multiplexes, Spectra of bowtie product of graphs, Stationary measures on infinite graphs, Deterministic and Stochastic Mean-Field SIRS Models on Heterogeneous Networks, Universally optimal noisy quantum walks on complex networks, Estimating the epidemic threshold on networks by deterministic connections, Fractional dynamics on circulant multiplex networks: optimal coupling and long-range navigation for continuous-time random walks, Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids, Universality of eigenvector delocalization and the nature of the SIS phase transition in multiplex networks, Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra, A measure of dissimilarity between diffusive processes on networks, Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition, Random matrices with row constraints and eigenvalue distributions of graph Laplacians, Bounding robustness in complex networks under topological changes through majorization techniques, Maximum modular graphs, A transient symmetry analysis for the \(M/M/1/k\) queue, Synchronization of Coupled Phase Oscillators with Stochastic Disturbances and the Cycle Space of the Graph, Robust synchronization of coprime factor perturbed networks, Inequalities for the number of walks in graphs, Matrix power inequalities and the number of walks in graphs, Bounds for the spectral radius of a graph when nodes are removed, On the radius of centrality in evolving communication networks, Graphs with least eigenvalue \(-2\): ten years on, Harmonic analysis on inhomogeneous amenable networks and the Bose-Einstein condensation, Clustering and community detection in directed networks: a survey, Effective graph resistance, Graph spectra in computer science, The \(N\)-intertwined SIS epidemic network model, ILIGRA: an efficient inverse line graph algorithm, A new method optimizing the subgraph centrality of large networks, Degree distribution and assortativity in line graphs of complex networks, Evaluation of an analytic, approximate formula for the time-varying SIS prevalence in different networks, Fundamentals of spreading processes in single and multilayer complex networks, Effect on normalized graph Laplacian spectrum by motif attachment and duplication, Random walks and diffusion on networks, Estimating the state probability distribution for epidemic spreading in complex networks, The spectra and the signless Laplacian spectra of graphs with pockets, Computing the smallest eigenpairs of the graph Laplacian, Time averaged distribution of a discrete-time quantum walk on the path, The impact of the topology on cascading failures in a power grid model, Message survival and decision dynamics in a class of reactive complex systems subject to external fields, Eigenvector perturbations of complex networks, Spread of epidemic-like failures in telecommunication networks, A topological investigation of phase transitions of cascading failures in power grids, Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory, Breather solutions for inhomogeneous FPU models using Birkhoff normal forms, A survey of parameter and state estimation in queues, Pass-and-swap queues, Spectra of \(M\)-edge rooted product of graphs, Lattice fermions as spectral graphs, Dynamics of semiflexible generalized scale-free polymer networks, Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices, Principal eigenvector localization and centrality in networks: revisited, On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Characterising submonolayer deposition via visibility graphs, An individual-based modeling framework for infectious disease spreading in clustered complex networks, Reaction-diffusion equations on complex networks and Turing patterns, via \(p\)-adic analysis, Kemeny's constant for several families of graphs and real-world networks, The complexity measurement and evolution analysis of supply chain network under disruption risks, Dynamic behaviour of competing memes' spread with alert influence in multiplex social-networks, Time-dependent solution of the NIMFA equations around the epidemic threshold, Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks, On the spectral characterizations of graphs, Kemeny's constant and the effective graph resistance, Epidemic spreading over quenched networks with local behavioral response, Tighter spectral bounds for the cut size, based on Laplacian eigenvectors, Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures, Quadratic embedding constants of graph joins, Fair immunization and network topology of complex financial ecosystems, Doubling constants and spectral theory on graphs, Predicting Triadic Closure in Networks Using Communicability Distance Functions, Robustness of random graphs based on graph spectra, The correlation of metrics in complex networks with applications in functional brain networks, Fractional diffusion on circulant networks: emergence of a dynamical small world, CUSUM multi-chart based on nonparametric likelihood approach for detecting unknown abrupt changes and its application for network data, Epidemic Outbreaks in Networks with Equitable or Almost-Equitable Partitions