Publication

Information Processing and Structure of Dynamical Networks

Publications associées (265)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Simulating Learning Dynamics in Project Networks

Juan Andrei Villarroel Fernandez

In this paper we develop a multiagent simulation model to explore the impact of learning dynamics on the productive implementation of innovations in project networks comprised of designers and contractors. Though researchers generally agree that when firms ...

2009

Complex networks

Cécile Caretta Cartozo

The last decade has witnessed a fundamental change in the role of network theory. Side by side with the increasing relevance of interdisciplinarity, this ensemble of mathematical tools and methods has known such a success and such a wide range of different ...

EPFL2009

An online framework for learning novel concepts over multiple cues

Barbara Caputo, Jie Luo

We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. For each separate cue, we train an online learning algorithm that sacrifices performan ...

2009

Enhancing synchronizability of weighted dynamical networks using betweenness centrality

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

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 ...

2008

Reducing Synchronization Cost in Weighted Dynamical Networks Using Betweenness Centrality Measures

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

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 ...

IEEE2008

Networks of Mixed Canonic-Dissipative Systems and Dynamic Hebbian Learning

Max-Olivier Hongler, Julio Rodriguez

We consider a collection {O_k}_{k=1}^N of interacting parametric mixed canonical-dissipative systems, (MCD). Each individual Ok, exhibits, in absence of interaction, a limit cycle L_k on which the orbit circulation is parameterized by w_k(t). The underlyin ...

Shaker Verlag2008

Spectral coarse graining and synchronization in oscillator networks

Paolo De Los Rios, David Gfeller

Coarse graining techniques offer a promising alternative to large-scale simulations of complex dynamical systems, as long as the coarse-grained system is truly representative of the initial one. Here, we investigate how the dynamical properties of oscillat ...

American Physical Society2008

Iterative Learning Control based on Stochastic Approximation

Alireza Karimi, Roland Longchamp, Mark Edward John Butcher

In this paper stochastic approximation theory is used to produce Iterative Learning Control algorithms which are less sensitive to stochastic disturbances, a typical problem for the learning process of standard ILC algorithms. Two algorithms are developed, ...

2008

Variations of coloring problems related to scheduling and discrete tomography

Bernard Ries

The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...

EPFL2007

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007