Related papers: Some relation between spectral dimension and Ahlfo…
We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
It was discovered a few years ago that many networks in the real world exhibit self-similarity. A lot of researches on the structures and processes on real and artificial fractal complex networks have been done, drawing an analogy to…
Urban form has been empirically demonstrated to be of scaling invariance and can be described with fractal geometry. However, the rational range of fractal dimension value and the relationships between various fractal indicators of cities…
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…
In this work we introduce Dynamic Random Geometric Graphs as a basic rough model for mobile wireless sensor networks, where communication distances are set to the known threshold for connectivity of static random geometric graphs. We…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
An important probe of quantum geometry is its spectral dimension, defined via a spatial diffusion process. In this work we study the spectral dimension of a ``spatial hypersurface'' in a manifoldlike causal set using the induced spatial…
It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…
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…
Generalized dimensions of multifractal measures are usually seen as static objects, related to the scaling properties of suitable partition functions, or moments of measures of cells. When these measures are invariant for the flow of a…
We formulate a Euclidean theory of edge length dynamics based on a notion of Ricci curvature on graphs with variable edge lengths. In order to write an explicit form for the discrete analog of the Einstein-Hilbert action, we require that…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
We give quadratic upper bounds for the asymptotic dimensions of the arc graphs and disk graphs.
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…
We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…
Let $G$ be a graph with adjacency matrix $A(G)$ and degree diagonal matrix $D (G)$. In 2017, Nikiforov defined the matrix $A_\alpha(G) = \alpha D(G) + (1-\alpha)A(G)$ for any real $\alpha\in[0,1]$. The largest eigenvalue of $A_\alpha(G)$ is…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.
Let X= {X_t, t \ge 0} be a continuous time random walk in an environment of i.i.d. random conductances {\mu_e \in [1, \infty), e \in E_d}, where E_d is the set of nonoriented nearest neighbor bonds on the Euclidean lattice Z^d and d\ge 3.…