Related papers: Graph covers and ergodicity for 0-dimensional syst…
Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
In another article we associated a dynamical system to a non-properly ordered Bratteli diagram. In this article we describe how to compute the $K-$group $K_0$ of the dynamical system in terms of the Bratteli diagram. In the case of properly…
In this work, we explore the interplay between graph limit theory, the geometry of underlying probability spaces, spectral theory, and network dynamical systems. We investigate two primary questions concerning forward and inverse…
Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some…
In this work we perform a detailed statistical analysis of topological and spectral properties of random geometric graphs (RGGs); a graph model used to study the structure and dynamics of complex systems embedded in a two dimensional space.…
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…
We introduce two new tools for studying CAT(0) spaces: \emph{curtains}, versions of cubical hyperplanes; and the \emph{curtain model}, a counterpart of the curve graph. These tools shed new light on CAT(0) spaces, allowing us to prove a…
We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured…
The purpose of the paper is a general analysis of path space measures. Our focus is a certain path space analysis on generalized Bratteli diagrams. We use this in a systematic study of systems of self-similar measures (the term ``IFS…
A unit ball graph consists of a set of vertices, labeled by points in Euclidean space, and edges joining all pairs of points within distance 1. These geometric graphs are used to model a variety of spatial networks, including communication…
The Euler graph has vertices labelled (n,k) for n=0,1,2,... and k=0,1,...,n, with k+1 edges from (n,k) to (n+1,k) and n-k+1 edges from (n,k) to (n+1,k+1). The number of paths from (0,0) to (n,k) is the Eulerian number A(n,k), the number of…
A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
We provide two methods to characterize the connectedness of all $d$-dimensional generalized Sierpi\'nski sponges whose corresponding IFSs are allowed to have rotational and reflectional components. Our approach is to reduce it to an…
This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…
A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…