Related papers: The spectral dimension of generic trees
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
We present a numerical study of topological descriptors of initially Gaussian and scale-free density perturbations evolving via gravitational instability in an expanding universe. We carefully evaluate and avoid numerical contamination in…
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges…
Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…
The spectral dimension $d_s$ of a weighted graph is an exponent associated with the asymptotic behavior of the random walk on the graph. The Ahlfors regular conformal dimension $\dim_\mathrm{ARC}$ of the graph distance is a quasisymmetric…
The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…
The spin-4/3 fractional superstring is characterized by a world-sheet chiral algebra involving spin-4/3 currents. The discussion of the tree-level scattering amplitudes of this theory presented in hepth/9310131 is expanded to include…
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
The diameter distribution of a given species of deciduous trees in mature, temperate zone forests is well approximated by a Gamma distribution. Here we give new experimental evidence for this conjecture by analyzing deciduous tree size data…
Let $G=(V_G, E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^{d}(G) = \sum_{v\in V_G}\varepsilon_{G}(v)D_{G}(v)$, where $\varepsilon_G(v)$ is the eccentricity of the vertex $v$ and $D_G(v) =…
We discuss the scaling properties of free branched polymers. The scaling behaviour of the model is classified by the Hausdorff dimensions for the internal geometry: d_L and d_H, and for the external one: D_L and D_H. The dimensions d_H and…
Using non-trivial mathematical properties of a class of nonlinear evolution equations, we obtain the universal terms in the asymptotic expansion in rapidity of the saturation scale and of the unintegrated gluon density from the…
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…
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…
A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound \Delta (a parameter of the theory) is unrestricted, the resulting dimension is precisely the…
Starting from a stationary set of supercompact cardinals we find a generic extension in which the tree property holds at every regular cardinal between $\aleph_2$ and $\aleph_{\omega^2}$.
The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine…