Related papers: Some relation between spectral dimension and Ahlfo…
We develop the idea of an effective conformal theory describing the low-lying spectrum of the dilatation operator in a CFT. Such an effective theory is useful when the spectrum contains a hierarchy in the dimension of operators, and a small…
We study deformations of the geodesic distances on a domain of R N induced by a function called conformal factor. We show that under a positive reach assumption on the domain (not necessarily a submanifold) and mild assumptions on the…
The emergence of fractal features in the microscopic structure of space-time is a common theme in many approaches to quantum gravity. In this work we carry out a detailed renormalization group study of the spectral dimension $d_s$ and walk…
We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
As it is well known, the spectrum $ {\rm sp\,} \Gamma$ (of the adjacency matrix $A$) of a graph $\Gamma$, with $d$ distinct eigenvalues other than its spectral radius $\lambda_0$, usually provides a lot of information about the structure of…
A matching in a graph $G$ is a set of independent edges in $G$. A perfect matching in a graph $G$ is a matching which saturates all the vertices of $G$. A fractional perfect matching in a graph $G$ is a function $h:E(G)\rightarrow [0,1]$…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$…
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically…
We compute the intrinsic Hausdorff dimension of spacetime at the infrared fixed point of the quantum conformal factor in 4D gravity. The fractal dimension is defined by the appropriate covariant diffusion equation in four dimensions and is…
Fractal/non-fractal morphological transitions allow for the systematic study of the physics behind fractal morphogenesis in nature. In these systems, the fractal dimension is considered a non-thermal order parameter, commonly and…
We are interested in the general question: to what extent are the spectral properties of a graph connected to the distance function? Our motivation is a concrete example of this question that is due to Steinerberger. We provide some…
We consider rectangular graph superlattices of sides l1, l2 with the wavefunction coupling at the junctions either of the delta type, when they are continuous and the sum of their derivatives is proportional to the common value at the…
Spectral analysis connects graph structure to the eigenvalues and eigenvectors of associated matrices. Much of spectral graph theory descends directly from spectral geometry, the study of differentiable manifolds through the spectra of…
A nonnegative number d_infinity, called asymptotic dimension, is associated with any metric space. Such number detects the asymptotic properties of the space (being zero on bounded metric spaces), fulfills the properties of a dimension, and…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this…
The aim of this article is to establish asymptotic distributions and consistency of subsampling for spectral density and for magnitude of coherence for non-stationary, almost periodically correlated time series. We show the asymptotic…