Related papers: Hausdorff dimensions for graph-directed measures d…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We consider infinite measure-preserving non-primitive self-similar tiling systems in Euclidean space $\mathbb R^d$. We establish the second-order ergodic theorem for such systems, with exponent equal to the Hausdorff dimension of a…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We study a conductance-weighted arboricity for a finite simple undirected graph $G=(V,E,c)$ with a conductance assignment $c:E\to[0,\infty)$: \[ A_c(G):=\max\bigl\{ D_c(H): H\subseteq G\text{ connected}, |V(H)|\ge 2 \bigr\},\qquad…
This paper focuses on certain finite dimensional point derivations for the non-selfadjoint operator algebras corresponding to directed graphs. We begin by analyzing the derivations corresponding to full matrix representations of the tensor…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural…
Let $ \tau : [0,1] \rightarrow [0,1] $ be a piecewise expanding map with full branches. Given $ \lambda : [0,1] \rightarrow (0,1) $ and $ g : [0,1] \rightarrow \mathbb{R} $ satisfying $ \tau ' \lambda > 1 $, we study the Weierstrass-type…
The Hausdorff dimension of a set can be detected using the Riesz energy. Here, we consider situations where a sequence of points, $\{x_n\}$, ``fills in'' a set $E \subset \mathbb{R}^d$ in an appropriate sense and investigate the degree to…
Hausdorff dimensions of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections'' of a "network" corresponding to a fractal set, $F$. This lead to the definition of the…
In this paper, we investigate the Hausdorff dimension of naturally occurring sets of inhomogeneous well-approximable points with a sequence of real invertible matrices $\mathcal{A}=(A_n)_{n\in\mathbb{N}}$. Specifically, for a given point…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
Dobi\'nski set $\mathcal{D}$ is an exceptional set for a certain infinite product identity, whose points are characterized as having exceedingly good approximations by dyadic rationals. We study the Hausdorff dimension and logarithmic…
We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random…
The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…
We construct a self-affine sponge in $\mathbb R^3$ whose dynamical dimension, i.e. the supremum of the Hausdorff dimensions of its invariant measures, is strictly less than its Hausdorff dimension. This resolves a long-standing open problem…
LLet $f$ be a holomorphic endomorphism of $\mathbb P^ 2$ of degree $d \geq 2$. We estimate the local directional dimensions of closed positive currents $S$ with respect to ergodic dilating measures $\nu$. We infer several applications. The…
We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
We introduce the notion of tubular dimension, and give a formula for it. As an application we show that every invariant measure of a $C^{1+\gamma}$ diffeomorphism of a closed Riemannian manifold admits an asymptotic local product structure…