Related papers: Connectivity Properties of Factorization Posets in…
We show that there are contact 3-manifolds of support genus one which admit infinitely many Stein fillings, but do not admit arbitrarily large ones. These Stein fillings arise from genus-1 allowable Lefschetz fibrations with distinct…
We show that eigenvector centrality exhibits localization phenomena on networks that can be easily partitioned by the removal of a vertex cut set, the most extreme example being networks with a cut vertex. Three distinct types of…
This work forms a foundational study of factorization homology, or topological chiral homology, at the generality of stratified spaces with tangential structures. Examples of such factorization homology theories include intersection…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
We consider a generalization of the axioms of a TQFT, so called half-projective TQFT's, with an anomaly, $x^{\mu}$, in the composition law. $\mu$ is a coboundary on the cobordism categories with non-negative, integer values. The element $x$…
We answer a question on group connectivity suggested by Jaeger et al. [Group connectivity of graphs -- A nonhomogeneous analogue of nowhere-zero flow properties, JCTB 1992]: we find that $\mathbb Z_2^2$-connectivity does not imply $\mathbb…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoting a certain…
The graph theoretic properties of the clustering coefficient, characteristic (or average) path length, global and local efficiency, provide valuable information regarding the structure of a graph. These four properties have applications to…
These notes are an expanded version of two series of lectures given at the winter school in mathematical physics at les Houches and at the Vietnamese Institute for Mathematical Sciences. They are an introduction to factorization algebras,…
Homophily -- the tendency of nodes to connect to others of the same type -- is a central issue in the study of networks. Here we take a local view of homophily, defining notions of first-order homophily of a node (its individual tendency to…
This work is divided into two main parts. The first part is devoted to exploring the connectivity of random subgraphs of cartesian products of $K_1$, $K_2$, and $P_3$. In the second part, the author presents a short review of the results…
We study the irreducible components of special loci of curves whose group of symmetries is given as certain group extension. We introduce some relative Hurwitz data, which we show by using mixed \'etale cohomology theory, identifies some…
Many complex systems can be described in terms of networks of interacting units. Recent studies have shown that a wide class of both natural and artificial nets display a surprisingly widespread feature: the presence of highly heterogeneous…
These are notes from an informal mini-course on factorization homology, infinity-categories, and topological field theories. The target audience was imagined to be graduate students who are not homotopy theorists.
Generating scene graph to describe all the relations inside an image gains increasing interests these years. However, most of the previous methods use complicated structures with slow inference speed or rely on the external data, which…
We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with…
We consider the scaling limit of a generic ferromagnetic system with a continuous phase transition, on the half plane with boundary conditions leading to the equilibrium of two different phases below criticality. We use general properties…