相关论文: Separation profiles of graphs of fractals
The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the…
The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…
We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced…
This survey article is dedicated to some families of fractals that were introduced and studied during the last decade, more precisely, families of Sierpi\'nski carpets: limit net sets, generalised Sierpi\'nski carpets and labyrinth…
The methods of determining the fractal dimension and irregularity scale in simulated galaxy catalogs and the application of these methods to the data of the 2dF and 6dF catalogs are analyzed. Correlation methods are shown to be correctly…
The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…
We give lower and upper bounds for the separation profile (introduced by Benjamini, Schramm & Tim\'ar) for various graphs using the isoperimetric profile, growth and Hilbertian compression. For graphs which have polynomial isoperimetry and…
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
Following \cite{Visintin}, we exploit the fractional perimeter of a set to give a definition of fractal dimension for its measure theoretic boundary. We calculate the fractal dimension of sets which can be defined in a recursive way and we…
We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…
This paper establishes a rigorous, quantitative link between the combinatorial complexity of a fractal partition and the intrinsic geometry of its interfaces. We introduce the concept of the \emph{Separation Dimension} ($\sepdim$), a novel…
The separation dimension of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…
We consider intersection graphs of disks of radius $r$ in the hyperbolic plane. Unlike the Euclidean setting, these graph classes are different for different values of $r$, where very small $r$ corresponds to an almost-Euclidean setting and…
This paper contains a comparative study of two families of simple curves drawn in the plane. On the one hand, we have the fractal curves on the unit interval, with self-similar structure, which have associated a Hausdorff dimension. On the…
We present a comprehensive structural characterization of two different highly pure nuclear graphites that compasses all relevant length scales from nanometers to sub-mm. This has been achieved by combining several experiments and neutron…
Noncommutative geometry provides a framework, via the construction of spectral triples, for the study of the geometry of certain classes of fractals. Many fractals are constructed as natural limits of certain sets with a simpler structure:…
This paper presents a comparative study of two families of curves in R(n). The first ones comprise self-similar bounded fractals obtained by contractive processes, and have a non-integer Hausdorff dimension. The second ones are unbounded,…