 document

Yang, Q. (author), Coutino, M. (author), Leus, G. (author), Giannakis, G.B. (author)Graphbased learning and estimation are fundamental problems in various applications involving power, social, and brain networks, to name a few. While learning pairwise interactions in network data is a wellstudied problem, discovering higherorder interactions among subsets of nodes is still not yet fully explored. To this end, encompassing...article 2023
 document

Künnemann, H. (author), Phillipson, F. (author)The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is N Phard, implying that approaches in classical computing are inefficient. Here, Quantum computing might be a promising alternative. Many current approaches to the quantum computer are based on a Quadratic Unconstrained Binary Optimization...article 2023
 document

Erten, Ö. (author), Mehryar, S. (author), Çelebi, R. (author), Brewster, C. (author)Gene Ontology (GO) and its Annotations (GOA) provide a controlled and evolving vocabulary for gene products and gene functions widely used in molecular biology. GO & GOA are updated and maintained both automatically from biological publications and manually by curators. These knowledge bases however are often incomplete for two reasons: 1)...conference paper 2023
 document

Künnemann, H. (author), Phillipson, F. (author)The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is (Formula presented.) hard, implying that approaches in classical computing are inefficient. Here, Quantum computing might be a promising alternative. Many current approaches to the quantum computer are based on a Quadratic Unconstrained...article 2023
 document

He, Y. (author), Coutino, M. (author), Isufi, E. (author), Leus, G. (author)In this work, we focus on partitioning dynamic graphs with two types of nodes (bicolored), though not necessarily bipartite graphs. They commonly appear in communication network applications, e.g., one color being base stations, the other users, and the dynamic process being the varying connection status between base stations and moving users....conference paper 2022
 document
 Cobos Mendez, R. (author), Oliveira Filho, J. (author), Dresscher, D. (author), Broenink, J. (author) conference paper 2020
 document

Wang, X. (author), Trajanovski, S. (author), Kooij, R.E. (author), van Mieghem, P. (author)Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph...article 2016
 document

Brown, J.I. (author), Koç, Y. (author), Kooij, R.E. (author)Given a finite, undirected graph G (possibly with multiple edges), we assume that the vertices are operational, but the edges are each independently operational with probability p. The (allterminal) reliability, Rel(G,p), of G is the probability that the spanning subgraph of operational edges is connected. It has been conjectured that...article 2014
 document

Fay, D. (author), Haddadi, H. (author), Thomason, A. (author), Moore, A.W. (author), Mortier, R. (author), Jamakovic, A. (author), Uhlig, S. (author), Rio, M. (author), TNO Informatie en Communicatietechnologie (author)Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a...article 2010
 document

TNO Informatie en Communicatietechnologie (author), Omic, J.S. (author), Kooij, R.E. (author), van Mieghem, P. (author)In this paper we study the spread of viruses on the complete bipartite graph Km,n. Using mean field theory we first show that the epidemic threshold for this type of graph satifies Tc = 1/√MN, hence, confirming previous results from literature. Next, we find an expression for the average number of infected nodes in the steady state. In addition...conference paper 2007
 document

Jamakovic, A. (author), Kooij, R.E. (author), van Mieghem, P. (author), van Dam, E.R. (author)In this paper we study the spectral radius of a number of reallife networks. This study is motivated by the fact that the smaller the spectral radius, the higher the robustness of a network against the spread of viruses. First we study how wellknown upper bounds for the spectral radius of graphs match to the spectral radii of the social network...conference paper 2006
 document

Banine, V.Y. (author), Benschop, J.P.H. (author), Werij, H.G.C. (author), Technisch Physische Dienst TNO  TH (author)The source is one of the critical factors for the success of Extreme Ultraviolet Lithography (EUVL). Various possibilities to generate EUV radiation exist. The Laser Produced Plasma (LPP), the Synchrotron Wiggler and the gas discharge sources (Zpinch, Plasma Focus and Capillary discharge) all have the potential to be used for EUV Lithography....article 2000
 document

Nacken, P.F.M. (author), TNO Technische Menskunde (author)The method of image segmentation by pyramid relinking is extended to the formalism of hierarchies of region adjacency graphs. This approach has a number of advantages: (1) resulting regions are connected; (2) the method is adaptive, and therefore artifacts caused by a regular grid are avoided; and (3) information on regions and boundaries...article 1995