Complex Networks and Their Applications VII

Name: Complex Networks and Their Applications VII | Volume 1 Proceedings The 7th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2018
Brand: Springer
Price: 213.99 EUR
Availability: OnlineOnly

Volume 1 Proceedings The 7th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2018

Luca Maria Aiello Chantal Cherifi Hocine Cherifi Renaud Lambiotte Pietro Lió Luis M. Rocha(Editor)

Springer (Publisher)

Published on 1. December 2018

XXVII, 893 pages

E-Book

PDF with digital watermarking

System requirements

978-3-030-05411-3 (ISBN)

€213.99incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization and Committees
General Chairs
Advisory Board
Program Co-chairs
Poster Chairs
Lightning Chairs
Media and Publicity Chairs
Tutorial Chairs
Local Chairs
Local Committee
Publication Chair
Submission Chair
Web Chair
Program Committee
Contents
Link Analysis and Ranking
A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity
1 Introduction
2 Related Work
3 Proposed Measure
3.1 Connectedness Centrality
3.2 Solution Algorithm
3.3 Group-Connectedness Centrality
4 Experimental Settings
5 Experimental Results
5.1 Visualization of Representatives and Their Clusters
5.2 Stability with Respect to the Number of Simulations
5.3 Reachability Under Link Cutting
5.4 Computation Time
6 Conclusion
References
Walk Prediction in Directed Networks
1 Introduction
2 Related Works
3 Proposed Model
3.1 Preference/Attraction Score
3.2 Learning the Model
4 Evaluation
4.1 Dataset
4.2 Baseline Methods
4.3 Results
5 Conclusions
References
Average-Case Behavior of k-Shortest Path Algorithms
1 Introduction
2 Related Work
3 Algorithms
3.1 Yen's Algorithm
3.2 Feng's Algorithm
4 Average-Case Analysis of Yen's Algorithm
4.1 Empirical Results on Average-Case Behavior of Yen's Algorithm
5 Average-Case Analysis of Feng's Algorithm
5.1 Empirical Results on Feng's Average-Case Behavior
6 Conclusion
References
Scaling of Random Walk Betweenness in Networks
1 Introduction
2 Random Walk Betweenness
2.1 Numerical Results
3 Normalized Random Walk Betweenness
3.1 Numerical Results
4 Conclusions
References
Fast Approximated Betweenness Centrality of Directed and Weighted Graphs
1 Introduction
2 Related Work
3 Fast BC Computation of Weighted and Directed Graphs
3.1 Notation
3.2 Brandes' Algorithm
3.3 Weighted Modularity and Louvain Method
3.4 W2C-FastBC
4 Evaluation: Dynamic Analysis of a Real-World Road Network
5 Conclusion
References
Node Ordering for Rescalable Network Summarization (or, the Apparent Magic of Word Frequency and Age of Acquisition in the Lexicon)
1 Introduction
2 The Node Ordering Problem: Approximating Degree
3 Related Work
4 Case Study: Word Recognition and the Phonological Network
5 Discussion and Future Directions
References
Systematic Biases in Link Prediction: Comparing Heuristic and Graph Embedding Based Methods
1 Introduction
2 Link Prediction Evaluation Framework
2.1 Creation of Learning and Prediction Sets
2.2 Link Prediction
2.3 Choice of an Appropriate Score Function
3 Methods Evaluation
3.1 Method Based on Heuristics
3.2 Methods Based on Graph Embeddings
3.3 Results
4 Analysis of Systematic Biases
4.1 Graph Distance
4.2 Node Degree
4.3 Community Structure
5 Discussion: Effect of Biases on Recommender Systems
6 Conclusion
References
Stability and Similarity in Networks Based on Topology and Nodes Importance
Abstract
1 Introduction
2 Stability and Similarity of Network
2.1 Network Transformation
2.2 Nodes Similarity Using Interval Orders
2.3 Similarity of Network Topology
2.4 Stability and Similarity Measure
3 Empirical Application: International Migration Network
4 Conclusion
Acknowledgments
References
Delusive PageRank in Incomplete Graphs
1 Introduction
2 Related Work
3 Preliminaries and Problem
4 The HAK Measure
5 Experiments
6 Conclusion
References
Centrality Maps for Moving Nodes
1 Introduction
2 Centrality Maps
2.1 Calculation of
2.2 Distribution of
3 Applying Centrality Maps to Vehicular Networks
3.1 Experimental Datasets
3.2 Node Centralities
4 Results
4.1 Contact Density
4.2 Evolution Over Time
5 Related Work
6 Conclusion and Future Work
References
Core Stratification of Two-Mode Networks
1 Introduction
2 Cores
2.1 Preliminaries
2.2 Graph Cores
2.3 Computing Cores
2.4 Ordering Cores
3 Stratification
3.1 One and Two Parameters Stratification
4 A Two-Mode Network of Epistemological Data
5 Conclusion
References
OTARIOS: OpTimizing Author Ranking with Insiders/Outsiders Subnetworks
1 Introduction
2 Preliminaries
2.1 Terminology
2.2 Bibliometrics and PageRank
3 Methodology
3.1 Problem Description
3.2 OTARIOS
4 Results
4.1 Performance of OTARIOS Variants
5 Conclusions
References
Cascading Effects of Targeted Attacks on the Power Grid
1 Introduction
2 Related Work
3 Preliminaries and Problem Formulation
4 Experimental Design
5 Results and Discussion
6 Summary and Future Work
References
Community Structure
A Memory-Based Label Propagation Algorithm for Community Detection
1 Introduction
2 Related Work
3 MemLPA: A Memory-Based Label Propagation Algorithm
3.1 Algorithm Description
3.2 Complexity
4 Performance Study
4.1 Artificial Networks
4.2 Real-World Networks
4.3 Discussion
5 Conclusions and Future Work
References
Estimating the Similarity of Community Detection Methods Based on Cluster Size Distribution
1 Introduction
2 Estimating the Similarity of Community Detection Methods
3 Community Detection Methods
4 Network Dataset
5 Experimental Results
6 Discussion and Conclusion
References
Links in Context: Detecting and Describing the Nested Structure of Communities in Node-Attributed Networks
1 Introduction
2 Community Detection with Node Attributes
3 The Links in Context Approach
3.1 Data Representation
3.2 Extension of Link Communities
4 Evaluation
4.1 General Observations
4.2 Characteristics of Identified Communities
4.3 Evaluation on Datasets with Ground Truth
5 Conclusion
References
Overlapping Communities in Bipartite Graphs
1 Introduction
2 Exemplar Study Case
3 Related Methods
3.1 Ordinary Stochastic Block Model
3.2 Degree Corrected Stochastic Block Model
3.3 Bipartite Stochastic Block Model
3.4 Stochastic Block Model and Overlapping Communities
4 Stochastic Block Model for Overlapping Communities in a Bipartite Graph
5 Model Reduction Cases
6 Experiments
6.1 Evaluation Function
6.2 Generated Examples
7 Conclusion
References
Communities as Well Separated Subgraphs with Cohesive Cores: Identification of Core-Periphery Structures in Link Communities
1 Introduction
2 Cohesion and Separation
3 Core-Periphery Structures in Link Sets
4 Experiments
5 Summary and Discussion
References
Ensemble Clustering for Graphs
1 Introduction
2 Algorithm
2.1 Review of Multilevel Louvain
2.2 ECG Algorithm
3 Comparison Study Revisited
3.1 Comparison Measures
3.2 Main Results
4 Discussion
4.1 Resolution Limit and Stability Issue
4.2 Parameter Selection
4.3 Detecting Community Presence
5 Conclusion
References
A Community-Aware Approach for Identifying Node Anomalies in Complex Networks
1 Introduction
2 Preliminaries and Problem Statement
2.1 Network Terminology
2.2 Problem Statement
3 Related Work
4 Approach
4.1 Existing Approaches
4.2 Proposed Approach: CADA
5 Data
5.1 Real-World Network Data Sets
5.2 Synthetic Network Data Sets
5.3 Anomaly Types
6 Experiments
6.1 Experimental Setup
6.2 Evaluation Metrics
6.3 Results on Synthetic Data
6.4 Results on Real-World Data
6.5 Discussion
7 Conclusions and Future Work
References
Is Community Detection Fully Unsupervised? The Case of Weighted Graphs
1 Introduction
2 Community Detection
3 Normalizing Weights
4 Classifying Links: Inside or Outside Communities?
5 Supervised Label Propagation: SLP
6 Conclusion and Future Work
References
Is it Correct to Project and Detect? Assessing Performance of Community Detection on Unipartite Projections of Bipartite Networks
1 Introduction
2 Methods
2.1 Bipartite Network Models
2.2 Unipartite Projection and Edge-Weighting Schemes
2.3 Community Detection and Accuracy
3 Results
4 Discussion
References
Bayesian Complex Network Community Detection Using Nonparametric Topic Model
1 Introduction
2 Previous Work
3 Random Walk and Hierarchical Dirichlet Process
3.1 Notations
3.2 Random Walk Data Generation
3.3 Hierarchical Dirichlet Process Topic Model
4 Experiments
4.1 Models
4.2 Choice of Hyperparameters
4.3 Data
4.4 Evaluation Metrics
4.5 Results and Comparison
5 Discussion
6 Conclusion
References
Detecting Latent Terrorist Communities Testing a Gower's Similarity-Based Clustering Algorithm for Multi-partite Networks
1 Introduction
2 Related Work
3 Data
4 Methodology
5 Results
6 Discussion and Future Work
References
GLaSS: Semi-supervised Graph Labelling with Markov Random Walks to Absorption
1 Introduction
2 Method
2.1 DTMC Absorption Probabilities
2.2 Semi-supervised Graph Labelling
2.3 DTMC Expected Times to Absorption
2.4 The Graph Labelling Semi-supervised (GLaSS) Method
3 Data
4 Results
4.1 Comparison to Other Methods
5 Discussion
References
Semi-supervised Overlapping Community Finding Based on Label Propagation with Pairwise Constraints
1 Introduction
2 Related Work
2.1 Community Finding
2.2 Semi-supervised Learning in Community Finding
3 Methods
3.1 Pairwise Constraints for Overlapping Communities
3.2 Semi-supervised Overlapping Community Finding
4 Evaluation
4.1 Experimental Setup
4.2 Results and Discussion
5 Conclusion
References
Entropy in Network Community as an Indicator of Language Structure in Emoji Usage: A Twitter Study Across Various Thematic Datasets
1 Introduction
2 Related Work
3 Data and Methods
3.1 Data Collection and Curation
3.2 Network Construction
3.3 Community Detection Techniques and Evaluation Criteria
4 Results
5 Conclusion
References
TimeRank: A Random Walk Approach for Community Discovery in Dynamic Networks
1 Introduction
2 Related Work
3 Background: MutuRank
4 TimeRank
5 Experimentation
5.1 Data Description and Engineering
5.2 Evaluation Measures
5.3 Results
6 Conclusions and Future Work
References
Diffusion and Epidemics
Modeling Topical Information Diffusion over Microblog Networks
1 Introduction
2 Related Work
3 Modeling the Information Flow
3.1 Overview of Our Approach
3.2 Finding Topics
3.3 The Native SPA Model
3.4 The TopSPA Model
4 Experiments
5 Conclusion
References
Fast Variables Determine the Epidemic Threshold in the Pairwise Model with an Improved Closure
1 Introduction
2 Model Formulation
2.1 The Network and Standard SIR Dynamics
2.2 The Unclosed Pairwise Model
2.3 The Improved Closure and the Closed Pairwise System
3 Results for the Pairwise Model with the Improved Closure
3.1 Fast Variables with the Improved Closure
3.2 Asymptotic Expansion of the Epidemic Threshold
3.3 Numerical Examples
4 Discussion
References
Consistent Approximation of Epidemic Dynamics on Degree-Heterogeneous Clustered Networks
1 Introduction
2 Model Definitions
2.1 Networks
2.2 Epidemic Dynamics
3 Models of Network Generation
4 Epidemic Dynamics on Locally Tree-like Networks
4.1 Simple SIR Model
4.2 Pairwise Model
4.3 Effective Degree (ED) Model
4.4 Probability Generating Function (PGF) Methods
5 Dynamics on Clustered Networks
5.1 Pairwise Model
5.2 Clustered PGF
5.3 A New Model
6 Simulation Study
6.1 Methodology
6.2 Results
7 Discussion
References
DiffuGreedy: An Influence Maximization Algorithm Based on Diffusion Cascades
1 Introduction
2 Related Work
3 Influence Maximization Analysis
3.1 Ranking by K-Core Decomposition
3.2 Influence Maximization via Martingales
3.3 PMIA on the NetRate Network
3.4 SimPath on the DataBased Weighted Network
4 The DiffuGreedy Algorithm
5 Experiments
5.1 Data
5.2 Results
6 Conclusion
References
Predicting Information Diffusion in Online Social Platforms: A Twitter Case Study
1 Introduction
2 Related Work
3 Dataset
4 Methodology
4.1 Class Labelling
4.2 Feature Extraction
4.3 Splitting and Cross-Validation
5 Evaluation
5.1 Results
5.2 Predicting Tweet Popularity Using Initial Retweet Behaviour Features
6 Conclusion
References
Modelling and Analysis of Delayed SIR Model on Complex Network
1 Introduction
2 Related Work
2.1 Mathematical Modelling of Epidemic Spreading
2.2 Epidemic on Network
3 Proposed Methodology
4 Simulation and Results
5 Conclusion and Future Work
References
Dynamics On/Of Networks
A Markov Model for Inferring Flows in Directed Contact Networks
1 Introduction
2 Directed Contact Networks and Temporal Digraphs
3 Markov Model Associated to a DCN
3.1 Embeddability
4 Data Reduction and Anomaly Detection
5 Remarks
References
A General Model of Dynamics on Networks with Graph Automorphism Lumping
1 Introduction
2 Background
3 Dynamical Processes on Networks
4 General Markov Chain Model of Dynamics on Networks
5 Graph Automorphism Lumping
6 Example Applications
7 Discussion
References
EvoNRL: Evolving Network Representation Learning Based on Random Walks
1 Introduction
2 Instability of StaticNRL Methods
3 Dynamic Random Walks Framework
4 Evolving Network Representation Learning
5 Experimental Evaluation
6 Related Work
7 Conclusions
References
Distributed PI Control for Multi-agent Consensus Tracking of Heterogeneous Networks with Heterogeneous Uncertainties
1 Introduction
2 Preliminaries and Problem Statement
2.1 Graph Theory
2.2 Problem Formulation
3 Main Results
3.1 Distributed PI Control Design
3.2 Distributed Adaptive PI Control Design
4 Simulation
5 Conclusion
References
Time Granularity in System-of-Systems Simulation of Infrastructure Networks
Abstract
1 Introduction
2 Model Development
2.1 Model Implementation
3 Simulation Experiments
3.1 Experimental Layout
3.2 Simulation Result
4 Conclusions
Acknowledgements
References
TTPROF: A Weighted Threshold Model for Studying Opinion Dynamics in Directed Temporal Network
1 Introduction
2 Related Work
3 Mathematical Modeling of the Proposed Work
4 Results and Analysis
4.1 Impact of Threshold Value on the Convergence of Opinions
4.2 Impact of Fraction of Top Ranked Nodes on the Convergence of Opinions
4.3 Combined Impact of Threshold Value and Fraction of the Top Ranked Nodes on the Number of Clusters and Timestamp in Which Opinions Converge Along with Change in Number of Nodes
5 Conclusions and Future Work
References
Full-Commanding a Network: The Dictator
1 Introduction
2 Complete Synchronization in a Network
3 Full-Commanding
4 Conclusions
References
Biased Dynamic Sampling for Temporal Network Streams
1 Introduction
2 Related Work
3 Problem Definition
3.1 Sampling with a Bias to Latest and Stable Edges (SBias)
4 Experimental Evaluation
4.1 Data Sets
4.2 Comparative Assessment with the True Network
4.3 Comparative Assessment with Other Methods
5 Conclusions and Future Work
References
Using Network Reliability to Understand International Food Trade Dynamics
1 Introduction
2 Network Construction
3 Network Reliability and Contagion Clusters
4 Experimental Results
5 Conclusion and Future Directions
References
An Approach to Structural Analysis Using Moore-Shannon Network Reliability
1 Introduction
2 Formalism
3 Computational Methods
4 Applications
5 Future Directions
References
Motif Discovery
New Deterministic Model of Evolving Trinomial Networks
1 Introduction
2 Preliminary Notations
3 Partition Graph Model
4 Trinomial Partition Family
4.1 Recurrent Procedure of Design Graph of TPF(m) Where m & 3
5 Topological Properties of Graphs of TPF(m) Graphs
5.1 General Topological Parameters of TPF(m) Graphs (m = 4, ., 9)
5.2 Graphs of Nodes G0v(m) and Graphs of Cliques G0cl(m)
6 Robustness of TPF(m)
6.1 Experimental Results: Deleting of Cliques for G0cl(5)
7 Conclusion Remarks
References
Counting Multilayer Temporal Motifs in Complex Networks
1 Introduction
2 Related Work
3 Multilayer Temporal Motifs
4 Extended Algorithms
4.1 General Motif Counting
4.2 Star Motif Counting
4.3 Triangle Motif Counting
4.4 Complexity of Extended Fast Algorithms
5 Experiments
5.1 Experimental Setup
5.2 Data
5.3 Results
6 Conclusion and Future Work
References
Quasi-cliques Analysis for IRC Channel Thread Detection
1 Introduction
2 Terminology
3 Related Work
4 Data Gathering
4.1 Autonomic IRC Bot for Message Collection and Classification
4.2 Graph Transformation
4.3 Quasi-clique Computation
5 Results
6 Conclusion
References
Triad-Based Comparison and Signatures of Directed Networks
1 Introduction
2 Background
3 Triad Methods, Signature Triads and Signature Orbits
4 Case Study I: Synthetic Networks
5 Case Study II: Clustering of Different Types of Networks
6 Case Study III: Analysis of World Trade Networks
7 Conclusion
References
Mining Patterns with Durations from E-Commerce Dataset
1 Introduction
2 Related Work
3 Sequential Event Pattern Mining Algorithm
3.1 Definitions
3.2 Problem Reformulation
3.3 Algorithms
3.4 Pruning
4 Experimental Evaluation
4.1 E-commerce Datasets
4.2 Synthetic Datasets
5 Conclusion
References
Network Models
Relating Emerging Network Behaviour to Network Structure
Abstract
1 Introduction
2 Conceptual and Numerical Representation of a Network
3 Examples of Emerging Network Behaviour
4 Relevant Properties of Network Structure
5 Results Relating Emerging Behaviour to Network Structure
6 Discussion
References
Multilevel Network Reification: Representing Higher Order Adaptivity in a Network
Abstract
1 Introduction
2 Temporal-Causal Networks: Structure and Dynamics
3 Network Reification
4 Multilevel Network Reification
5 Simulation Scenarios
6 Analysis of Equilibrium Values
7 Discussion
References
An Exploration of the Network Installation and Recovery Problem with Blackstart Nodes
1 Introduction
2 Background
3 Blackstart Nodes
3.1 Augmented Trees
3.2 Almost-Complete Networks
4 Experimental Heuristics
4.1 Experimental Framework
4.2 Results
5 Conclusion
References
Mathematical Analysis of a Network's Asymptotic Behaviour Based on Its Strongly Connected Components
Abstract
1 Introduction
2 Temporal-Causal Networks
3 Asymptotic Network Behaviour
4 Connectivity and Strongly Connected Components
5 Characteristics of Combination Functions
6 Asymptotic Network Behaviour and Network Characteristics
7 Discussion
References
Random Graph Generators for Hyperbolic Community Structures
1 Introduction
2 Existing Random Graph Generators
3 Hyperbolic Community
4 Our Model
5 Properties of HyGen Random Graphs
6 Empirical Parameter Distributions for HyGen
7 HyGen Graphs from Known Distributions
8 Stability of the Graph Generation
9 Randomness of the Generated Graphs
10 Conclusions
References
Estimating Personal Network Size with Non-random Mixing via Latent Kernels
1 Introduction
2 Previous Research
3 Latent Kernel Representation of Social Mixing
3.1 Latent Mixing Kernel
3.2 Expectation Derivation
4 Latent Kernel Model for Aggregated Relational Data (ARD)
5 Results
6 Discussion
References
Forman's Ricci Curvature - From Networks to Hypernetworks
1 Introduction
2 Hypernetworks as Polyhedral Complexes
2.1 Parametrizing Hypernetworks as Polyhedral Complexes
2.2 Choice of Weights
2.3 Directionality
3 Discrete Curvatures for Hypernetworks
3.1 Forman-Ricci Curvature
3.2 Ollivier's Ricci Curvature
4 Applications
4.1 Applications in Network Analysis
4.2 Use Case
5 Conclusions
References
Mapping Structural Diversity in Networks Sharing a Given Degree Distribution and Global Clustering: Adaptive Resolution Grid Search Evolution with Diophantine Equation-Based Mutations
1 Introduction
2 Methods
2.1 Defining the Search Space: Network Encoding
2.2 Defining Movement Within the Search Space: Exact Mutations
2.3 Adaptive Resolution Change Mechanism
3 Results
3.1 Impact of Diophantine-Based Mutation on Rate of Discovery
3.2 Impact of Adaptive Resolution Search on Quality of Discovery
3.3 Impact of Diversity on Behaviour: Complex Contagion
4 Discussion
References
Specialist Cops Catching Robbers on Complex Networks
1 Introduction
1.1 Random Walks on Complex Networks
2 Preliminaries and Related Work
2.1 (Statistical) Model Checking
2.2 Probabilistic BLTL
3 Randomized Cops and Robber
3.1 Problem Statement
3.2 Cop Number
3.3 Scope of (Statistical) Model Checking
4 Future Work
References
Evaluating the Natural Variability in Generative Models for Complex Networks
1 Introduction
2 Background
2.1 Chung-Lu Model
2.2 Exponential Random Graphs
2.3 dk-Random Graphs
2.4 Action-Based Network Generators
3 Experimental Setup
4 Experimental Results
4.1 Networks with Community Structure
5 Conclusions
References
Multilayer Networks
Py3plex: A Library for Scalable Multilayer Network Analysis and Visualization
1 Introduction
2 Related Work
3 Py3plex Library Architecture
4 Py3plex Comparison to Other Libraries
5 Multilayer Network Visualization
5.1 Visualization Methodology and Implementation
5.2 Comparison of Py3plex and Pymnet Visualization Performance
6 Conclusions and Further Work
7 Availability
References
Morphogenesis of Complex Networks: A Reaction Diffusion Framework for Spatial Graphs
1 Spatial Networks: Properties and Models
2 Model Description
2.1 Spatial Interactions: The Morphogenesis of the Network
3 Simulation and Results
4 Conclusion
References
Multilayer Network Model of Movie Script
1 Introduction
2 Related Works
3 Modeling Stories with a Multilayer Network
4 Extracting the Multilayer Network from the Script
4.1 Script Structure and Definitions
4.2 Script Preprocessing
4.3 Text Processing
4.4 Network Construction
5 Analyzing the Multilayer Network
5.1 Data and Method
5.2 Basic Topological Properties
5.3 Node Influence
6 Conclusion
References
Effects of Interaction and Learning Distance on Cooperation in Evolutionary Games on a Multiplex Network
1 Introduction
2 Model
2.1 Network Structure, Social Distance, Strategy and Payoff
2.2 Prisoner's Dilemma Game on a Multiplex Network
3 Results
4 Conclusion
References
Resilience and Control
A Genetic Algorithm for Enhancing the Robustness of Complex Networks Through Link Protection
1 Introduction
2 Related Work
3 Effective Graph Resistance and Optimization Through Link Removal
4 Method Description
5 Experimental Evaluation
5.1 Datasets
5.2 Strategies for Link Removal
5.3 Results
6 Conclusion
References
Numerical Assessment of the Percolation Threshold Using Complement Networks
1 Introduction
2 Numerical Methods and Results
References
Optimal Control Rules for Random Boolean Networks
1 Introduction
2 Random Boolean Networks
3 Learning Classifier Systems
4 Optimal Control Rules
5 Experiments
6 Results
7 Discussion
8 Conclusions and Future Work
References
Robustness Through Regime Flips in Collapsing Ecological Networks
Abstract
1 Introduction
2 Methods
3 Results
4 Discussion
References
Enhancing Synchronization Stability in Complex Networks with Probabilistic Natural Frequencies
1 Introduction
2 Linear Stability of Kuramoto Model
3 Optimization Method
4 Optimization for Probabilistic Natural Frequencies
5 Stability Enhancement Results
6 Node Vulnerability Results
7 Conclusion
References
Identifying Vulnerable Nodes to Cascading Failures: Centrality to the Rescue
1 Introduction
2 System Model
2.1 Propagation of Failures Between Nodes
2.2 Non-backtracking Centralities
3 Approximation of Cascading Failure Probabilities
4 Main Results
4.1 Homogeneous Infection Probability Case
5 Numerical Results
6 Conclusion
References
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks
1 Introduction
2 Preliminaries
3 Results for Uniform SYDSs
4 Efficient Solvability for Sequences of Fixed Length
5 Complexity When Sequence Length is Not Fixed
6 Summary and Future Research Directions
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Complex Networks and Their Applications VII

Description

More details

Other editions

Additional editions

Content

System requirements