Concept

Small-world network

Related publications (252)

Comparison of neuronal spike exchange methods on a Blue Gene/P supercomputer

For neural network simulations on parallel machines, Interprocessor spike communication can be a significant portion of the total simulation time. The performance of several spike exchange methods using a Blue Gene/P (BG/P) supercomputer has been tested wi ...

2011

Estimating small-world topology of neural networks from multi-electrode recordings

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

Since the seminal work of Watts in the late 90s [1], graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures [2]. Most studies have focused on functional connectivity defined between whole brain regions, us ...

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Community detection enhancement in networks using proper weighting and partial synchronization

Martin Hasler, Ali Ajdari Rad, Alireza Khadivi

A community in a network is a subset of vertices densely connected to each other, but less connected to the vertices outside. Many different approaches have been developed to find such structures in a given network, but the main drawback of most of the ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Community detection enhancement in networks using proper weighting and partial synchronization

Martin Hasler, Ali Ajdari Rad, Alireza Khadivi

IEEE2010

Community Detection Enhancement in Networks using Proper Weighting and Partial Synchronization

Martin Hasler, Ali Ajdari Rad, Alireza Khadivi

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

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

Michel Bierlaire, Carolina Osorio Pizano

This paper presents a finite capacity queueing network model to evaluate congestion in protein synthesis networks. These networks are modeled as single server bufferless queues in a tandem topology. The model approximates the marginal stationary distributi ...

2010

Spanning traceroutes over modular networks and general scaling degree distributions

Andrea Rinaldo, Amos Maritan

We analyze the class of networks characterized by modular structure where a sequence of l Erdos-Renyi random networks of size N >> 1 with random average degrees is joined by links whose structure must remain immaterial. We find that traceroutes spanning th ...

American Physical Society2010

Optimal Motorway Traffic Flow Control Involving Variable Speed Limits and Ramp Metering

The impact of variable speed limits (VSL) on aggregate traffic flow behaviour on motorways is shown to bear similarities to the impact of ramp metering, in particular, when addressing potentially active bottlenecks. A quantitative model of the VSL impact i ...

INFORMS2010

On the Broadcast Capacity of Wireless Networks With Cooperative Relays

Michael Christoph Gastpar

A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a s ...

2010

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.