Related papers: On the classification of CW complexes with prescri…
The purpose of this review is to introduce the reader to graph kernels and the corresponding literature, with an emphasis on those with direct application to chemoinformatics. Graph kernels are functions that allow for the inference of…
Each complex network (or class of networks) presents specific topological features which characterize its connectivity and highly influence the dynamics of processes executed on the network. The analysis, discrimination, and synthesis of…
With the increasing availability and size of multi-omics datasets, investigating the casual relationships between molecular phenotypes has become an important aspect of exploring underlying biology and genetics. This paper aims to introduce…
Metaquerying is a datamining technology by which hidden dependencies among several database relations can be discovered. This tool has already been successfully applied to several real-world applications. Recent papers provide only…
The goal of this paper is to present a number of problems about automorphism groups of nonpositively curved polyhedral complexes and their lattices, meant to highlight possible directions for future research.
Systematic relations between multiple objects that occur in various fields can be represented as networks. Real-world networks typically exhibit complex topologies whose structural properties are key factors in characterizing and further…
Bipartite networks provide an effective resource for representing, characterizing, and modeling several abstract and real-world systems and structures involving binary relations, which include food webs, social interactions, and…
This is a presentation of recent work on quantum permutation groups, complex Hadamard matrices, and the connections between them. A long list of problems is included. We include as well some conjectural statements, about matrix models.
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…
The topological classification of all known non-magnetic crystalline compounds is now complete, revealing thousands of new candidate topological materials waiting to be explored in the lab.
The unconventional technologies, currently applied at a certain category of materials, difficult to be processed through usual techniques, have undergone during the last 60 years all the stages, since their discovery to their use on a large…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…
This is not in any way meant to be a complete survey on positive curvature. Rather it is a short essay on the fascinating changes in the landscape surrounding positive curvature. In particular, details and many results and references are…
This work investigates the framework and performance issues of the composite neural network, which is composed of a collection of pre-trained and non-instantiated neural network models connected as a rooted directed acyclic graph for…
The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the…
Inference and prediction are fundamental to the study of complex systems, where network data are often incomplete, inaccurate or obtained indirectly. In this paper, we review recent advances in network sampling and comparison, as well as in…
These notes fill in results about oriented percolation that are required for the paper [3] ("Forward clusters for degenerate random environments"). Since these are essentially modifications of results found in other sources (but adapted to…
Link prediction has aroused extensive attention since it can both discover hidden connections and predict future links in the networks. Many unsupervised link prediction algorithms have been proposed to find these links in a variety of…
In this article some noncommutative topological objects such as NC mapping cone and NC mapping cylinder are introduced. We will see that these objects are equipped with the NCCW complex structure of [PEDERSEN]. As a generalization we…