Related papers: Bayesian/Graphoid intersection property for factor…
This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bag from the second decomposition. We show that every graph in each of the…
We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers…
In this article, we study the question of existence of leafwise intersection points for contact manifolds which are not necessarily of restricted contact type. Moreover we can find a leafwise intersection point on the symplectization for…
The Bayes factor surface is a new way to present results from experimental searches for new physics. Searches are regularly expressed in terms of phenomenological parameters - such as the mass and cross-section of a weakly interacting…
For a smooth (locally trivial) principal bundle in Ehresmann's sense, the relation between the commuting vertical and horizontal actions of the structural Lie group and the structural Lie groupoid (isomorphisms between vertical fibers) is…
In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…
In this paper we study intersections of quadrics, components of the hypersurface in Grassmannian $Gr(3, \CC^n)$ introduced in \cite{SoSuSi}. This lead to an alternative statement and proof of Pappus's Theorem retrieving Pappus's and Hesse…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of…
We show that if a groupoid graded ring has a certain nonzero ideal property, then the commutant of the center of the principal component of the ring has the ideal intersection property, that is it intersects nontrivially every nonzero ideal…
Conditional independence models in the Gaussian case are algebraic varieties in the cone of positive definite covariance matrices. We study these varieties in the case of Bayesian networks, with a view towards generalizing the recursive…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Many known networks have structure of affiliation networks, where each of $n$ network's nodes (actors) selects an attribute set from a given collection of $m$ attributes and two nodes (actors) establish adjacency relation whenever they…
Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…
Recently, a variety of database implementations adopting the property graph model have emerged. However, interoperable management of graph data on these implementations is challenging due to the differences in data models and formats. Here,…
A hypergraph is a generalization of a graph, in which a hyperedge can connect multiple vertices, modeling complex relationships involving multiple vertices simultaneously. Hypergraph pattern matching, which is to find all isomorphic…
Let C be a curve in a compact Kahler surface Y. Assume that the self-intersection of C is vanishing, and the image of the fundamental group of C in Y is of infinite index in the fundamental group of Y. Does it follow that C is a fiber of a…
Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability that a given object is associated with a given vertex. Two…
The factorization theorem for organizing multiple electroweak boson emissions at future colliders with energy far above the electroweak scale is formulated. Taking the inclusive muon-pair production in electron-positron collisions as an…