Results 21 to 30 of about 450,197 (278)
IEEE Access, 2021 The intensive deployment of cells in a wireless communication system may significantly increase the network capacity, but it may cause more complex and severe inter-cell interference.
Junxiang Gou +4 more
doaj +1 more source
A 5d perspective on the compactifications of 6d SCFTs to 4d N $$ \mathcal{N} $$ = 1 SCFTs
Journal of High Energy Physics, 2022 Compactifying 6d superconformal field theories (SCFTs) to 4d N $$ \mathcal{N} $$ = 1 theories on two-punctured spheres (tubes) and tori with flux is realized using duality domain walls in 5d N $$ \mathcal{N} $$ = 1 Kaluza-Klein (KK) theories, which are ...
Evyatar Sabag, Matteo Sacchi
doaj +1 more source
IET Cyber-Physical Systems, 2021 Moving target defence (MTD) has been gaining traction to thwart false data injection attacks against state estimation (SE) in the power grid. MTD actively perturbs the reactance of transmission lines equipped with distributed flexible AC transmission ...
Bo Liu, Hongyu Wu
doaj +1 more source
A framework for evaluating statistical dependencies and rank correlations in power law graphs [PDF]
, 2008 We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation.
Litvak, N., Volkovich, Y.V., Zwart, B.
core +10 more sources
Fibers add flavor. Part I. Classification of 5d SCFTs, flavor symmetries and BPS states
Journal of High Energy Physics, 2019 We propose a graph-based approach to 5d superconformal field theories (SCFTs) based on their realization as M-theory compactifications on singular elliptic Calabi-Yau threefolds.
Fabio Apruzzi +4 more
doaj +1 more source
Real rank and topological dimension of higher rank graph algebras [PDF]
, 2015 We study dimension theory for the $C^*$-algebras of row-finite $k$-graphs with no sources. We establish that strong aperiodicity - the higher-rank analogue of condition (K) - for a $k$-graph is necessary and sufficient for the associated $C^*$-algebra to
D. Pask, Adam Sierakowski, A. Sims
semanticscholar +1 more source
Frontiers in Neuroscience, 2021 Objective: Graph theory applications are commonly used in connectomics research to better understand connectivity architecture and characterize its role in cognition, behavior and disease conditions. One of the numerous open questions in the field is how
Sahin Hanalioglu +9 more
doaj +1 more source
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We develop a theory of graph algebras over general fields. This is modelled after the theory developed by Freedman et al. (2007, J. Amer. Math. Soc.20 37–51) for connection matrices, in the study of graph homomorphism functions over real edge weight ...
Jin-Yi Cai, A. Govorov
semanticscholar +1 more source
Classical simulation versus universality in measurement based quantum computation [PDF]
, 2006 We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states, plays a ...
Briegel, H. J. +3 more
core +2 more sources
Skew-products of higher-rank graphs and crossed products by semigroups [PDF]
, 2013 We consider a free action of an Ore semigroup on a higher-rank graph, and the induced action by endomorphisms of the $C^*$-algebra of the graph. We show that the crossed product by this action is stably isomorphic to the $C^*$-algebra of a quotient graph.
Maloney, Ben, Pask, David, Raeburn, Iain
core +3 more sources