Related papers: On invariant Schreier structures
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a…
We provide sufficient conditions for the existence of a trace on the essential $\mathrm{C}^\ast$-algebra of a (not necessarily Hausdorff) \'etale groupoid $G$ which extends an invariant measure $\mu$ on the unit space of $G$. In particular,…
We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
We study an important property of shape invariant supersymmetric quantum mechanical systems. Particularly, we demonstrate that each shape invariant supersymmetric system can constitute a $Z_3$-graded topological symmetric algebra. The…
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…
In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…
In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an…
A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply…
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to form groups of groups, and so forth, up through all levels of…
I review the state of the art of the investigation on the structure formation in $f(R)$-gravity based on the Covariant and Gauge Invariant approach to perturbations. A critical analysis of the results, in particular the presence of…
For every infinite sequence $\omega=x_1,x_2,...$, with $x_i\in\{0,1\}$, we construct an infinite 4-regular graph $X_{\omega}$. These graphs are precisely the Schreier graphs of the action of a certain self-similar group on the space…
We investigate the structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group. We work with square integrable representations, and we show that they are those for which we can construct an…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…
We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of…