Related papers: Electrical networks on $n$-simplex fractals
The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…
The fractal dimensions of polymer chains and high-temperature graphs in the Ising model both in three dimension are determined using the conformal bootstrap applied for the continuation of the $O(N)$ models from $N=1$ (Ising model) to $N=0$…
Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…
This paper describes how realistic neuromorphic networks can have their connectivity properties fully characterized in analytical fashion. By assuming that all neurons have the same shape and are regularly distributed along the…
We establish asymptotics of growing one dimensional self-similar fractal graphs, they are networks that allow multiple weighted edges between nodes, in terms of quantum central limit theorems for algebraic probability spaces in pure state.…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large $n$, a networked data…
Blockchain technology holds promise for Web 3.0, but scalability remains a critical challenge. Here, we present a mathematical theory for a novel blockchain network topology based on fractal N-dimensional simplexes. This Hyper-simplex…
The distribution of the deformations of elementary cells is studied in an abstract lattice constructed from the existence of the empty set. One combination rule determining oriented sequences with continuity of set-distance function in such…
The magnetic phase diagram at zero external field of an ensemble of dipoles with uniaxial anisotropy on a FCC lattice has been investigated from tempered Monte Carlo simulations. The uniaxial anisotropy is characterized by a random…
We study the mean number of encounters up to time t, E_N(t), taking place in a subspace with dimension d* of a d-dimensional lattice, for N independent random walkers starting simultaneously from the same origin. E_N is first evaluated…
The fractal nature of graphs has traditionally been investigated by using the nodes of networks as the basic units. Here, instead, we propose to concentrate on the graph edges, and introduce a practical and computationally not demanding…
Much of the qualitative nature of physical systems can be predicted from the way it scales with system size. Contrary to the continuum expectation, we observe a profound deviation from logarithmic scaling in the impedance of a…
To any spectral triple (A,D,H) a dimension d is associated, in analogy with the Hausdorff dimension for metric spaces. Indeed d is the unique number, if any, such that |D|^-d has non trivial logarithmic Dixmier trace. Moreover, when d is…
We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…
This paper studies the concept of power dissipation in infinite graphs and fractals associated with passive linear networks consisting of non-dissipative elements. In particular, we analyze the so-called Feynman-Sierpinski ladder, a fractal…
We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are…
Let $\Gamma$ be a connected regular graph with an eigenvalue $\lambda$ and corresponding idempotent $E_{\lambda}$. Let ${\cal E}_{\lambda}=\langle J,E_{\lambda}\rangle^\circ$ be the algebra generated by $J$ and $E_\lambda$ with respect to…
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,…
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…