Related papers: Bayesian/Graphoid intersection property for factor…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
AThe paper gives a few arguments in favour of the use of chain graphs for description of probabilistic conditional independence structures. Every Bayesian network model can be equivalently introduced by means of a factorization formula with…
Property Testing is a formal framework to study the computational power and complexity of sampling from combinatorial objects. A central goal in standard graph property testing is to understand which graph properties are testable with…
The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs…
A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
Property $(P)$, introduced in recent work and rooted in the classical theory of Parter vertices, concerns the existence of a nonsingular matrix $A\in S(G)$ for which every vertex of $G$ is a $P$-vertex. Previous investigations have fully…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
In a previous joint work with Aurichi and Magalh\~aes Jr., we showed that the topological spaces arising from the edge-end structure of infinite graphs define a proper subfamily of those obtained through the well-known (vertex-)ends. This…
Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P^n, n>=3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and…
By generalizing the Landau-Ginzburg/Calabi-Yau correspondence for hypersurfaces, we can relate a Calabi-Yau complete intersection to a hybrid Landau-Ginzburg model: a family of isolated singularities fibered over a projective line. In…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
The decomposition into interaction subspaces is an important result for graphical models and plays a central role for results on the linearized marginal problem; similarly the Chaos decomposition plays an important role in statistical…
The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…
Bayesian networks are now being used in enormous fields, for example, diagnosis of a system, data mining, clustering and so on. In spite of their wide range of applications, the statistical properties have not yet been clarified, because…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
This paper explores the use of factor graphs as an inference and analysis tool for Bayesian peer-to-peer decentralized data fusion. We propose a framework by which agents can each use local factor graphs to represent relevant partitions of…
We generalize some properties related to Hilbert series and Lefschetz properties of Milnor algebras of projective hypersurfaces with isolated singularities to the more general case of an almost complete intersection ideal $J$ of dimension…
We prove a Cayley-Bacharach-type theorem for points in projective space $\mathbb{P}^n$ that lie on a complete intersection of $n$ hypersurfaces. This is made possible by new bounds on the growth of the Hilbert function of almost complete…