Related papers: Successively almost positive links
Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…
The potential influence diagram is a generalization of the standard "conditional" influence diagram, a directed network representation for probabilistic inference and decision analysis [Ndilikilikesha, 1991]. It allows efficient inference…
Link prediction plays an important role in understanding intrinsic evolving mechanisms of networks. With the belief that the likelihood of the existence of a link between two nodes is strongly related with their similarity, many methods…
Alan and al. defined and studied quasi-maximal ideals. We add a comprehensive characterization of these ideals, introducing submaximal ideals. The conductor of a finite minimal extension $R\subset S$ is quasi-maximal in $S$. This allows us…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
This article introduces strongly proximal continuous (s.p.c.) functions, strong proximal equivalence (s.p.e.) and strong connectedness. A main result is that if topological spaces $X,Y$ are endowed with compatible strong proximities and…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…
Link prediction in complex networks has attracted considerable attention from interdisciplinary research communities, due to its ubiquitous applications in biological networks, social networks, transportation networks, telecommunication…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
We confirm recently proposed theorems for the structure of next-to-soft corrections in gauge and gravity theories using diagrammatic techniques, first developed for use in QCD phenomenology. Our aim is to provide a useful alternative…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
It is argued that correlations and multiplicity distributions constitute one of the most characteristic properties of strong interactions. The progress made in the last years in our understanding of correlations is reviewed.
The Krein transform is the real counterpart of the Cayley transform and gives a one-to-one correspondence between the positive relations and symmetric contractions. It is treated with a slight variation of the usual one, resulting in an…
This paper provides a theoretical and computational justification of the long held claim that of the similarity of the probit and logit link functions often used in binary classification. Despite this widespread recognition of the strong…
Understanding the structures why links are formed is an important and prominent research topic. In this paper, we therefore consider the link prediction problem in face-to-face contact networks, and analyze the predictability of new and…