Related papers: Discrete Knot Theory via Lattice-Filtered Move Gra…
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into…
We study a minimal lattice model which describes bidirectional transport of "particles" driven along a one dimensional track, as is observed in microtubule based, motor protein driven bidirectional transport of cargo vesicles, lipid bodies…
The growth of dendritic grains during solidification is often modelled using the Grain Envelope Model (GEM), in which the envelope of the dendrite is an interface tracked by the Phase Field Interface Capturing (PFIC) method. In the PFIC…
The fundamental idea of embedding a network in a metric space is rooted in the principle of proximity preservation. Nodes are mapped into points of the space with pairwise distance that reflects their proximity in the network. Popular…
This paper studies seeded graph matching for power-law graphs. Assume that two edge-correlated graphs are independently edge-sampled from a common parent graph with a power-law degree distribution. A set of correctly matched vertex-pairs is…
Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in…
Methods allowing the synthesis of realistic cell shapes could help generate training data sets to improve cell tracking and segmentation in biomedical images. Deep generative models for cell shape synthesis require a light-weight and…
We develop a categorical foundation for belief propagation on factor graphs. We construct the free hypergraph category \(\Syn_\Sigma\) on a typed signature and prove its universal property, yielding compositional semantics via a unique…
Grid cells in the medial entorhinal cortex and place cells in the hippocampus together support spatial navigation. The two regions are reciprocally connected, and there is a chicken-and-egg problem for how both arise and reinforce each…
The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from…
Based on the algebraic theory of signal processing, we recursively decompose the discrete sine transform of first kind (DST-I) into small orthogonal block operations. Using a diagrammatic language, we then second-quantize this decomposition…
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node,…
We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of $G$, there is a vertex $x$ of $M$ and a vertex $y$ of $G$…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
Graph Neural Networks (GNNs) is an architecture for structural data, and has been adopted in a mass of tasks and achieved fabulous results, such as link prediction, node classification, graph classification and so on. Generally, for a…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
We present a lattice formulation of a dynamic self-consistent field (DSCF) theory that is capable of resolving interfacial structure, dynamics and rheology in inhomogeneous, compressible melts and blends of unentangled homopolymer chains.…
Several theoretical models based on totally asymmetric simple exclusion process (TASEP) have been extensively utilized to study various non-equilibrium transport phenomena. Inspired by the the role of microtubule-transported vesicles in…
We construct a one-parameter family of lattice models starting from a two-dimensional rational conformal field theory on a torus with a regular lattice of holes, each of which is equipped with a conformal boundary condition. The lattice…
In this paper we continue to investigate the lattice models obtained from 2d CFTs via the construction introduced in [arXiv:2112.01563]. On the side of the 2d CFT we consider the cloaking boundary condition relative to a fixed fusion…