Related papers: Distributive Lattices, Polyhedra, and Generalized …

Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We…

We study the fine distribution of lattice points lying on expanding circles in the hyperbolic plane $\mathbb{H}$. The angles of lattice points arising from the orbit of the modular group $PSL_{2}(\mathbb{Z})$, and lying on hyperbolic…

We propose a hierarchical normalizing flow model for generating molecular graphs. The model produces new molecular structures from a single-node graph by recursively splitting every node into two. All operations are invertible and can be…

Normalizing flows are a powerful tool for building expressive distributions in high dimensions. So far, most of the literature has concentrated on learning flows on Euclidean spaces. Some problems however, such as those involving angles,…

In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…

Disordered systems like liquids, gels, glasses, or granular materials are not only ubiquitous in daily life and in industrial applications but they are also crucial for the mechanical stability of cells or the transport of chemical and…

Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…

We consider a generalization of the diffusion equation on graphs. This generalized diffusion equation gives rise to both normal and superdiffusive processes on infinite one-dimensional graphs. The generalization is based on the $k$-path…

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

A generalised notion of connection on a fibre bundle E over a manifold M is presented. These connections are characterised by a smooth distribution on E which projects onto a (not necessarily integrable) distribution on M and which, in…

We survey the distributional properties of progressively dilating sets under projection by covering maps, focusing on manifolds of constant sectional curvature. In the Euclidean case, we review previously known results and formulate some…

Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…

Diffusion probabilistic models have quickly become a major approach for generative modeling of images, 3D geometry, video and other domains. However, to adapt diffusion generative modeling to these domains the denoising network needs to be…

Complex networks are characterized by latent geometries induced by their topology or by the dynamics on the top of them. In the latter case, different network-driven processes induce distinct geometric features that can be captured by…

Stanley (1986) introduced the order polytope and chain polytope of a partially ordered set and showed that they are related by a piecewise-linear homeomorphism. In this paper we view order and chain polytopes as instances of distributive…

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

The lattice Gelfand-Dickey hierarchy is a lattice version of the Gelfand-Dickey hierarchy. A special case is the lattice KdV hierarchy. Inspired by recent work of Buryak and Rossi, we propose an extension of the lattice Gelfand-Dickey…

We introduce a categorical framework for diffusion on network-structured data valued in weighted lattices, extending the Laplacian paradigm beyond the category of Hilbert spaces. Central to our approach is the Lawvere Laplacian, an…

Much effort has been put into developing samplers with specific properties, such as producing blue noise, low-discrepancy, lattice or Poisson disk samples. These samplers can be slow if they rely on optimization processes, may rely on a…

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…