Related papers: Geometric random graphs and Rado sets of continuou…
The genus statistics of isodensity contours has become a well-established tool in cosmology. In this Letter we place the genus in the wider framework of a complete family of morphological descriptors. These are known as the Minkowski…
We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
We prove a commutative Gelfand--Naimark type theorem, by showing that the set $C_s(X)$ of continuous bounded (real or complex valued) functions with separable support on a locally separable metrizable space $X$ (provided with the supremum…
We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…
We study a distance graph $\Gamma_n$ that is isomorphic to the $1$-skeleton of an $n$-dimensional unit hypercube. We show that every measurable set of positive upper Banach density in the plane contains all sufficiently large dilates of…
We further investigate properties of the Gaussian free field (GFF) on the metric graph associated to a discrete weighted graph (where the edges of the latter are replaced by continuous line-segments of appropriate length) that has been…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…
We prove that the spaces of controlled (branched) rough paths of arbitrary order form a continuous field of Banach spaces. This structure has many similarities to an (infinite-dimensional) vector bundle and allows to define a topology on…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),.,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…
A geometric p-rough path can be seen to be a genuine path of finite p-variation with values in a Lie group equipped with a natural distance. The group and its distance lift (R^{d},+,0) and its Euclidean distance. This approach allows us to…
We study asymptotical probabilities of first order and monadic second order properties of Erdos-Renyi random graph G(n,n^{-a}). The random graph obeys FO (MSO) zero-one k-law if for any first order (monadic second order) formulae it is true…
We study the properties of "generic", in the sense of the Haar measure on the corresponding Grassmann manifold, subspaces of l^N_infinity of given dimension. We prove that every "well bounded" operator on such a subspace, say E, is a…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…