Related papers: Non-Weyl Microwave Graphs
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
Testable weighted graph parameters and equivalent notions of testability are investigated based on papers of Laszlo Lovasz and coauthors. We prove that certain balanced minimum multiway cut densities are testable. Using this fact, quadratic…
The Nielsen number $N(f)$ is a lower bound for the minimal number of fixed points among maps homotopic to $f$. When these numbers are equal, the map is called Wecken. A recent paper by Brimley, Griisser, Miller, and the second author…
A graph is cubical if it is a subgraph of a hypercube. For a cubical graph $H$ and a hypercube $Q_n$, $ex(Q_n, H)$ is the largest number of edges in an $H$-free subgraph of $Q_n$. If $ex(Q_n, H)$ is equal to a positive proportion of the…
A key challenge in wireless networking is the management of interference between transmissions. Identifying which transmitters interfere with each other is a crucial first step. In this paper we cast the task of estimating the a wireless…
We compute the electrical conductivities at non-zero frequency in a top-down holographic model of a Weyl semimetal, consisting of $\mathcal{N}=4$ supersymmetric $\mathrm{SU}(N_c)$ Yang--Mills theory coupled to $\mathcal{N}=2$…
A new metric parameter for a graph, Helly-gap, is introduced. A graph $G$ is called $\alpha$-weakly-Helly if any system of pairwise intersecting disks in $G$ has a nonempty common intersection when the radius of each disk is increased by an…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
Finding graph indices which are unbiased to network size and density is of high importance both within a given field and across fields for enhancing comparability of modern network science studies. The degree variance is an important metric…
Multi-Weyl semimetals are new types of Weyl semimetals which have anisotropic non-linear energy dispersion and a topological charge larger than one, thus exhibiting a unique quantum response. Using a unified lattice model, we calculate the…
Motivated by a recent application of quantum graphs to model the anomalous Hall effect we discuss quantum graphs the vertices of which exhibit a preferred orientation. We describe an example of such a vertex coupling and analyze the…
We investigate the confined states and transport of three-dimensional Weyl electrons around a one-dimensional external rectangular electrostatic potential. Confined states with finite transverse wave vector exist at energies higher than the…
This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…
We introduce a nonparametric way to estimate the global probability density function for a random persistence diagram. Precisely, a kernel density function centered at a given persistence diagram and a given bandwidth is constructed. Our…
Graph and hypergraph states are important resource states for realizing universal quantum computation and diverse non-local physical phenomena. However, noise learning in such states is challenging due to their large entanglement and magic.…
The shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random graph is shift-enabled. In particular, popular graph models ER, WS, BA random graph are used, weighted and…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
The Weak Turbulence Theory is a statistical framework to describe a large ensemble of nonlinearly interacting waves. The archetypal example of such system is the ocean surface that is made of interacting surface gravity waves. Here we…
A graph $G=(V,E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. If $W$ is $k$-uniform (each letter of $W$ occurs exactly $k$…
This work exploits a framework whereby a graph (in the mathematical sense) serves to connect a classical system to a state space that we call `quantum-like' (QL). The QL states comprise arbitrary superpositions of states in a tensor product…