Publication

Synchronization in asymmetrically coupled networks with node balance

Publications associées (32)

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

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

Synchrony in node-balanced networks

Martin Hasler, Igor Belykh

We study global stability of synchronization in asymmetrically connected networks of limit-cycle or chaotic oscillators. We extend the connection graph stability method to directed graphs with node balance, the property that all nodes in the network have e ...

2006

Graph-based criteria for synchronization of diffusively coupled oscillators

Martin Hasler, Igor Belykh

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

2006

Generalized connection graph method for synchronization in asymmetrical networks

Martin Hasler, Igor Belykh

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

2006

Linear Iterations on Ordered Semirings for Trust Metric Computation and Attack Resiliency Evaluation

Georgios Theodorakopoulos

Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence created by the previous interactions of entities within a protocol. In this wo ...

MTNS2006

On Trust Models and Trust Evaluation Metrics for Ad-Hoc Networks

Georgios Theodorakopoulos

2006

An algorithm for source location in directed graphs

Johanna Kristin Maria Becker

A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node v in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R. ...

2004

We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the case ...

2004

Trust Evaluation in Ad-Hoc Networks

Georgios Theodorakopoulos

An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we ar ...

ACM Press2004

Who links to whom: mining linkage between Web sites

Monika Henzinger

Previous studies of the Web graph structure have focused on the graph structure at the level of individual pages. In actuality the Web is a hierarchically nested graph, with domains, hosts and Web sites introducing intermediate levels of affiliation and ad ...

2001