Related papers: Non-Weyl Microwave Graphs
A Weyl semimetal is a three dimensional topological gapless phase. In the presence of strong enough disorder it undergoes a quantum transition towards a diffusive metal phase whose universality class depends on the range of disorder…
Graphical models are a succinct way to represent the structure in probability distributions. This article analyzes the graphical model of nodal voltages in non-radial power distribution grids. Using algebraic and structural properties of…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite of the interference caused by simultaneous transmissions.…
We report on experiments that were performed with microwave waveguide systems and demonstrate that in the frequency range of a single transversal mode they may serve as a model for closed and open quantum graphs. These consist of bonds that…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
Finding hidden layers in complex networks is an important and a non-trivial problem in modern science. We explore the framework of quantum graphs to determine whether concealed parts of a multi-layer system exist and if so then what is…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
A Weyl semimetal denotes an electronic phase of solids in which two bands cross linearly. In this paper we study the effect of a spatially correlated disorder on such a phase. Using a renormalization group analysis, we show that in three…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
The $k$-dimensional Weisfeiler-Leman algorithm is a powerful tool in graph isomorphism testing. For an input graph $G$, the algorithm determines a canonical coloring of $s$-tuples of vertices of $G$ for each $s$ between 1 and $k$. We say…
We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…
Existing theoretical works differ on whether three-dimensional Dirac and Weyl semimetals are stable to a short-range-correlated random potential. Numerical evidence suggests the semimetal to be unstable, while some field-theoretic instanton…
Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense…
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…