Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

NETWORKING
2008

favoriteEmaildiscussreport

89views Computer Networks» more NETWORKING 2008»

On the Robustness of Complex Networks by Using the Algebraic Connectivity

13 years 5 months ago

On the Robustness of Complex Networks by Using the Algebraic Connectivity

Download dutetvg.et.tudelft.nl

The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the extent to which it is difficult to cut the network into independent components. In this paper we study the behavior of the algebraic connectivity in a well-known complex network model, the Erdos-R

A. Jamakovic, Piet Van Mieghem

Real-time Traffic

Algebraic Connectivity | Complex Networks | Computer Networks | Link Connectivity | NETWORKING 2008 |

claim paper

Related Content

» Beyond Routing An Algebraic Approach to Network Coding

» Robust connectivityaware energyefficient routing for wireless sensor networks

» Restricted Broadcast Process Theory

» Towards a calculus of biomolecular complexes at equilibrium

» Towards a Connector Algebra

» Learning to classify complex patterns using a VLSI network of spiking neurons

» Entropy Optimization of Social Networks Using an Evolutionary Algorithm

» On degeneracy of lower envelopes of algebraic surfaces

» Newtons method and the Computational Complexity of the Fundamental Theorem of Algebra

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	NETWORKING
Authors	A. Jamakovic, Piet Van Mieghem

Comments (0)