Concept

Community structure

Related publications (82)

Degraded Multicasting with Network Coding over the Combination Network

Christina Fragouli, Shirin Saeedi Bidokhti

In this paper, we give a characterization of the rate region for the degraded two message set problem, applied to a combination network with erasure channels. We also provide an algorithm that uses topological information in order to deliver the two messag ...

2010

Dynamics and control of diseases in networks with community structure

Marcel Salathé

The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how s ...

Public Library of Science2010

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

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

Network Design via Core Detouring for Problems Without a Core

Thomas Rothvoss

Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recent work [Eisenbrand,Grandoni,Rothvo\ ...

Springer2010

Synchronizability of dynamical networks: different measures and coincidence

Ali Ajdari Rad, Mahdi Jalili

In this paper, we list four different interpretations of synchronizability, study their profile in different network structures and give evidence that they do not coincide, in general. By changing the network topological properties, their behavior is track ...

2009

Comment on Rewiring networks for synchronization

Ali Ajdari Rad, Mahdi Jalili

This is a comment on a recent paper by A. Hagberg and D. A. Schult [Chaos 18, 037105 (2008)]. By taking the eigenratio of the Laplacian of an undirected and unweighted network as its synchronizability measure, they proposed a greedy rewiring algorithm for ...

2009

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

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.