Publications related to Community Detection Enhancement in Networks using Proper Weighting and Partial Synchronization

A statistical physics perspective of complex networks

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

A Location Based Routing Method for Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile or frequently dis ...

2005

Blinking Model and Synchronization in Small-World Networks with a Time-Varying Coupling

Martin Hasler, Igor Belykh

The paper proposes a new type of small-world networks of cells with chaotic behavior. This network consists of a regular lattice of cells with constant

2K

-nearest neighbor couplings and time-dependent on-off couplings between any other pair of cells. In ...

2004

Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks

Jean-Yves Le Boudec

We are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a highly complex non-convex optimization problem and it has been previously solved only ...

2003

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile. Terminode routin ...

2003

Network synthesis through data-driven growth and decay

Demetri Psaltis

An algorithm for addition and deletion (ADDEL) of resources during learning is developed to achieve two goals: (1) to find feed-forward multilayer networks that are as small as possible, (2) to find an appropriate structure for such small networks. These g ...

1997

Community Detection Enhancement in Networks using Proper Weighting and Partial Synchronization

Graph Chatbot

Chat with Graph Search

A statistical physics perspective of complex networks

The evolution of network topology by selective removal

A Location Based Routing Method for Mobile Ad Hoc Networks

Blinking Model and Synchronization in Small-World Networks with a Time-Varying Coupling

Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Network synthesis through data-driven growth and decay

A statistical physics perspective of complex networks

The evolution of network topology by selective removal

A Location Based Routing Method for Mobile Ad Hoc Networks

Blinking Model and Synchronization in Small-World Networks with a Time-Varying Coupling

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Network synthesis through data-driven growth and decay

Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks