Related papers: Some relation between spectral dimension and Ahlfo…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

Properties of the set $T_s$ of "particularly non-normal numbers" of the unit interval are studied in details ($T_s$ consists of real numbers $x$, some of whose s-adic digits have the asymptotic frequencies in the nonterminating $s-$ adic…

We show that when the standard techniques for calculating fractal dimensions in empirical data (such as the box counting) are applied on uniformly random structures, apparent fractal behavior is observed in a range between physically…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

The adjacency-diametrical matrix (AD matrix) of a connected graph $G$ with diameter $d$, denoted by $AD(G)$, is the matrix indexed by the vertices of $G$ in which the $(i,j)$-entry of $AD(G)$ is $1$ if $d_G(v_i,v_j)=1$, is $d$ if…

We investigate the asymptotic variance of Gaussian nodal excursions in the Euclidean space, focusing on the case where the spectral measure has incommensurable atoms. This study requires to establish fine recurrence properties in 0 for the…

For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…

We study the relation between the boundary of a simply connected domain being Ahlfors-regular and the invariance of Carleson measures under the push-forward operator induced by a conformal mapping from the unit disk onto the domain. As an…

We investigate a quasisymmetrically invariant counterpart of the topological Hausdorff dimension of a metric space. This invariant, called the topological conformal dimension, gives a lower bound on the topological Hausdorff dimension of…

Let $G_n$ be a random geometric graph with vertex set $[n]$ based on $n$ i.i.d.\ random vectors $X_1,\ldots,X_n$ drawn from an unknown density $f$ on $\R^d$. An edge $(i,j)$ is present when $\|X_i -X_j\| \le r_n$, for a given threshold…

We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

The $f$ adjacency matrix is a type of edge-weighted adjacency matrix, whose weight of an edge $ij$ is $f(d_i,d_j)$, where $f$ is a real symmetric function and $d_i,d_j$ are the degrees of vertex $i$ and vertex $j$. The $f$-spectral radius…

We study random walks on ensembles of a specific class of random multigraphs which provide an "effective graph ensemble" for the causal dynamical triangulation (CDT) model of quantum gravity. In particular, we investigate the spectral…

We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…

We numerically perform a spectral analysis of a quasi-periodically driven spin 1/2 system, the spectrum of which is Singular Continuous. We compute fractal dimensions of spectral measures and discuss their connections with the time…

In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or…

We define a distance between energy forms on a graph-like metric measure space and on a discrete weighted graph using the concept of quasi-unitary equivalence. We apply this result to metric graphs and graph-like manifolds (e.g. a small…

Metric mean dimension is a geometric invariant of dynamical systems with infinite topological entropy. We relate this concept with the fractal structure of the phase space and the H\"older regularity of the map. Afterwards we improve our…