Related papers: Growth of self-similar graphs
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
In the present paper we define statistically self-similar sets, and, using a modification of method described K.J.Falconer find a Hausdorff dimension of a statistically self-similar set.
Geometry of networks endowed with a causal structure is discussed using the conventional framework of equilibrium statistical mechanics. The popular growing network models appear as particular causal models. We focus on a class of tree…
We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…
In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…
The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…
We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…
Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…
We introduce the notion of tubular dimension, and give a formula for it. As an application we show that every invariant measure of a $C^{1+\gamma}$ diffeomorphism of a closed Riemannian manifold admits an asymptotic local product structure…
We derive Cardy-like formulas for the growth of operators in different sectors of unitary $2$ dimensional CFT in the presence of topological defect lines by putting an upper and lower bound on the number of states with scaling dimension in…
We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…
Upper bounds of the Hausdorff volume of scalar gradient field graphs are derived by means of geometric measure theory. The approach reproduces that scalar gradient fields along a mean imposed scalar gradient become space filling for…
A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability of two vertices forming an edge depends on their geometric…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
Consider a surface $\Sigma$ with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface $\Sigma_n$ by singling out one of the boundary components and denoting by $n$ the…
Fractal structures emerge from statistical and hierarchical processes in urban development or network evolution. In a class of efficient and robust geographical networks, we derive the size distribution of layered areas, and estimate the…
Inspired by theories such as Loop Quantum Gravity, a class of stochastic graph dynamics was studied in an attempt to gain a better understanding of discrete relational systems under the influence of local dynamics. Unlabeled graphs in a…
For a large class of self-similar random sets F in R^d geometric parameters C_k(F), k=0,...,d, are introduced. They arise as a.s. (average or essential) limits of the volume C_d(F(\epsilon)), the surface area C_{d-1}(F(\epsilon)) and the…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…