相关论文: Nonstandard Analysis of Graphs

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

Here we consider piecewise fractional linear maps with three branches. The paper presents a study of invariant measures with densities which can be written as infinite series. These series either have infinitely many poles or they sum up to…

We deal with rigidity results for compact gradient Einstein-type manifolds with nonempty boundaries. As a result, we obtain new characterizations for hemispheres and geodesic balls in simply connected space forms. In dimensions three and…

We study the relation between the exponential growth rate of volume in a pinched negatively curved manifold and the critical exponent of its lattices. These objects have a long and interesting story and are closely related to the geometry…

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…

We prove a non-squeezing result for infinite-dimensional Hamiltonian flows using non-standard model theory. For this we prove the existence of a corresponding family of pseudoholomorphic spheres and characterize the maximal time in terms of…

Strict outerconfluent drawing is a style of graph drawing in which vertices are drawn on the boundary of a disk, adjacencies are indicated by the existence of smooth curves through a system of tracks within the disk, and no two adjacent…

We observe that a ball of radius $1$ in the grandfather graph can not be realized as a ball of radius $1$ in a finite vertex transitive graph. We remark on when a ball in a finite vertex transitive graph appears as a ball in an infinite…

We introduce the space of grid functions, a space of generalized functions of nonstandard analysis that provides a coherent generalization both of the space of distributions and of the space of Young measures. We will show that in the space…

Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…

We study the asymptotic properties of geodesically convex $M$-estimation on non-linear spaces. Namely, we prove that under very minimal assumptions besides geodesic convexity of the cost function, one can obtain consistency and asymptotic…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

The aim of this paper is to study symmetries of linearly singular differential equations, namely, equations that can not be written in normal form because the derivatives are multiplied by a singular linear operator. The concept of…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

We introduce here a class of stochastic partial differential equations defined on a graph and we show how they are obtained as the limit of suitable stochastic partial equations defined in a narrow channel, as the width of the channel goes…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…

We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.

Mapping complex input data into suitable lower dimensional manifolds is a common procedure in machine learning. This step is beneficial mainly for two reasons: (1) it reduces the data dimensionality and (2) it provides a new data…