Autoregressive graph Volterra models and applications

Graph-based learning and estimation are fundamental problems in various applications involving power, social, and brain networks, to name a few. While learning pair-wise interactions in network data is a well-studied problem, discovering higher-order interactions among subsets of nodes is still not yet fully explored. To this end, encompassing...

Finding Debt Cycles: QUBO Formulations for the Maximum Weighted Cycle Problem Solved Using Quantum Annealing

The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is N P-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 Binary Optimization...

Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule

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)...

Finding Debt Cycles: QUBO Formulations for the Maximum Weighted Cycle Problem Solved Using Quantum Annealing

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...

Dynamic Bi-Colored Graph Partitioning

In this work, we focus on partitioning dynamic graphs with two types of nodes (bi-colored), 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....

Bond-Graph Metamodel Physics-Based Interconnection of Software Components

Degree distribution and assortativity in line graphs of complex networks

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...

Inflection points for network reliability

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 (all-terminal) reliability, Rel(G,p), of G is the probability that the spanning subgraph of operational edges is connected. It has been conjectured that...

Weighted spectral distribution for internet topology analysis: Theory and applications

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...

Virus spread in complete bi-partite graphs

In this paper we study the spread of viruses on the complete bi-partite 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...

Robustness of networks against viruses: The role of the spectral radius

In this paper we study the spectral radius of a number of real-life 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...

Comparison of extreme ultraviolet sources for lithography applications

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 (Z-pinch, Plasma Focus and Capillary discharge) all have the potential to be used for EUV Lithography....

Image segmentation by connectivity preserving relinking in hierarchical graph structures

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...