Related papers: Dimensions of the popcorn graph
This note explores the relation between the boxicity of undirected graphs and the Ferrers dimension of digraphs.
The fractal dimension of a surface allows its degree of roughness to be characterized quantitatively. However, limited effort is attempted to calculate the fractal dimension of surfaces computed from precisely known atomic coordinates from…
\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…
We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…
We consider supercritical bond percolation on a family of high-girth $d$-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linear-sized ("giant'') component is…
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of…
Kim and Vu made the following conjecture (\textit{Advances in Mathematics}, 2004): if $d\gg \log n$, then the random $d$-regular graph $G(n,d)$ can be ``sandwiched'' between $G(n,p_*)$ and $G(n,p^*)$ where $p_*$ and $p^*$ are both…
We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…
Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.
We compute analytically and in closed form the four-point correlation function in the plane, and the two-point correlation function in the upper half-plane, of layering vertex operators in the two dimensional conformally invariant system…
We present some classical and weighted Poincar\'e inequalities for some one-dimensional probability measures. This work is the one-dimensional counterpart of a recent study achieved by the authors for a class of spherically symmetric…
The Assouad dimension of the limit set of a geometrically finite Kleinian group with parabolics may exceed the Hausdorff and box dimensions. The Assouad \emph{spectrum} is a continuously parametrised family of dimensions which…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
The large $N$ asymptotic expansion of the partition function for the normal matrix model is predicted to have special features inherited from its interpretation as a two-dimensional Coulomb gas. However for the latter, it is most natural to…
Using the geodesic distance on the $n$-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function…
We consider the component structure of the random digraph $D(n,p)$ inside the critical window $p = n^{-1} + \lambda n^{-4/3}$.We show that the largest component $\mathcal{C}_1$ has size of order $n^{1/3}$ in this range. In particular we…
The wrapped normal distribution arises when a the density of a one-dimensional normal distribution is wrapped around the circle infinitely many times. At first look, evaluation of its probability density function appears tedious as an…
We define a proportionally dense subgraph (PDS) as an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the graph. We prove that the problem of…
The asymptotic probability density function of nonlinear phase noise, often called the Gordon-Mollenauer effect, is derived analytically when the number of fiber spans is very large. The nonlinear phase noise is the summation of infinitely…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…