Searched for: department:"Architecture"
(1 - 14 of 14)
document
Wang, X. (author), Koc, Y. (author), Kooij, R.E. (author), Van Mieghem, P. (author)
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...
conference paper 2015
document
Wang, X. (author), Koç, Y. (author), Derrible, S. (author), Nasir Ahmad, Sk. (author), Kooij, R.E. (author)
Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical networks, metros can be viewed as network topological entities, and as such they possess measurable network...
conference paper 2015
document
Wang, X. (author)
Cities in China are embarked on ambitions plans to create renewed inner-city station areas, particularly evident after a series of redevelopment projects; these projects mainly focus on the development of transport infrastructures, rather than turning station areas into vibrant urban spaces. Therefore, a general lack of citizen’s daily...
conference paper 2014
document
Wang, X. (author)
Redevelopments of Chinese inner-­?city station areas introduced both new transport infrastructures (high speed railway, urban mass transit system, etc.) and real estate projects to station vicinities during the past decades. However, existing station areas are isolated from the rest of the city, and seldom urban activities take place in station...
conference paper 2014
document
Martin-Hernandez, J. (author), Wang, H. (author), Van Mieghem, P. (author), D'Agostino, G. (author)
The algebraic connectivity UN-1, i.e. the second smallest eigenvalue of the Laplacian matrix, plays a crucial role in dynamic phenomena such as diffusion processes, synchronization stability, and network robustness. In this work we study the algebraic connectivity in the general context of interdependent networks, or network-of-networks (NoN)....
journal article 2014
document
Winterbach, W. (author), Van Mieghem, P. (author), Reinders, M. (author), Wang, H. (author), De Ridder, D. (author)
Molecular interactions are often represented as network models which have become the common language of many areas of biology. Graphs serve as convenient mathematical representations of network models and have themselves become objects of study. Their topology has been intensively researched over the last decade after evidence was found that...
journal article 2013
document
Winterbach, W. (author), De Ridder, D. (author), Wang, H.J. (author), Reinders, M. (author), Van Mieghem, P. (author)
conference paper 2012
document
Winterbach, W. (author), Wang, H. (author), Reinders, M. (author), Van Mieghem, P. (author), De Ridder, D. (author)
conference paper 2010
document
Winterbach, W. (author), Wang, H. (author), Reinders, M. (author), Van Mieghem, P. (author), De Ridder, D. (author)
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...
conference paper 2010
document
Stam, C.J. (author), Hillebrand, A. (author), Wang, H. (author), Van Mieghem, P. (author)
A network of 32 or 64 connected neural masses, each representing a large population of interacting excitatory and inhibitory neurons and generating an electroencephalography/magnetoencephalography like output signal, was used to demonstrate how an interaction between dynamics and connectivity might explain the emergence of complex network...
journal article 2010
document
Wang, H. (author), Kooij, R.E. (author), Van Mieghem, P. (author)
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 , ..., KnD+1, where neighboring cliques are fully-interconnected. The class of graphs has diameter D and size N = ? 1?i?D+1ni. We prove that this class of graphs can achieve the maximal number of links, the minimum average hopcount, and more...
journal article 2010
document
Van Mieghem, P. (author), Wang, H. (author)
journal article 2009
document
Li, C. (author), Wang, H. (author), Van Mieghem, P. (author)
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...
conference paper
document
Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author)
We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...
report
Searched for: department:"Architecture"
(1 - 14 of 14)