Related papers: Gapped Lineon and Fracton Models on Graphs
The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more…
We broaden the scope of quantum field theory by introducing a general class of discrete gauge theories that realize either topological order or fracton behavior across dimensions. We start from translation-invariant systems endowed with…
As opposed to the conventional, approximate theory of electrical conduction in solids, which is based on energy band, quasi-particle states in infinite lattices, a rigorous theory exists that can be used to explain transport phenomena, in…
We demonstrate the spontaneous formation of spatial patterns in a damped, ac-driven cubic Klein-Gordon lattice. These patterns are composed of arrays of intrinsic localized modes characteristic for nonlinear lattices. We analyze the…
We study neural architectures in which each hidden layer is defined by the stationary state of a dissipative Schr\"odinger-type dynamics on a learned latent graph. On stable branches, the local stationary problem defines a differentiable…
We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…
We exhibit simple lattice systems, motivated by recently proposed cold atom experiments, whose continuum limits interpolate between real and $p$-adic smoothness as a spectral exponent is varied. A real spatial dimension emerges in the…
In latent-position random graph models (LPMs), latent vertex positions $U_{1},\ldots,U_{n}$ are sampled from some distribution on a latent space $\Omega$, then edges of an observed graph $G = ([n],E)$ are sampled with some probability…
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good…
We study a nonlinear Glauber-Fock lattice and the conditions for the excitation of localized structures. We investigate the particular linear properties of these lattices, including linear localized modes. We investigate numerically…
\emph{Effective} gauge fields arise in the description of the dynamics of defects in lattices of graphene in condensed matter. The interactions between neighboring nodes of a lattice/spin-network are described by the Hubbard model whose…
Let $X=G/H$ be a homogeneous space, where $G \supset H$ are reductive Lie groups. We ask: in the setting where $\Gamma \backslash G/H$ is a standard quotient, to what extent can the discrete subgroup $\Gamma$ be deformed while preserving…
Local configurational symmetry in lattice structures may give rise to stationary, compact solutions, even in the absence of disorder and nonlinearity. These compact solutions are related to the existence of flat dispersion curves (bands).…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
Lattice gauge theories are a powerful language to theoretically describe a variety of strongly correlated systems, including frustrated magnets, high-$T_c$ superconductors, and topological phases. However, in many cases gauge fields couple…
The low-energy physics of systems with spontaneously broken continuous symmetry is dominated by the ensuing Nambu-Goldstone bosons. It has been known for half a century how to construct invariant Lagrangian densities for the low-energy…
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…
Complications arising from the non-compact nature of the phase space of N-body systems prevent any asymptotic characterization of chaotic behaviour (since no equilibrium final states can exist). This leads us to revisit some of the old…
The stability of a galaxy model is most easily assessed through N-body simulation. Particle-mesh codes have been widely used for this purpose, since they enable the largest numbers of particles to be employed. We show that the functional…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…