Global robustness versus local vulnerabilities in complex synchronous networks
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We compare the structural properties of the street networks of ten different European cities using their primal representation. We investigate the properties of the geometry of the networks and a set of centrality measures highlighting differences and simi ...
The articles in this special issue report on up-to-date advances in the broad area of information processing over graphs. Due to the highly cross-disciplinary nature of complex networks, the technical articles in this April 2013 issue of the IEEE Journal o ...
The topic of this special issue deals with a subject matter that has been receiving immense attention from various research communities, and not only within the signal processing community. Discusses research and development in the area of the adaption and ...
Pressurized fluid-distribution networks are strategic elements of infrastructure. In the case of fresh-water distribution networks, advanced sensor-based diagnostic methodologies have the potential to provide enhanced management support. Since a significan ...
How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks---such as the Internet or the human social graph---it is usually infeasible to observe the state of all nodes in a network. We show that it i ...
Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...
This work characterizes the nature of the limit point of distributed strategies for adaptation and learning over networks in the general case when the combination policy is not necessarily doubly stochastic and when the individual risks do not necessarily ...
We consider a complex network of N diffusively coupled stable limit cycle oscillators. Each individual system has its own set of local parameters Λ, characterizing its frequencies and the shape of limit cycle. The Λ are allowed, thanks to appropriate inter ...
It was recently observed from empirical traffic data that by aggregating the highly scattered plots of flow versus density from individual loop detectors for city regions with homogeneous spatial distribution of congestion, the scatter significantly decrea ...
This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model propose ...
