Graph spectra for complex networks
From MaRDI portal
Laplacian matrixadjacency matrixorthogonal polynomialsdensity functiongraph spectraeigensystem of matricesspectra of complex networks
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Eigenvalues, singular values, and eigenvectors (15A18) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(only showing first 100 items - show all)- Asymptotic analysis of epidemics on networks
- An introduction to grids, graphs, and networks
- The Laplacian spectra of graphs and complex networks
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- Dynamic behaviour of competing memes' spread with alert influence in multiplex social-networks
- Effective graph resistance
- Estimating the state probability distribution for epidemic spreading in complex networks
- Spectral techniques in complex networks
- On the spectral characterizations of graphs
- Reaction-diffusion equations on complex networks and Turing patterns, via \(p\)-adic analysis
- Bounds for the spectral radius of a graph when nodes are removed
- 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
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors
- Complex networks: structure and functionality
- Fundamentals of spreading processes in single and multilayer complex networks
- A topological investigation of phase transitions of cascading failures in power grids
- Kemeny's constant and the effective graph resistance
- Non-Archimedean models of morphogenesis
- Random walks and diffusion on networks
- On spectra of spectra
- Universality of eigenvector delocalization and the nature of the SIS phase transition in multiplex networks
- A new method optimizing the subgraph centrality of large networks
- Evaluation of an analytic, approximate formula for the time-varying SIS prevalence in different networks
- Computing the smallest eigenpairs of the graph Laplacian
- The impact of the topology on cascading failures in a power grid model
- Spread of epidemic-like failures in telecommunication networks
- The mathematics of finite networks. An introduction to operator graph theory
- Random walks with stochastic resetting in complex networks: a discrete-time approach
- Eigenvectors from eigenvalues: a survey of a basic identity in linear algebra
- Graph spectra in computer science
- Epidemic spreading over quenched networks with local behavioral response
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Quadrature formulas on combinatorial graphs
- A transient symmetry analysis for the M/M/1/k queue
- Optimization of stochastic lossy transport networks and applications to power grids
- Estimating the epidemic threshold on networks by deterministic connections
- Eigenvector perturbations of complex networks
- The N-intertwined SIS epidemic network model
- The spectra and the signless Laplacian spectra of graphs with pockets
- Robust synchronization of coprime factor perturbed networks
- Synchronization of Coupled Phase Oscillators with Stochastic Disturbances and the Cycle Space of the Graph
- A measure of dissimilarity between diffusive processes on networks
- Principal eigenvector localization and centrality in networks: revisited
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- On the spectra of wreath products of circulant graphs
- Time-dependent solution of the NIMFA equations around the epidemic threshold
- Complex graphs and networks
- Spectral plot properties: towards a qualitative classification of networks
- Hammerstein equations for sparse random matrices
- Dynamics of semiflexible generalized scale-free polymer networks
- Spectral density of complex networks with two species of nodes
- Spectra of bowtie product of graphs
- Matrix power inequalities and the number of walks in graphs
- Eigenvalue bounds of the Kirchhoff Laplacian
- Deterministic and stochastic mean-field SIRS models on heterogeneous networks
- Fractional dynamics on circulant multiplex networks: optimal coupling and long-range navigation for continuous-time random walks
- Random walks with long-range steps generated by functions of Laplacian matrices
- Fractional diffusion on circulant networks: emergence of a dynamical small world
- Evanescent random Walker on networks: hitting times, budget renewal, and survival dynamics
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- A novel measure of edge and vertex centrality for assessing robustness in complex networks
- Message survival and decision dynamics in a class of reactive complex systems subject to external fields
- Robust network formation with biological applications
- Maximum modular graphs
- Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
- On spectrum of networks based on matrix of link-state and its symmetry
- Characterising submonolayer deposition via visibility graphs
- Kemeny's constant for several families of graphs and real-world networks
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- Spectral properties of complex networks
- A survey of parameter and state estimation in queues
- Pass-and-swap queues
- Polyhedral geometry and combinatorics of an autocatalytic ecosystem
- Centrality measures to control epidemic spreading on uniform hypergraphs or hypernetworks
- Graph Spectra for Complex Networks
- An individual-based modeling framework for infectious disease spreading in clustered complex networks
- Time averaged distribution of a discrete-time quantum walk on the path
- Eigenvalue spectra of complex networks
- Degree distribution and assortativity in line graphs of complex networks
- ILIGRA: an efficient inverse line graph algorithm
- On the radius of centrality in evolving communication networks
- Signless Laplacian spectral conditions for extremal quadrilateral and star embeddings
- Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?
- Graphs with least eigenvalue -2: ten years on
- Spectra of \(M\)-edge rooted product of graphs
- Clustering and community detection in directed networks: a survey
- The correlation of metrics in complex networks with applications in functional brain networks
- Stationary measures on infinite graphs
- CUSUM multi-chart based on nonparametric likelihood approach for detecting unknown abrupt changes and its application for network data
- Structural, Syntactic, and Statistical Pattern Recognition
- Epidemic outbreaks in networks with equitable or almost-equitable partitions
- Fair immunization and network topology of complex financial ecosystems
- Prime stars multiplexes
- Predicting triadic closure in networks using communicability distance functions
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Isospectral transformations. A new approach to analyzing multidimensional systems and networks
- Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices
- Harmonic analysis on inhomogeneous amenable networks and the Bose-Einstein condensation
- On the initial value of PageRank
This page was built for publication: Graph spectra for complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066830)
