Related papers: Nonstandard Analysis of Graphs
In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
We introduce and investigate the algebras of steadily growing length, that is the class of algebras, where the length is bounded by a linear function of the dimension. In particular we show that Malcev algebras belong to this class and…
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
We show that the topological space of any infinite graph and its ends is normal. In particular, end spaces themselves are normal.
In the present paper, we propose a new axiomatic approach to nonstandard analysis and its application to the general theory of spatial structures in terms of category theory. Our framework is based on the idea of internal set theory, while…
Topological data analysis asks when balls in a metric space $(X,d)$ intersect. Geometric data analysis asks how much balls have to be enlarged to intersect. We connect this principle to the traditional core geometric concept of curvature.…
We consider classes of diffeomorphisms of Euclidean space with partial asymptotic expansions at infinity; the remainder term lies in a weighted Sobolev space whose properties at infinity fit with the desired application. We show that two…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
This paper has two goals. The first is to present the construction, due to the author, of measures on non-archimedean analytic varieties associated to metrized line bundles and some of its applications. We take this opportunity to add…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
We investigate certain spaces of infinitesimal motions arising naturally in the rigidity theory of bar and joint frameworks. We prove some structure theorems for these spaces and as a consequence are able to deduce some special cases of a…
Evolution algebras are a special class of non-associative algebras exhibiting connections with different fields of Mathematics. Hilbert evolution algebras generalize the concept through a framework of Hilbert spaces. This allows to deal…
Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from…
We revisit a ballistic deposition process introduced by Atar, Athreya and Kang. Let $\mathcal{G}=(V,E)$ be a finite connected graph. We choose independently and uniformly vertices in $\mathcal{G}$. If a vertex $x$ is chosen and the previous…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
In this paper we study asymptotically hyperbolic manifolds given as graphs of asymptotically constant functions over hyperbolic space $\bH^n$. The graphs are considered as subsets of $\bH^{n+1}$ and carry the induced metric. For such…
Testing the equality in distributions of multiple samples is a common task in many fields. However, this problem for high-dimensional or non-Euclidean data has not been well explored. In this paper, we propose new nonparametric tests based…