Publication

A tractable analytical model for large-scale congested protein synthesis networks

Publications associées (43)

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

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

Iterated monodromy groups of quadratic polynomials, I

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and make explicit their connection to the 'kneading sequence' of the polynomial. ...

2008

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

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Existence, cost and robustness of spatial small-world networks

Paolo De Los Rios, Thomas Petermann

Small-world networks embedded in Euclidean space represent useful cartoon models for a number of real systems such as electronic circuits, communication systems, the large-scale brain architecture and others. Since the small-world behavior relies on the pr ...

2007

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005

The evolution of network topology by selective removal

Marcel Salathé

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

2005

Synchronization in complex networks with blinking interactions

Martin Hasler, Igor Belykh

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

2005

Analyzing Semantic Interoperability in Bioinformatic Database Networks

Karl Aberer, Philippe Cudré-Mauroux, Adriana Budura, Julien Gaugaz

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

2005

Quadratic Term Structure Models for Risk-Free and Defaultable Rates

Damir Filipovic

In this paper, quadratic term structure models (QTSMs) are analyzed and characterized in a general Markovian setting. The primary motivation for this work is to find a useful extension of the traditional QTSM, which is based on an Ornstein{Uhlenbeck (OU) s ...

Wiley-Blackwell2004