Related papers: Uniform multifractal structure of stable trees

We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral…

Galaxies and clusters distributions show two major properties: (i) the positions of galaxies and clusters are characterized by a power law distribution indicating properties with respect to their positions. (ii) The distribution of masses…

We investigate analogues of some of the classical results in homogeneous dynamics in non-linear setting. Let $G$ be a closed subgroup of the group of automorphisms of a biregular tree and $\Gamma<G$ a discrete subgroup. For a large class of…

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

We consider the Laplacian on a rooted metric tree graph with branching number $ K \geq 2 $ and random edge lengths given by independent and identically distributed bounded variables. Our main result is the stability of the absolutely…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

In this paper we study the stability problem of a tree of elastic strings with local Kelvin-Voigt damping on some of the edges. Under the compatibility condition of displacement and strain and continuity condition of damping coefficients at…

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…

We consider a mass-conservative fragmentation of the unit interval. The main purpose of this work is to specify the Hausdorff dimension of the set of locations having exactly an exponential decay. The study relies on an additive martingale…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Power spectral density scaling with frequency $f$ as $1/f^\beta$ and $\beta \approx 1$ is widely found in natural and socio-economic systems. Consequently, it has been suggested that such self-similar spectra reflect the universal dynamics…

We performed numerical calculations of the local density of states (LDOS) at disorder induced localization-delocalization transitions. The LDOS defines a spatial measure for fixed energy and a spectral measure for fixed position. At the…

We develop a general statistical framework for the analysis and inference of large tree-structured data, with a focus on developing asymptotic goodness-of-fit tests. We first propose a consistent statistical model for binary trees, from…

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…

We consider highly heterogeneous random networks with symmetric interactions in the limit of high connectivity. A key feature of this system is that the spectral density of the corresponding ensemble exhibits a divergence within the bulk.…

We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…