Related papers: Dimensions of the popcorn graph
Given an orientation-preserving diffeomorphism of the interval [0;1], consider the uniform norm of the differential of its n-th iteration. We get a function of n called the growth sequence. Its asymptotic behaviour is an interesting…
Due to their broad application to different fields of theory and practice, generalized Petersen graphs $GPG(n,s)$ have been extensively investigated. Despite the regularity of generalized Petersen graphs, determining an exact formula for…
We study the diameter of $C_1$, the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ in the emerging supercritical phase, i.e., for $p = \frac{1+\epsilon}n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. This parameter…
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…
It is well known that one can map certain properties of random matrices, fermionic gases, and zeros of the Riemann zeta function to a unique point process on the real line. Here we analytically provide exact generalizations of such a point…
We show that the diameter D(G_n) of a random labelled connected planar graph with n vertices is equal to n^{1/4+o(1)}, in probability. More precisely there exists a constant c>0 such that the probability that D(G_n) lies in the interval…
Let G_n be a sequence of finite transitive graphs with vertex degree d=d(n) and |G_n|=n. Denote by p^t(v,v) the return probability after t steps of the non-backtracking random walk on G_n. We show that if p^t(v,v) has quasi-random…
Consider a second-order elliptic operator $L$ in the half-plane $\mathbb R \times (0, \infty)$ with coefficients depending only on the second coordinate. The Poisson kernel for $L$ is used in the representation of positive $L$-harmonic…
Consider a uniformly random regular graph of a fixed degree $d\ge3$, with $n$ vertices. Suppose that each edge is open (closed), with probability $p(q=1-p)$, respectively. In 2004 Alon, Benjamini and Stacey proved that $p^*=(d-1)^{-1}$ is…
Elkies and McMullen [Duke Math.J.~123 (2004) 95--139] have shown that the gaps between the fractional parts of \sqrt n for n=1,\ldots,N, have a limit distribution as N tends to infinity. The limit distribution is non-standard and differs…
The boxicity of a graph $G$ is the minimum dimension $d$ that admits a representation of $G$ as the intersection graph of a family of axis-parallel boxes in $\mathbb{R}^d$. Computing boxicity is an NP-hard problem, and there are few known…
Three-dimensional discrete numerical simulation is used to investigate the properties of close-packed frictionless granular assemblies as a function of particle polydispersity and shape. Unlike some experimental results, simulations show…
In this paper, we discuss the Higuchi algorithm which serves as a widely used estimator for the box-counting dimension of the graph of a bounded function $f : [0,1] \to \R$. We formulate the method in a mathematically precise way and show…
Conformal blocks are the building blocks for correlation functions in conformal field theories. The four-point function is the most well-studied case. We consider conformal blocks for $n$-point correlation functions. For conformal field…
The set B of geodesic rays avoiding a suitable obstacle in a complete negatively curved Riemannian manifold determines a spectrum S. While various properties of this spectrum are known, we define and study dimension functions on S in terms…
An inhomogeneous fractal set is one which exhibits different scaling behaviour at different points. The Assouad dimension of a set is a quantity which finds the `most difficult location and scale' at which to cover the set and its…
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a…
We study a wide class of fractal interpolation functions in a single platform by considering the domains of these functions as general attractors. We obtain lower and upper bounds of the box dimension of these functions in a more general…
We develop further Cannon's method of cone types for finding the growth function of a group, which can also be used to find the coordination sequences of certain infinite graphs. We then apply this method to compute the growth functions and…
We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value,…