相关论文: A graph arising in the Geometry of Numbers
Parametric geometry of numbers is a new theory, recently created by Schmidt and Summerer, which unifies and simplifies many aspects of classical Diophantine approximations, providing a handle on problems which previously seemed out of…
Jarnik's identity plays a major role in classical simultaneous approximation to two real numbers. O. German [2] has shown a generalization to the weighted setting in which the identity has to be replaced by two inequalities. His methods…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…
Recently, W. M. Schmidt and L. Summerer developed a new theory called Parametric Geometry of Numbers which approximates the behaviour of the successive minima of a family of convex bodies in $\mathbb{R}^{n}$ related to the problem of…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
We study weighted simultaneous rational approximation to points of the form $(1,\xi,\xi^2)$, for a class of extremal real numbers $\xi$, within the framework of multi-parametric geometry of numbers.
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…
The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…