Automatic Skill Acquisition in Reinforcement Learning Using Graph Centrality Measures
Related publications (41)
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.
Complex dynamical networks are ubiquitous in many fields of science from engineering to biology, physics, and sociology. Collective behavior, and in particular synchronization,) is one of the most interesting consequences of interaction of dynamical system ...
We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving data rate are met ...
This paper elucidates the relation between network dynamics and graph theory. A new general method to determine global stability of total synchronization in networks with different topologies is proposed. This method combines the Lyapunov function approach ...
Dynamical networks with diffusive couplings are investigated from the point of view of synchronizability. Arbitrary connection graphs are admitted but the coupling is symmetric. Networks with equal interaction coefficients for all edges of the interaction ...
Events occurring in a city, such as car accidents, attacks on the security or activities locations are channelled in the urban network. The goal of this report is to provide a GIS tool able to compute densities and diversities in a network space rather tha ...
By considering the eigenratio of the Laplacian of the connection graph as a synchronizability measure, we propose a procedure for weighting dynamical networks to enhance their synchronizability. The method is based on node and edge betweenness centrality m ...
Reverse engineering methods are typically first tested on simulated data from in silico networks, for systematic and efficient performance assessment, before an application to real biological networks. In this paper we present a method for generating biolo ...
In this paper we investigate optimization of synchronization cost in undirected dynamical networks. To do so, proper weights are assigned to the networks’ edges considering node and edge betweenness centrality measures. The proposed method gives near-optim ...
To better understand networking and security aspects of VANETs, we have been investigating network connectivity issues and mappings of car networks to the underlying road topology. Using this mapping and various metrics based on centrality, we locate hot-s ...
This paper clarifies the relation between synchronization and graph topology. Applying the Connection Graph Stability method developed by Belykh et al. [2004a] to the study of synchronization in networks of coupled oscillators, we show which graph properti ...