Related papers: Dimensions of the popcorn graph
This article concerns the dimension theory of the graphs of a family of functions which include the well-known 'popcorn function' and its pyramid-like higher-dimensional analogues. We calculate the box and Assouad dimensions of these…
We discuss the number-theoretic properties of distributions appearing in physical systems when an observable is a quotient of two independent exponentially weighted integers. The spectral density of ensemble of linear polymer chains…
In this paper we study the Assouad dimension of graphs of certain L\'evy processes and functions defined by stochastic integrals. We do this by introducing a convenient condition which guarantees a graph to have full Assouad dimension and…
The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…
We consider a class of "box-like" statistically self-affine functions, and compute the almost-sure box-counting dimension of their graphs. Furthermore, we consider the differentiability of our functions, and prove that, depending on an…
The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…
Functionality is a graph complexity measure that extends a variety of parameters, such as vertex degree, degeneracy, clique-width, or twin-width. In the present paper, we show that functionality is bounded for box intersection graphs in…
Fractional parts of the first $N$ natural numbers fill the unit interval with asymptotically uniform density. However, the gaps around rational points shrink at an asymptotically lower rate $N^{-1/2}$, and their widths scale with the Thomae…
This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical…
We investigate the Assouad spectrum and dimension of graphs of functions lying in certain Banach spaces. We find the typical values in the sense of Baire category, proving that these values are often as large as possible, given the…
We introduce the error-sum function of Pierce expansions. Some basic properties of the error-sum function are analyzed. We also examine the fractal property of the graph of it by calculating the Hausdorff dimension, the box-counting…
We prove that the Hausdorff dimension of the graph of a prevalent continuous function is 2. We also indicate how our results can be extended to the space of continuous functions on $[0,1]^d$ for $d \in \mathbb{N}$ and use this to obtain…
We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…
The limit functions generated by quasi-linear functions or sequences (including the sum of the Rudin-Shapiro sequence as an example) are continuous but almost everywhere non-differentiable functions. Their graphs are fractal curves. In 2017…
We estimate a Box-counting dimension of fractal surfaces which are generated by iterated function systems with a vertical contraction factor function on an arbitrary data set over rectangular grids and can express well a lot of natural…
Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of…
We show that correlation functions for branched polymers correspond to those for $\phi^3$ theory with a single mass insertion, not those for the $\phi^3$ theory themselves, as has been widely believed. In particular, the two-point function…
We determine the Hausdorff and box dimension of the fractal graphs for a general class of Weierstrass-type functions of the form $f(x) = \sum_{n=1}^\infty a_n \, g(b_n x + \theta_n)$, where $g$ is a periodic Lipschitz real function and…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
A classical result of Erd\H{o}s, Lov\'asz and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected…