Related papers: Non-Weyl Microwave Graphs
Weyl semimetals are gapless quasi-topological materials with a set of isolated nodal points forming their Fermi surface. They manifest their quasi-topological character in a series of topological electromagnetic responses including the…
The Weyl particle is the massless fermionic cousin of the photon. While no fundamental Weyl particles have been identified, they arise in condensed matter and meta-material systems, where their spinor nature imposes topological constraints…
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…
A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…
Graphene as a two-dimensional (2D) topological Dirac semimetal has attracted much attention for its outstanding properties and potential applications. However, three-dimensional (3D) topological semimetals for carbon materials are still…
Weyl semi-metals are three dimensional generalizations of graphene with point-like Fermi surfaces. Their linear electronic dispersion leads to a window in the particle-hole excitation spectrum which allows for undamped propagation of…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
Given the overcrowding in the 300 MHz-3 GHz spectrum, millimeter wave (mmWave) spectrum is a promising candidate for the future generations of wireless networks. With the unique propagation characteristics at mmWave frequencies, one of the…
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large…
Most graph kernels are an instance of the class of $\mathcal{R}$-Convolution kernels, which measure the similarity of objects by comparing their substructures. Despite their empirical success, most graph kernels use a naive aggregation of…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
Non-Hermitian systems exhibit diverse graph patterns of energy spectra under open boundary conditions. Here we present an algebraic framework to comprehensively characterize the spectral geometry and graph topology of non-Bloch bands. Using…
Some non-linear generalizations of classical Radon tomography were recently introduced by M. Asorey et al [Phys. Rev. A 77, 042115 (2008), where the straight lines of the standard Radon map are replaced by quadratic curves (ellipses,…
We construct models of many-particle quantum graphs with singular two-particle contact interactions, which can be either hardcore- or delta-interactions. Self-adjoint realisations of the two-particle Laplacian including such interactions…
In this paper, we present some new results on non-Riemannian geometry, more specifically, asymmetric connections and Weyl's geometry. For asymmetric connections, we show that a projective change in the symmetric part generates a vector…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
This work deals with quantum graphs, focusing on the transmission properties they engender. We first select two simple diamond graphs, and two hexagonal graphs in which the vertices are all of degree 3, and investigate their transmission…
To capture important physical properties of a spacetime we construct a new diagram, the card diagram, which accurately draws generalized Weyl spacetimes in arbitrary dimensions by encoding their global spacetime structure, singularities,…
We consider a family of quantum graphs $\{(\Gamma,\mathcal{A}_\varepsilon)\}_{\varepsilon>0}$, where $\Gamma$ is a $\mathbb{Z}^n$-periodic metric graph and the periodic Hamiltonian $\mathcal{A}_\varepsilon$ is defined by the operation…
The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…