相关论文: Explicit examples of DIM constraints for network m…

It is shown that the large $N$ limit of SU(N) YM in $curved$ $m$-dim backgrounds can be subsumed by a higher $m+n$ dimensional gravitational theory which can be identified to an $m$-dim generally invariant gauge theory of diffs $N$, where…

Tensor networks prepare states that share many features of states in quantum gravity. However, standard constructions are not diffeomorphism invariant and do not support an algebra of non-commuting area operators. Recently, analogues of…

Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…

We examine a family of random firing-rate neural networks in which we enforce the neurobiological constraint of Dale's Law --- each neuron makes either excitatory or inhibitory connections onto its post-synaptic targets. We find that this…

K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite…

Gauge invariant topological interactions, such as the D=5 Chern-Simons terms, are required in models in extra dimensions that split anomaly free representations. The Chern-Simons term is necessary to maintain the overall anomaly…

Discrete symmetries play an important role in several extensions of the Standard Model (SM) of particle physics. For instance, in order to avoid flavor changing neutral currents, a discrete $Z_2$ symmetry is imposed on the Two-Higgs-Doublet…

This paper is centred on the spectral study of a Random Fourier matrix, that is an $n\times n$ matrix $A$ whose $(j, k)$ entries are $\exp(2i\pi m X_jY_k)$, with $X_j$ and $Y_k$ two i.i.d sequences of random variables and $1\leq m\leq n$ is…

Identifiability of parameters is an essential property for a statistical model to be useful in most settings. However, establishing parameter identifiability for Bayesian networks with hidden variables remains challenging. In the context of…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

In the recent study of Virasoro action on characters, we discovered that it gets especially simple for peculiar linear combinations of the Virasoro operators: particular harmonics of $\hat w$-operators. In this letter, we demonstrate that…

We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…

Cheeger-Simons differential characters and differential $K$-theory are refinements of ordinary cohomology theory and topological $K$-theory respectively, and they are examples of differential cohomology. Each of these differential…

The existence of symmetries in complex networks has a significant effect on network dynamic behaviour. Nevertheless, beyond topological symmetry, one should consider the fact that real-world networks are exposed to fluctuations or errors,…

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…

We give the general solution of the Ward identity for the linear vector supersymmetry which characterizes all topological models. Such solution, whose expression is quite compact and simple, greatly simplifies the study of theories…

This thesis is devoted to the study of three problems on the Wess-Zumino-Witten (WZW) and Chern-Simons (CS) supergravity theories in the Hamiltonian framework: 1) The two-dimensional super WZW model coupled to supergravity is constructed.…

We derive a generalized Knizhnik-Zamolodchikov equation for the correlation function of the intertwiners of the vector and the MacMahon representations of Ding-Iohara-Miki algebra. These intertwiners are cousins of the refined topological…

Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g., promotion/inhibition in gene regulatory networks, or…

Implicit neural representations (INRs) are a powerful paradigm for modeling data, offering a continuous alternative to discrete signal representations. Their ability to compactly encode complex signals has led to strong performance in many…