Markov Modulated Process to Model Human Mobility

We introduce a Markov Modulated Process (MMP) to describe human mobility. We represent the mobility process as a time-varying graph, where a link specifies a connection between two nodes (humans) at any discrete time step. Each state of the Markov chain encodes a certain modification to the original graph. We show that our MMP model...

A network approach for power grid robustness against cascading failures

Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology. Currently, the impact of the grid structure on the grid robustness is mainly assessed by purely topological metrics, that fail to capture the fundamental properties of the electrical...

Do greedy assortativity optimization algorithms produce good results?

Correlating the topology of a metabolic network with its growth capacity

Metabolic network destruction: Relating topology to robustness

Biological networks exhibit intriguing topological properties such as small-worldness. In this paper, we investigate whether the topology of a metabolic network is related to its robustness. We do so by perturbing a metabolic system in silico, one reaction at a time and studying the correlations between growth, as predicted by flux balance...

Algebraic Connectivity Optimization via Link Addition

The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking

A Qualitative Comparison of Power Law Generators

Constructing the Overlay Network by Tuning Link Weights

Shifting the Link Weights in Networks

Topological Characteristics of the Dutch Road Infrastructure

The Stability of Paths in a Dynamic Network

Degree and Principal Eigenvectors in Complex Networks

The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...