Related papers: Discrete Knot Theory via Lattice-Filtered Move Gra…
We consider the discrete surface growth process with relaxation to the minimum [F. Family, J. Phys. A {\bf 19} L441, (1986).] as a possible synchronization mechanism on scale-free networks, characterized by a degree distribution $P(k) \sim…
A graph-theoretic method is introduced for analyzing fermion mass spectra in latticized theory-space models, including chain models arising from dimensional deconstruction. Fermion mass terms are mapped to bipartite graphs, with fields as…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
We present a discrete theory for modeling developable surfaces as quadrilateral meshes satisfying simple angle constraints. The basis of our model is a lesser known characterization of developable surfaces as manifolds that can be…
We construct a family of one-dimensional (1D) quantum lattice models based on $G$-graded unitary fusion category $\mathcal{C}_G$. This family realize an interpolation between the anyon-chain models and edge models of 2D symmetry-protected…
This work considers the rigorous derivation of continuum models of step motion starting from a mesoscopic Burton-Cabrera-Frank (BCF) type model following the work [Xiang, SIAM J. Appl. Math. 2002]. We prove that as the lattice parameter…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…
The network alignment (or graph matching) problem refers to recovering the node-to-node correspondence between two correlated networks. In this paper, we propose a network alignment algorithm which works without using a seed set of…
This paper introduces an efficient algorithm for persistence diagram computation, given an input piecewise linear scalar field $f$ defined on a $d$-dimensional simplicial complex $K$, with $d \leq 3$. Our work revisits the seminal algorithm…
We develop a systematic method to classify connected \'etale algebras $A$'s in (possibly degenerate) pre-modular category $\mathcal B$. In particular, we find the category of $A$-modules, $\mathcal B_A$, have ranks bounded from above by…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
Cutting a honeycomb lattice (HCL) can end up with three types of edges (zigzag, bearded and armchair), as is well known in the study of graphene edge states. Here we theoretically investigate and experimentally demonstrate a class of…
We introduce a multi-species lattice gas model for motor protein driven collective cargo transport on cellular filaments. We use this model to describe and analyze the collective motion of interacting vesicle cargoes being carried by…
There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…
Coarse-grained modeling of dynamics on vicinal surfaces concentrates on the diffusion of adatoms on terraces with boundary conditions at sharp steps, as first studied by Burton, Cabrera and Frank (BCF). Recent electromigration experiments…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
We give an integrable extension of the lattice models recently considered by I.Kostov in his study of strings in discrete space. These models are IRF models with spin variables living in any connected graph, the vertex model underlying…
Intertwiners between \ade lattice models are presented and the general theory developed. The intertwiners are discussed at three levels: at the level of the adjacency matrices, at the level of the cell calculus intertwining the face…
Graphs drawn in the plane are ubiquitous, arising from data sets through a variety of methods ranging from GIS analysis to image classification to shape analysis. A fundamental problem in this type of data is comparison: given a set of such…