Related papers: Some relation between spectral dimension and Ahlfo…

Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…

We study the problem of embedding bipartite graphs in Ahlfors-David regular sets of large dimension using results from extremal graph theory. Our main theorem states that any graph satisfying a power-improving bound on the extremal number…

Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

It is well known that many random graphs with infinite variance degrees are ultrasmall. More precisely, for configuration models and preferential attachment models where the proportion of vertices of degree at least $k$ is approximately…

We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where…

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…

In many low-dimensional dynamical systems transport coefficients are very irregular, perhaps even fractal functions of control parameters. To analyse this phenomenon we study a dynamical system defined by a piece-wise linear map and…

In various theories of quantum gravity, one observes a change in the spectral dimension from the topological spatial dimension $d$ at large length scales to some smaller value at small, Planckian scales. While the origin of such a flow is…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…

We prove that the Ahlfors regular conformal dimension is upper semicontinuous with respect to Gromov-Hausdorff convergence when restricted to the class of uniformly perfect, uniformly quasi-selfsimilar metric spaces. Moreover we show the…

We show that the spectral gap for the interchange process (and the symmetric exclusion process) in a $d$-dimensional box of side length $L$ is asymptotic to $\pi^2/L^2$. This gives more evidence in favor of Aldous's conjecture that in any…

We calculate the spectral dimension of a wide class of tree-like fractals by solving the random walk problem through a new analytical technique, based on invariance under generalized cutting-decimation transformations. These fractals are…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…

Fractal measures of images of continuous maps from the set of p-adic numbers Qp into complex plane C are analyzed. Examples of "anomalous" fractals, i.e. the sets where the D-dimensional Hausdorff measures (HM) are trivial, i.e. either…

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…