Related papers: Bayesian/Graphoid intersection property for factor…
The decomposition into interaction subspaces is a hierarchical decomposition of the spaces of cylindrical functions of a finite product space, also called factor spaces. It is an important construction in graphical models and a standard way…
We take a general approach to uncertainty on product spaces, and give sufficient conditions for the independence structures of uncertainty measures to satisfy graphoid properties. Since these conditions are arguably more intuitive than some…
The natural habitat of most Bayesian methods is data represented by exchangeable sequences of observations, for which de Finetti's theorem provides the theoretical foundation. Dirichlet process clustering, Gaussian process regression, and…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
Matrix factorizations of a hypersurface yield a description of the asymptotic structure of minimal free resolutions over the hypersurface. We introduce a new concept of matrix factorizations for complete intersections that allows us to…
We exhibit the symmetric monoidal $\infty$-category $\mathrm{GrCob}$ of graph cobordisms between spaces as a full $\infty$-subcategory of the $\infty$-category $\mathrm{Psh}(\mathrm{Gr})$ of presheaves over $\mathrm{Gr}$, where…
Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
It is well-known that the factorization properties of a domain are reflected in the structure of its group of divisibility. The main theme of this paper is to introduce a topological/graph-theoretic point of view to the current…
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We give a Belyi-type characterisation of smooth complete intersections of general type over $\mathbb{C}$ which can be defined over $\bar{\mathbb{Q}}$. Our proof uses the higher-dimensional analogue of the Shafarevich boundedness conjecture…
We provide a necessary and sufficient condition for the derived self-intersection of a smooth subscheme inside a smooth scheme to be a fibration over the subscheme. As a consequence we deduce a generalized HKR isomorphism. We also…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
We prove, in any positive characteristic, Parseval-Rayleigh identities for the residue map of a homogeneous complete intersection. As an application, we give a conceptual proof of the folklore fact that generic homogeneous complete…
We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bayesian hypergraphs…
In this work we study the intersection properties of a finite disk system in the euclidean space. We accomplish this by utilizing subsets of spheres with varying dimensions and analyze specific points within them, referred to as poles.…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
We consider a possibility of the existence of intersection homology morphism, which would be associated to a map of analytic varieties. We assume that the map is an inclusion of codimension one. Then the existence of a morphism follows from…
We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…