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.
The topology of large social, technical and biological networks such as the World Wide Web or protein interaction networks has caught considerable attention in the past few years (reviewed in Newman 2003), and analysis of the structure of such networks rev ...
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 ...
In randomly connected networks of pulse-coupled elements a time-dependent input signal can be buffered over a short time. We studied the signal buffering properties in simulated networks as a function of the networks' state, characterized by both the Lyapu ...
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 ...
The paper proposes a new type of small-world networks of cells with chaotic behavior. This network consists of a regular lattice of cells with constant 2K-nearest neighbor couplings and time-dependent on-off couplings between any other pair of cells. In ...
The min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by liner re-encoding at node ...
This paper provides a short review of recent results on synchronization in small-world dynamical networks of coupled oscillators. We also propose a new model of small-world networks of cells with a time-varying coupling and study its synchronization proper ...
We propose a new approach to securing computer networks. With this approach, we achieve security in a fully self-organized manner; by this we mean that to secure a computer network, a security system does not require any kind of certification authority or ...
Colloidal silica gels are shown to stiffen with time, as demonstrated by both dynamic light scattering and bulk rheological measurements. Their elastic moduli increase as a power law with time, independent of particle volume fraction; however, static light ...
We consider the problem of analytically evaluating semantic interoperability in large-scale networks of schemas interconnected through pairwise schema mappings. Our heuristics are based on a graph-theoretic framework capturing important statistical propert ...
