Related papers: Fun with replicas: tripartitions in tensor network…
Let $G$ be a countable graph containing a copy of the countable random graph (Erd\H{o}s-R\'enyi graph, Rado graph), $Emb (G)$ the monoid of its self-embeddings, ${\mathbb P} (G)=\{f[G]: f\in Emb (G)\}$ the set of copies of $G$ contained in…
Given a Polish group $G$, let $E(G)$ be the right coset equivalence relation $G^\omega/c(G)$, where $c(G)$ is the group of all convergent sequences in $G$. The connected component of the identity of a Polish group $G$ is denoted by $G_0$.…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
Exact hierarchical agglomerative clustering (HAC) of large spatial datasets is limited in practice by the $\mathcal{O}(n^2)$ time and memory required for the full pairwise distance matrix. We present GSHAC (Geographically Sparse…
The relation between Loop Quantum Gravity (LQG) and tensor network is explored from the perspectives of bulk-boundary duality and holographic entanglement entropy. We find that the LQG spin-network states in a space $\Sigma$ with boundary…
Tensor network states are capable of describing many-body systems with complex quantum entanglement, including systems with non-trivial topological order. In this paper, we study methods to calculate the topological properties of a tensor…
Let $G$ be a connected graph and $W=\{ w_1, w_2, \ldots, w_k \} \subseteq V(G)$ be an ordered set. For every vertex $v$, the metric representation of $v$ with respect to $W$ is an ordered $k$-vector defined as $r(v|W):=(d(v,w_1), d(v,w_2),…
We deconstruct the performance of GANs into three components: 1. Formulation: we propose a perturbation view of the population target of GANs. Building on this interpretation, we show that GANs can be viewed as a generalization of the…
The complexity of quantum many-body systems is manifested in the vast diversity of their correlations, making it challenging to distinguish the generic from the atypical features. This can be addressed by analyzing correlations through…
We first propose a new separability criterion based on algebraic-geometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r <m+n-2, generic rank r mixed states in mxn systems have relatively high…
We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using…
Boxicity of a graph $G(V,$ $E)$, denoted by $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$. The problem of computing boxicity is inapproximable even…
Tensor networks are useful toy models for understanding the structure of entanglement in holographic states and reconstruction of bulk operators within the entanglement wedge. They are, however, constrained to only prepare so-called…
The multipartite quantum networks feature multiple independent sources, in contrast to the conventional multipartite Bell experiment involving a single source. So far, network nonlocality has been explored when each source produces a…
Topological holography is a holographic principle that describes the generalized global symmetry of a local quantum system in terms of a topological order in one higher dimension. This framework separates the topological data from the local…
Lov\'asz and his coauthors defined the notion of microcanonical ground state energy $\hat{\mathcal{E}}_\mathbb{a} (G,J)$ -- borrowed from the statistical physics -- for weighted graphs $G$, where $\mathbb{a}$ is a probability distribution…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…
A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. A set…
Upon a matrix representation of a binary bipartite network, via the permutation invariance, a coupling geometry is computed to approximate the minimum energy macrostate of a network's system. Such a macrostate is supposed to constitute the…