Related papers: Orbital Graphs
Geospatial sciences include a wide range of applications, from environmental monitoring transportation to infrastructure planning, as well as location-based analysis and services. Graph theory algorithms in mathematics have emerged as…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical…
In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…
The main problem is to understand and to find periodic symmetric orbits in the $n$-body problem, in the sense of finding methods to prove or compute their existence, and more importantly to describe their qualitative and quantitative…
The aim of this chapter is twofold. In the first part we will provide a brief overview of the mathematical and statistical foundations of graphical models, along with their fundamental properties, estimation and basic inference procedures.…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
This paper has a double goal, the first one is to make a slight survey of some theoretical results about the existence of positively invariant curves that allow to describe important properties of the set of bounded orbits and its boundary…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
Orthogonal Graph Representations are essential tools for testing existence of hidden variables in quantum theory. As required by the interpretation of Copenhaghe on the foundations of quantum mechanics, a physical observable is not…
In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…
A graph is a structure composed of a set of vertices (i.e.nodes, dots) connected to one another by a set of edges (i.e.links, lines). The concept of a graph has been around since the late 19$^\text{th}$ century, however, only in recent…
Understanding and interacting with everyday physical scenes requires rich knowledge about the structure of the world, represented either implicitly in a value or policy function, or explicitly in a transition model. Here we introduce a new…
We present a novel orbit parameterization in spherical coordinates. This parameterization enables the mixing of varying and invariant orbital parameters, and clarifies the physics of the orbit. It also simplifies the process of placing…
There has been quite some activity and progress concerning spectral asymptotics of random operators that are defined on percolation subgraphs of different types of graphs. In this short survey we record some of these results and explain the…