Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 15 of 15 for “"Periodic Graphs"”.
-
Abelian Sandpile Models on Edge Periodic Graphs
The abelian sandpile model is a Markov chain that is able to decompose any recurrent configuration into a basic alive divisor, some amount of sand placed on the sink vertex, and a series of vertex firings. In this paper we begin to explore some of the dynamics of this system when the edges of the …
-
Components and colourings of singly- and doubly-periodic graphs
Singly-periodic (SP) and doubly-periodic (DP) graphs arc infinite graphs which have translational symmetries in one and two dimensions, respectively. The problem of counting the number of connected components in such graphs is investigated. A method for determining whether or not an SP graph is …
-
Efficient scheduling of real-time compute-intensive periodic graphs on a large grain data flow multiprocessor
… computation. They are programmed using directed graphs whose vertices are functional modules and whose edges denote data dependencies between function modules. An important subclass of DF is Large Grain Data Flow (LGDF) which is efficiently used in computation intensive applications, such as …
-
Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator
… of eigenfunctions of the Schrödinger operator on graphs. In particular, we are interested in the zeros of the eigenfunctions and their relation to the spectrum of the magnetic Schrödinger operator. We begin by studying the nodal count on finite quantum graphs, analyzing both the number and …
-
New algebraic relationships between tight binding models
… By utilising ring operations of weighted digraphs through intermediate König digraph representations, we establish a polynomial algebra over finite and infinite periodic graphs, analogous to polynomial operations on adjacency matrices. Exploring the microscopic and macroscopic behaviour of …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Geometric Deep Learning and Language Models for Materials Discovery
… a primitive unit cell, forming an infinite periodic lattice in three dimensions. This periodic and unbounded structure presents distinct challenges for geometric representation learning. We first consider representation learning on periodic graphs that encode crystal structures. Unlike …
-
Quivers, tilings and branes
… the toric geometry. Brane tilings are bipartite periodic graphs on a torus and they are a graphic representation of 4d N = 1 supersymmetric gauge theories originating from D3-braning probing a Calabi-Yau 3-fold singularity. The combinatoric properties of toric diagrams brane tilings/dimer models …
-
On the Spectrum and Density of States of Graphs and Groups
… more generally the density of states of discrete periodic operators of finite order on G-periodic graphs). Several examples of computations of spectra and spectral measures of Cayley graphs are surveyed. Some well known theorems and applications of the theory to other areas of mathematics …
-
Temporal Distances and Cops and Robber Games on Temporal Networks
… studied for its connection with the structure of graphs as well as by devising algorithms to compute metrics on temporal networks. Cops and Robber Games have been first extended to the context of temporal networks by Erlebach and Spooner with algorithmic methods. The authors assumed a specific …
-
Spectra of Periodic Schrödinger Operators on the Octagonal Lattice
… will prove that Schrödinger operators with 1-1 periodic potentials can open at most two gaps in the spectrum precisely at energies $pm1$, and that a third gap can open at 0 for 2-2 periodic potentials. We describe in detail the structure of these operators for higher periods, and motivate our …