Searched for: subject%3A%22spectral%255C+graph%255C+theory%22
(1 - 6 of 6)
document
Kooij, Robert (author), Dubbeldam, J.L.A. (author)
The linear relation between Kemeny's constant, a graph metric directly linked with random walks, and the effective graph resistance in a regular graph has been an incentive to calculate Kemeny's constant for various networks. In this paper we consider complete bipartite graphs, (generalized) windmill graphs and tree networks with large...
journal article 2020
document
Bot, Fanny (author)
Indoor localization provides for a much researched subject, as the complexity and size of many public buildings require extensive and properly designed methods to facilitate location specific processes. Indoor localization entails finding a qualitative description of the occupied area, that is human interpretable, rather than a quantitative...
master thesis 2019
document
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies...
journal article 2019
document
Devriendt, Karel (author)
As new technologies continue to find their way into everyday life, the world becomes more and more connected. Airplanes and other means of transportation provide global connections in the physical world, while the omnipresence of the Internet means that information is shared around the globe, easier than ever before. But not only these man-made...
master thesis 2017
document
Wang, X. (author), Dubbeldam, J.L.A. (author), Van Mieghem, P.F.A. (author)
Kemeny's constant and its relation to the effective graph resistance has been established for regular graphs by Palacios et al. [1]. Based on the Moore–Penrose pseudo-inverse of the Laplacian matrix, we derive a new closed-form formula and deduce upper and lower bounds for the Kemeny constant. Furthermore, we generalize the relation between...
journal article 2017
document
Nourian, Pirouz (author), Rezvani, S. (author), Sariyildiz, I.S. (author), van der Hoeven, F.D. (author)
Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond to rooms, convex spaces or star-convex spaces....
conference paper 2016
Searched for: subject%3A%22spectral%255C+graph%255C+theory%22
(1 - 6 of 6)