Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib
| Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib |
| Autore | Dehmer Matthias |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Weinheim, : Wiley-VCH, c2009 |
| Descrizione fisica | 1 online resource (482 p.) |
| Disciplina | 515 |
| Altri autori (Persone) |
DehmerMatthias <1968->
Emmert-StreibFrank |
| Soggetto topico |
Mathematical analysis
Information networks Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-282-68269-5
9786612682698 3-527-62798-7 3-527-62799-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Analysis of Complex Networks From Biology to Linguistics; Contents; Preface; List of Contributors; 1 Entropy, Orbits, and Spectra of Graphs; 1.1 Introduction; 1.2 Entropy or the Information Content of Graphs; 1.3 Groups and Graph Spectra; 1.4 Approximating Orbits; 1.4.1 The Degree of the Vertices; 1.4.2 The Point-Deleted Neighborhood Degree Vector; 1.4.3 Betweenness Centrality; 1.5 Alternative Bases for Structural Complexity; References; 2 Statistical Mechanics of Complex Networks; 2.1 Introduction; 2.1.1 Network Entropies; 2.1.2 Network Hamiltonians; 2.1.3 Network Ensembles
2.1.4 Some Definitions of Network Measures2.2 Macroscopics: Entropies for Networks; 2.2.1 A General Set of Network Models Maximizing Generalized Entropies; 2.2.1.1 A Unified Network Model; 2.2.1.2 Famous Limits of the Unified Model; 2.2.1.3 Unified Model: Additional Features; 2.3 Microscopics: Hamiltonians of Networks - Network Thermodynamics; 2.3.1 Topological Phase Transitions; 2.3.2 A Note on Entropy; 2.4 Ensembles of Random Networks - Superstatistics; 2.5 Conclusion; References; 3 A Simple Integrated Approach to Network Complexity and Node Centrality; 3.1 Introduction 3.2 The Small-World Connectivity Descriptors3.3 The Integrated Centrality Measure; References; 4 Spectral Theory of Networks: From Biomolecular to Ecological Systems; 4.1 Introduction; 4.2 Background on Graph Spectra; 4.3 Spectral Measures of Node Centrality; 4.3.1 Subgraph Centrality as a Partition Function; 4.3.2 Application; 4.4 Global Topological Organization of Complex Networks; 4.4.1 Spectral Scaling Method; 4.4.2 Universal Topological Classes of Networks; 4.4.3 Applications; 4.5 Communicability in Complex Networks; 4.5.1 Communicability and Network Communities 4.5.2 Detection of Communities: The Communicability Graph4.5.3 Application; 4.6 Network Bipartivity; 4.6.1 Detecting Bipartite Substructures in Complex Networks; 4.6.2 Application; 4.7 Conclusion; References; 5 On the Structure of Neutral Networks of RNA Pseudoknot Structures; 5.1 Motivation and Background; 5.1.1 Notation and Terminology; 5.2 Preliminaries; 5.3 Connectivity; 5.4 The Largest Component; 5.5 Distances in n-Cubes; 5.6 Conclusion; References; 6 Graph Edit Distance - Optimal and Suboptimal Algorithms with Applications; 6.1 Introduction; 6.2 Graph Edit Distance 6.3 Computation of GED6.3.1 Optimal Algorithms; 6.3.2 Suboptimal Algorithms; 6.3.2.1 Bipartite Graph Matching; 6.4 Applications; 6.4.1 Graph Data Sets; 6.4.2 GED-Based Nearest-Neighbor Classification; 6.4.3 Dissimilarity-Based Embedding Graph Kernels; 6.5 Experimental Evaluation; 6.5.1 Optimal vs. Suboptimal Graph Edit Distance; 6.5.2 Dissimilarity Embedding Graph Kernels Based on Suboptimal Graph Edit Distance; 6.6 Summary and Conclusions; References; 7 Graph Energy; 7.1 Introduction; 7.2 Bounds for the Energy of Graphs; 7.2.1 Some Upper Bounds; 7.2.2 Some Lower Bounds 7.3 Hyperenergetic, Hypoenergetic, and Equienergetic Graphs |
| Record Nr. | UNINA-9910139802803321 |
Dehmer Matthias
|
||
| Weinheim, : Wiley-VCH, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib
| Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib |
| Autore | Dehmer Matthias |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Weinheim, : Wiley-VCH, c2009 |
| Descrizione fisica | 1 online resource (482 p.) |
| Disciplina | 515 |
| Altri autori (Persone) |
DehmerMatthias <1968->
Emmert-StreibFrank |
| Soggetto topico |
Mathematical analysis
Information networks Graph theory |
| ISBN |
1-282-68269-5
9786612682698 3-527-62798-7 3-527-62799-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Analysis of Complex Networks From Biology to Linguistics; Contents; Preface; List of Contributors; 1 Entropy, Orbits, and Spectra of Graphs; 1.1 Introduction; 1.2 Entropy or the Information Content of Graphs; 1.3 Groups and Graph Spectra; 1.4 Approximating Orbits; 1.4.1 The Degree of the Vertices; 1.4.2 The Point-Deleted Neighborhood Degree Vector; 1.4.3 Betweenness Centrality; 1.5 Alternative Bases for Structural Complexity; References; 2 Statistical Mechanics of Complex Networks; 2.1 Introduction; 2.1.1 Network Entropies; 2.1.2 Network Hamiltonians; 2.1.3 Network Ensembles
2.1.4 Some Definitions of Network Measures2.2 Macroscopics: Entropies for Networks; 2.2.1 A General Set of Network Models Maximizing Generalized Entropies; 2.2.1.1 A Unified Network Model; 2.2.1.2 Famous Limits of the Unified Model; 2.2.1.3 Unified Model: Additional Features; 2.3 Microscopics: Hamiltonians of Networks - Network Thermodynamics; 2.3.1 Topological Phase Transitions; 2.3.2 A Note on Entropy; 2.4 Ensembles of Random Networks - Superstatistics; 2.5 Conclusion; References; 3 A Simple Integrated Approach to Network Complexity and Node Centrality; 3.1 Introduction 3.2 The Small-World Connectivity Descriptors3.3 The Integrated Centrality Measure; References; 4 Spectral Theory of Networks: From Biomolecular to Ecological Systems; 4.1 Introduction; 4.2 Background on Graph Spectra; 4.3 Spectral Measures of Node Centrality; 4.3.1 Subgraph Centrality as a Partition Function; 4.3.2 Application; 4.4 Global Topological Organization of Complex Networks; 4.4.1 Spectral Scaling Method; 4.4.2 Universal Topological Classes of Networks; 4.4.3 Applications; 4.5 Communicability in Complex Networks; 4.5.1 Communicability and Network Communities 4.5.2 Detection of Communities: The Communicability Graph4.5.3 Application; 4.6 Network Bipartivity; 4.6.1 Detecting Bipartite Substructures in Complex Networks; 4.6.2 Application; 4.7 Conclusion; References; 5 On the Structure of Neutral Networks of RNA Pseudoknot Structures; 5.1 Motivation and Background; 5.1.1 Notation and Terminology; 5.2 Preliminaries; 5.3 Connectivity; 5.4 The Largest Component; 5.5 Distances in n-Cubes; 5.6 Conclusion; References; 6 Graph Edit Distance - Optimal and Suboptimal Algorithms with Applications; 6.1 Introduction; 6.2 Graph Edit Distance 6.3 Computation of GED6.3.1 Optimal Algorithms; 6.3.2 Suboptimal Algorithms; 6.3.2.1 Bipartite Graph Matching; 6.4 Applications; 6.4.1 Graph Data Sets; 6.4.2 GED-Based Nearest-Neighbor Classification; 6.4.3 Dissimilarity-Based Embedding Graph Kernels; 6.5 Experimental Evaluation; 6.5.1 Optimal vs. Suboptimal Graph Edit Distance; 6.5.2 Dissimilarity Embedding Graph Kernels Based on Suboptimal Graph Edit Distance; 6.6 Summary and Conclusions; References; 7 Graph Energy; 7.1 Introduction; 7.2 Bounds for the Energy of Graphs; 7.2.1 Some Upper Bounds; 7.2.2 Some Lower Bounds 7.3 Hyperenergetic, Hypoenergetic, and Equienergetic Graphs |
| Record Nr. | UNINA-9910830301503321 |
|
Dehmer Matthias
|
||
| Weinheim, : Wiley-VCH, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib
| Analysis of complex networks [[electronic resource] ] : from biology to linguistics / / edited by Matthias Dehmer and Frank Emmert-Streib |
| Autore | Dehmer Matthias |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Weinheim, : Wiley-VCH, c2009 |
| Descrizione fisica | 1 online resource (482 p.) |
| Disciplina | 515 |
| Altri autori (Persone) |
DehmerMatthias <1968->
Emmert-StreibFrank |
| Soggetto topico |
Mathematical analysis
Information networks Graph theory |
| ISBN |
1-282-68269-5
9786612682698 3-527-62798-7 3-527-62799-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Analysis of Complex Networks From Biology to Linguistics; Contents; Preface; List of Contributors; 1 Entropy, Orbits, and Spectra of Graphs; 1.1 Introduction; 1.2 Entropy or the Information Content of Graphs; 1.3 Groups and Graph Spectra; 1.4 Approximating Orbits; 1.4.1 The Degree of the Vertices; 1.4.2 The Point-Deleted Neighborhood Degree Vector; 1.4.3 Betweenness Centrality; 1.5 Alternative Bases for Structural Complexity; References; 2 Statistical Mechanics of Complex Networks; 2.1 Introduction; 2.1.1 Network Entropies; 2.1.2 Network Hamiltonians; 2.1.3 Network Ensembles
2.1.4 Some Definitions of Network Measures2.2 Macroscopics: Entropies for Networks; 2.2.1 A General Set of Network Models Maximizing Generalized Entropies; 2.2.1.1 A Unified Network Model; 2.2.1.2 Famous Limits of the Unified Model; 2.2.1.3 Unified Model: Additional Features; 2.3 Microscopics: Hamiltonians of Networks - Network Thermodynamics; 2.3.1 Topological Phase Transitions; 2.3.2 A Note on Entropy; 2.4 Ensembles of Random Networks - Superstatistics; 2.5 Conclusion; References; 3 A Simple Integrated Approach to Network Complexity and Node Centrality; 3.1 Introduction 3.2 The Small-World Connectivity Descriptors3.3 The Integrated Centrality Measure; References; 4 Spectral Theory of Networks: From Biomolecular to Ecological Systems; 4.1 Introduction; 4.2 Background on Graph Spectra; 4.3 Spectral Measures of Node Centrality; 4.3.1 Subgraph Centrality as a Partition Function; 4.3.2 Application; 4.4 Global Topological Organization of Complex Networks; 4.4.1 Spectral Scaling Method; 4.4.2 Universal Topological Classes of Networks; 4.4.3 Applications; 4.5 Communicability in Complex Networks; 4.5.1 Communicability and Network Communities 4.5.2 Detection of Communities: The Communicability Graph4.5.3 Application; 4.6 Network Bipartivity; 4.6.1 Detecting Bipartite Substructures in Complex Networks; 4.6.2 Application; 4.7 Conclusion; References; 5 On the Structure of Neutral Networks of RNA Pseudoknot Structures; 5.1 Motivation and Background; 5.1.1 Notation and Terminology; 5.2 Preliminaries; 5.3 Connectivity; 5.4 The Largest Component; 5.5 Distances in n-Cubes; 5.6 Conclusion; References; 6 Graph Edit Distance - Optimal and Suboptimal Algorithms with Applications; 6.1 Introduction; 6.2 Graph Edit Distance 6.3 Computation of GED6.3.1 Optimal Algorithms; 6.3.2 Suboptimal Algorithms; 6.3.2.1 Bipartite Graph Matching; 6.4 Applications; 6.4.1 Graph Data Sets; 6.4.2 GED-Based Nearest-Neighbor Classification; 6.4.3 Dissimilarity-Based Embedding Graph Kernels; 6.5 Experimental Evaluation; 6.5.1 Optimal vs. Suboptimal Graph Edit Distance; 6.5.2 Dissimilarity Embedding Graph Kernels Based on Suboptimal Graph Edit Distance; 6.6 Summary and Conclusions; References; 7 Graph Energy; 7.1 Introduction; 7.2 Bounds for the Energy of Graphs; 7.2.1 Some Upper Bounds; 7.2.2 Some Lower Bounds 7.3 Hyperenergetic, Hypoenergetic, and Equienergetic Graphs |
| Record Nr. | UNINA-9910840815503321 |
|
Dehmer Matthias
|
||
| Weinheim, : Wiley-VCH, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||