Reducing Synchronization Cost in Weighted Dynamical Networks Using Betweenness Centrality Measures
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
A framework for analyzing and benchmarking climate model outputs is built upon delta-MAPS, a recently developed complex network analysis method. The framework allows for the possibility of highlighting quantifiable topological differences across data sets, ...
Complex network theory describes network performance mostly based on topological characteristics, like betweenness centrality. This work integrates concepts from complex networks and traffic engineering. We propose a new measure for spatial networks and, i ...
Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...
Classic measures of graph centrality capture distinct aspects of node importance, from the local (e.g., degree) to the global (e.g., closeness). Here we exploit the connection between diffusion and geometry to introduce a multiscale centrality measure. A n ...
Understanding travel behaviour in transportation system is key challenge to calibrate and simulate the usage of urban mobility networks. We define in this work a path-based centrality based on the simplicity of the path between two locations in road networ ...
In complex network-coupled dynamical systems, two questions of central importance are how to identify the most vulnerable components and how to devise a network making the overall system more robust to external perturbations. To address these two questions ...
Identifying key players in coupled individual systems is a fundamental problem in network theory. We investigate synchronizable network-coupled dynamical systems such as high-voltage electric power grids and coupled oscillators on complex networks. We defi ...
American Association for the Advancement of Science (AAAS)2019
Computing the most central nodes in large-scale commodity networks is rather important for improving routing and associated applications. In this paper, we introduce a novel framework for the analysis and efficient computation of routing path-based central ...
The structure in cortical microcircuits deviates from what would be expected in a purely random network, which has been seen as evidence of clustering. To address this issue, we sought to reproduce the nonrandom features of cortical circuits by considering ...
In this study, we developed a robust inversion algorithm to estimate the Neurite Orientation Dispersion and Density Imaging (NODDI) model. It is based on the Accelerated Microstructure Imaging via Convex Optimization (AMICO) framework. However, in contrast ...
