Cherifi / Mantegna / Micciche | Complex Networks and Their Applications XI | Buch | 978-3-031-21133-1 | sack.de

Buch, Englisch, Band 1078, 686 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1189 g

Reihe: Studies in Computational Intelligence

Cherifi / Mantegna / Micciche

Complex Networks and Their Applications XI

Proceedings of The Eleventh International Conference on Complex Networks and their Applications: COMPLEX NETWORKS 2022 ¿ Volume 2

Buch, Englisch, Band 1078, 686 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1189 g

Reihe: Studies in Computational Intelligence

ISBN: 978-3-031-21133-1
Verlag: Springer International Publishing


This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XI International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2022). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks and technological networks.
Cherifi / Mantegna / Micciche Complex Networks and Their Applications XI jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Part I: Network Models.- Modularity of the ABCD Random Graph Model with Community Structure.- Learning Attribute Distributions Through Random Walks.- A More Powerful Heuristic for Balancing An Unbalanced Graph.- DC-RST: A Parallel Algorithm for Random Spanning Trees in Network Analytics.- A stochastic approach for extracting community-based backbones.- Correcting Output Distributions in Chung-Lu Random Graph Generation.- After We Fight I Like You More: A Controlled Adaptive Network Model for the Effects of Interpersonal Synchrony Transitions on Affiliation.- Uniformly Scattering Neighboring Nodes of an Ego-centric Network on a Spherical Surface for Better Network Visualization.- The Hyperbolic Geometric Block Model and Networks with Latent and Explicit Geometries.- A Biased Random Walk Scale-Free Network Growth Model with tunable Clustering.- The distance backbone of directed networks.- Part II: Community Structure.- Structure of Core-Periphery Communities.- Outliers in the ABCD RandomGraph Model with Community Structure (ABCD+o).- Influence-based Community Deception.- AutoGF: Runtime Graph Filter Tuning for Community Node Ranking.- Dynamic Local Community Detection with Anchors.- Community Detection Supported by Node Embeddings (Searching For a Suitable Method).- Modeling Node Exposure for Community Detection in Networks.- Community Detection for Temporal Weighted Bipartite Networks.- Robustness and sensitivity of network-based topic detection.- Community Detection using Moore-Shannon Network Reliability: Application to Food Networks.- Part III: Structural Network Measures.- Winner does not take all: contrasting centrality in adversarial networks.- Reconstructing degree distribution and triangle counts from edge-sampled graphs.- Generalizing Homophily to Simplicial Complexes.- Statistical network similarity.- Intersection of random spanning trees in small-world networks.- Node Classification Based on Non-symmetric Dependencies and Graph Neural Networks.- Mean Hitting Time of Q-subdivision Complex Networks.- Delta density: comparison of different sized networks irrespective of their size.- Part IV: Resilence and Robustness of Networks.- Robustness of Network Controllability with respect to Node Removals.- Optimal network robustness in continuously changing degree distributions.- Investments in Robustness of Complex Systems: Algorithm Design.- Incremental computation of effective graph resistance for improving robustness of complex networks: a comparative study.- Analysis on the effects of graph perturbations on centrality metrics.- Robustness of Preferential-Attachment Graphs: Shifting the Baseline.- The vertex-edge separator transformation problem in network dismantling.- Part V: Network Analysis.- Gig economy and social network analysis: topology of inferred network.- Understanding sectoral integration in energy systems through complex network analysis.- An analysis of Bitcoin dust through authenticated queries.- Optimal bond percolation in networks by a fast-decycling framework.- Part VI: Motif Discovery in Complex Networks.- Integrating Temporal Graphs via Dual Networks: Dense.- Graph Discovery.- Exploring and mining attributed sequences of interactions.- Air transport network: A comparison of statistical backbone filtering techniques.- Towards the Concept of Spatial Network Motifs.- Improving the characterization and comparison of football players with spatial flow motifs.- Part VII: Dynamics on/of Networks.- Bayesian Approach to Uncertainty Visualization of Heterogeneous Behaviors in Modeling Networked Anagram Games.- Understanding the Inter-Enterprise Competitive Relationship based on the Link Prediction Method: Experience from Z-Park.- Analyzing Configuration Transitions Associated with Higher-Order Link Occurrences in Networks of Cooking Ingredients.- Role of network topology in between-community beta diversity on river networks.- Can you hear the position of nodes?.- Memory Based Temporal Network Prediction.- Drug Trafficking in Relation to Global Shipping Network.- Understanding the Inter-Enterprise Competitive Relationship based on the Link Prediction Method: Experience from Z-Park.- Analyzing Configuration Transitions Associated with Higher-Order Link Occurrences in Networks of Cooking Ingredients.- Role of network topology in between-community beta diversity on river networks.- Can you hear the position of nodes?.- Memory Based Temporal Network Prediction.- Drug Trafficking in Relation to Global Shipping Network.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.