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.
This paper reviews theoretical and observational material on form and function of natural networks appeared in somewhat disparate contexts from physics to biology, whose study is related to hydrologic research. Moving from the exact result that drainage ne ...
The performances of approximation using redundant expansions rely on having dictionaries adapted to the signals. In natural high-dimensional data, the statistical dependencies are, most of the time, not obvious. Learning fundamental patterns is an alternat ...
Motivated by biological neural networks and distributed sensing networks, we study how pooling networks – or quantizers – with random thresholds can be used in detection tasks. We provide a brief overview of the use of deterministic quantizers in detection ...
We extend the connection graph stability method for complete synchronization, originally developed for symmetrically coupled networks, to the asymmetrical case. First, we study synchronization in asymmetrically connected networks with node balance, the pro ...
We propose a new model of small-world networks of cells with a time-varying coupling and study its synchronization properties. In each time interval of length /spl tau/ such a coupling is switched on with probability p and the corresponding switching rando ...
We present a general framework for studying global complete synchronization in networks of dynamical systems with asymmetrical connections. We extend the connection graph stability method, originally developed for symmetrically coupled networks, to the gen ...
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 ...
The configuration space network (CSN) of a dynamical system is an effective approach to represent the ensemble of configurations sampled during a simulation and their dynamic connectivity. To elucidate the connection between the CSN topology and the underl ...
In this paper we develop a multi-agent simulation model to explore the issue of learning in interorganizational networks. Though interorganizational network researchers generally agree that when firms form into networks they will gain access to new knowled ...
We consider the problem of partitioning the node set of a graph into p cliques and k stable sets, namely the (p,k)-coloring problem. Results have been obtained for general graphs \cite{hellcomp}, chordal graphs \cite{hellchordal} and cacti for the case whe ...