Results 11 to 20 of about 449,987 (313)
Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study [PDF]
We carry out a detailed exploration of the deformations of rank-two five-dimensional superconformal field theories (SCFTs) T X $$ {\mathcal{T}}_{\mathbf{X}} $$ , which are geometrically engineered by M-theory on the space transverse to isolated toric ...
Vivek Saxena
doaj +2 more sources
Dilation Theory for Rank 2 Graph Algebras
29 pages, 5 ...
Kenneth R. Davidson+2 more
openalex +4 more sources
On the K-theory of higher rank graph C*-algebras
Given a row-finite $k$-graph $ $ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*( )$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*( )$. The $K$-groups of $C^*( )$ for $k>2$ can be calculated under certain circumstances and we consider the case $k=3$. We prove that
D. Gwion Evans
openalex +4 more sources
Asymptotic tensor rank of graph tensors: beyond matrix multiplication [PDF]
We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices.
Christandl, Matthias+2 more
core +5 more sources
Identifying Influential Nodes Based on Evidence Theory in Complex Network [PDF]
Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes ...
Fu Tan+5 more
doaj +2 more sources
On the K-theory of twisted higher-rank-graph C*-algebras [PDF]
Alex Kumjian, David Pask, Aidan Sims
semanticscholar +4 more sources
Deep generative model for the inverse design of Van der Waals heterostructures [PDF]
This study proposes ConditionCDVAE+, a crystal diffusion variational autoencoder (CDVAE) based deep generative model for inverse design of van der Waals (vdW) heterostructures.
Shikun Gao+9 more
doaj +2 more sources
Dilation theory for rank two graph algebras.
An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more generally, with commutation relations determined by a unitary matrix $u$ in $M_m(\bC) \otimes M_n ...
Kenneth R. Davidson+2 more
openalex +2 more sources
The treewidth of 2-section of hypergraphs [PDF]
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj +1 more source
Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks [PDF]
Our study reveals new theoretical insights into over-smoothing and feature over-correlation in graph neural networks. Specifically, we demonstrate that with increased depth, node representations become dominated by a low-dimensional subspace that depends
Andreas Roth, T. Liebig
semanticscholar +1 more source