Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
From MaRDI portal
Publication:5239301
DOI10.1088/1742-5468/2006/08/P08007zbMath1459.05169arXivcond-mat/0605565WikidataQ56689034 ScholiaQ56689034MaRDI QIDQ5239301
Franco Maria Neri, Luca Donetti, Miguel A. Muñoz
Publication date: 22 October 2019
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0605565
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles, Organisational hierarchy constructions with easy Kuramoto synchronisation, Equitable decompositions of graphs with symmetries, Graphs with given diameter maximizing the algebraic connectivity, Sparse network optimization for synchronization, Random walks and diffusion on networks, Design of highly synchronizable and robust networks, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Multicanonical MCMC for sampling rare events: an illustrative review, Complex networks: when random walk dynamics equals synchronization, The correlation of metrics in complex networks with applications in functional brain networks, Metanetworks of artificially evolved regulatory networks, Optimal topological design for distributed estimation over sensor networks, Graphs (networks) with golden spectral ratio, A scoring mechanism for the rank aggregation of network robustness, Probability of graphs with large spectral gap by multicanonical Monte Carlo, Maximizing algebraic connectivity for certain families of graphs, Algebraic connectivity of interdependent networks, On minimum algebraic connectivity of graphs whose complements are bicyclic
Cites Work
- Optimization by Simulated Annealing
- Ramanujan graphs
- The expected eigenvalue distribution of a large regular graph
- On the second eigenvalue of a graph
- Cubic Ramanujan graphs
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Complex networks: structure and dynamics
- Statistical mechanics of complex networks
- Detecting network communities: a new systematic and efficient algorithm
- Symmetric Random Walks on Groups
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- The Spectra of Random Graphs with Given Expected Degrees
- Synchronization in chaotic systems
- Equation of State Calculations by Fast Computing Machines
- Synchronization in scale-free dynamical networks: robustness and fragility
- Exploring complex networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
