Related papers: Non-Weyl Microwave Graphs
Already the simplest examples of Weyl geometry, the static space-time models of general relativity modified by an additional time-homogeneous Weylian length connection lead to beautiful cosmological models (Weyl universes) . The…
For stationary signals in time the weak law of large numbers (WLLN) states that ensemble and realization averages are within e of each other with a probability of order O(1/Ne^2) when considering N signal components. The graph WLLN…
Weyl semimetals have been intensely studied as a three dimensional realization of a Dirac-like excitation spectrum where the conduction bands and valence bands touch at isolated Weyl points in momentum space. Like in graphene, this property…
We show that the von Neumann entropy (from herein referred to as the von Neumann index) of a graph's trace normalized combinatorial Laplacian provides structural information about the level of centralization across a graph. This is done by…
The Erd\H{o}s--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$, have homogeneous sets of size significantly larger than one can generally expect to find in a…
In this note we explain the method how to find the resonance condition on quantum graphs, which is called pseudo orbit expansion. In three examples with standard coupling we show in detail how to obtain the resonance condition. We focus on…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The…
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…
We prove a Weyl Law for the phase transition spectrum based on the techniques of Liokumovich-Marques-Neves. As an application we give phase transition adaptations of the proofs of the density and equidistribution of minimal hypersufaces for…
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…
The delta interaction at a vertex generalizes the Robin (generalized Neumann) boundary condition on an interval. Study of a single vertex with N infinite leads suffices to determine the localized effects of such a vertex on densities of…
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
This study presents a detailed analysis of critical phenomena in a holographic Weyl semi-metal (WSM) using the $D3/D7$ brane configuration. The research explores the non-linear response of the longitudinal current \( J \) when subjected to…
k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes,…
A graph $G$ is \emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…