The following pages link to (Q3066830):
Displayed 50 items.
- Robust synchronization of coprime factor perturbed networks (Q305628) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
- Bounds for the spectral radius of a graph when nodes are removed (Q417595) (← links)
- On the radius of centrality in evolving communication networks (Q489692) (← links)
- Graphs with least eigenvalue \(-2\): ten years on (Q491141) (← links)
- Harmonic analysis on inhomogeneous amenable networks and the Bose-Einstein condensation (Q513152) (← links)
- Clustering and community detection in directed networks: a survey (Q514409) (← links)
- Effective graph resistance (Q550630) (← links)
- Graph spectra in computer science (Q627958) (← links)
- The \(N\)-intertwined SIS epidemic network model (Q652555) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- A new method optimizing the subgraph centrality of large networks (Q1619035) (← links)
- Degree distribution and assortativity in line graphs of complex networks (Q1619123) (← links)
- Evaluation of an analytic, approximate formula for the time-varying SIS prevalence in different networks (Q1620470) (← links)
- Fundamentals of spreading processes in single and multilayer complex networks (Q1632522) (← links)
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication (Q1643317) (← links)
- Random walks and diffusion on networks (Q1687598) (← links)
- Estimating the state probability distribution for epidemic spreading in complex networks (Q1733745) (← links)
- The spectra and the signless Laplacian spectra of graphs with pockets (Q1740160) (← links)
- Computing the smallest eigenpairs of the graph Laplacian (Q1742851) (← links)
- Time averaged distribution of a discrete-time quantum walk on the path (Q1757883) (← links)
- The impact of the topology on cascading failures in a power grid model (Q1782701) (← links)
- Message survival and decision dynamics in a class of reactive complex systems subject to external fields (Q1782825) (← links)
- Eigenvector perturbations of complex networks (Q1782919) (← links)
- Spread of epidemic-like failures in telecommunication networks (Q1782989) (← links)
- A topological investigation of phase transitions of cascading failures in power grids (Q1783167) (← links)
- Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory (Q2000728) (← links)
- Breather solutions for inhomogeneous FPU models using Birkhoff normal forms (Q2001014) (← links)
- A survey of parameter and state estimation in queues (Q2052430) (← links)
- Pass-and-swap queues (Q2052797) (← links)
- Spectra of \(M\)-edge rooted product of graphs (Q2065401) (← links)
- Lattice fermions as spectral graphs (Q2087256) (← links)
- Dynamics of semiflexible generalized scale-free polymer networks (Q2088240) (← links)
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices (Q2100847) (← links)
- Principal eigenvector localization and centrality in networks: revisited (Q2139311) (← links)
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain (Q2141848) (← links)
- A novel measure of edge and vertex centrality for assessing robustness in complex networks (Q2156532) (← links)
- Characterising submonolayer deposition via visibility graphs (Q2163922) (← links)
- An individual-based modeling framework for infectious disease spreading in clustered complex networks (Q2182926) (← links)
- Reaction-diffusion equations on complex networks and Turing patterns, via \(p\)-adic analysis (Q2195160) (← links)
- Kemeny's constant for several families of graphs and real-world networks (Q2197408) (← links)
- The complexity measurement and evolution analysis of supply chain network under disruption risks (Q2201339) (← links)
- Dynamic behaviour of competing memes' spread with alert influence in multiplex social-networks (Q2218463) (← links)
- Time-dependent solution of the NIMFA equations around the epidemic threshold (Q2219258) (← links)
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks (Q2349562) (← links)
- On the spectral characterizations of graphs (Q2364092) (← links)
- Kemeny's constant and the effective graph resistance (Q2408952) (← links)
- Epidemic spreading over quenched networks with local behavioral response (Q2410519) (← links)
- Tighter spectral bounds for the cut size, based on Laplacian eigenvectors (Q2419023) (← links)