Related papers: Continuum limits of homogeneous binary trees and t…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
We consider the representation of operators in terms of tensor networks and their application to ground-state approximation and time evolution of systems with long-range interactions. We provide an explicit construction to represent an…
The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…
The p-adic AdS/CFT correspondence relates a CFT living on the p-adic numbers to a system living on the Bruhat-Tits tree. Modifying our earlier proposal for a tensor network realization of p-adic AdS/CFT, we prove that the path integral of a…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
We develop a new technique for computing higher limits of functors over filtered posets by constructing explicit fibrant replacements within a suitable model category structure. We apply this procedure to develop two systematic vanishing…
Motivated by the three-dimensional topological field theory / two-dimensional conformal field theory (CFT) correspondence, we study a broad class of one-dimensional quantum mechanical models, known as anyonic chains, that can give rise to…
Topological constraints on a dynamical system often manifest themselves as breaking of the Hamiltonian structure; well-known examples are non-holonomic constraints on Lagrangian mechanics. The statistical mechanics under such topological…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…
Tensor network techniques are becoming increasingly popular tools to solve partial differential equations within the so-called quantics representation. Their popularity stems from the fact that their spatial resolution depends only…
We consider the Steiner tree problem in hyperbolic geometry in the context of the AdS/CFT duality between large-$c$ conformal blocks on the boundary and particle motions in the bulk. The Steiner trees are weighted graphs on the Poincare…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
Behavior trees represent a hierarchical and modular way of combining several low-level control policies into a high-level task-switching policy. Hybrid dynamical systems can also be seen in terms of task switching between different…
Formal power series products appear in nonlinear control theory when systems modeled by Chen-Fliess series are interconnected to form new systems. In fields like adaptive control and learning systems, the coefficients of these formal power…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
Existing tensor network models of holography are limited to representing the geometry of constant time slices of static spacetimes. We study the possibility of describing the geometry of a dynamic spacetime using tensor networks. We find it…
Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…