Related papers: Some relation between spectral dimension and Ahlfo…
For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, for graphs $G$ with diameter 2, we show that…
A good generalization of the Euclidean dimension to disordered systems and non crystalline structures is commonly required to be related to large scale geometry and it is expected to be independent of local geometrical modifications. The…
We study spatial clustering in a discrete, one-dimensional, stochastic, toy model of heavy particles in turbulence and calculate the spectrum of multifractal dimensions $D_q$ as functions of a dimensionless parameter, $\alpha$, that plays…
The generalized distance spectral radius of a connected graph $G$ is the spectral radius of the generalized distance matrix of $G$, defined by $$D_\alpha(G)=\alpha Tr(G)+(1-\alpha)D(G), \;\;0\le\alpha \le 1,$$ where $D(G)$ and $Tr(G)$…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
For a hyperbolic rational map $f$ with connected Julia set, we give upper and lower bounds on the Ahlfors-regular conformal dimension of its Julia set $J_f$ from a family of energies of associated graph maps. Concretely, the dynamics of $f$…
The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph $G$. If many maximal matchings have a size close to $\maxM(G)$, this graph invariant has a value close to 1.…
A graph $G$ with $d+1$ distinct eigenvalues is called strongly distance-regular if $G$ itself is distance-regular, and its distance-$d$ graph $G_d$ is strongly-regular. In this note we provide a spectral characterization of those…
We calculate the fractal dimension $d_{\rm f}$ of critical curves in the $O(n)$ symmetric $(\vec \phi^2)^2$-theory in $d=4-\varepsilon$ dimensions at 6-loop order. This gives the fractal dimension of loop-erased random walks at $n=-2$,…
Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…
We obtain an essential spectral gap for $n$-dimensional convex co-compact hyperbolic manifolds with the dimension $\delta$ of the limit set close to $(n-1)/2$. The size of the gap is expressed using the additive energy of stereographic…
Many natural and social systems develop complex networks, that are usually modelled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semi-circle law is known to…
This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…
Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…
The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…