Related papers: Electrical networks on $n$-simplex fractals
This paper contains the proofs of Theorems 2 and 3 of the article entitled Random Electrical Networks on Complete Graphs, written by the same authors and published in the Journal of the London Mathematical Society, vol. 30 (1984), pp.…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. Fix $0 < \alpha < 1$. Let…
The method of spectral decimation is applied to an infinite collection of self--similar fractals. The sets considered belong to the class of nested fractals, and are thus very symmetric. An explicit construction is given to obtain formulas…
In a previous article, we have proposed that the large scale structure network generated by large scale magnetic fields could consist of a network of octahedra only contacting at their vertexes. Assuming such a network could arise at…
The self-similar structure of the attracting subshift of a primitive substitution is carried over to the limit set of the repelling tree in the boundary of Outer Space of the corresponding irreducible outer automorphism of a free group.…
Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…
In the anisotropic random geometric graph model, vertices correspond to points drawn from a high-dimensional Gaussian distribution and two vertices are connected if their distance is smaller than a specified threshold. We study when it is…
In many low-dimensional dynamical systems transport coefficients are very irregular, perhaps even fractal functions of control parameters. To analyse this phenomenon we study a dynamical system defined by a piece-wise linear map and…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
Our goal is to study statistical properies of "dielectric resonances" which are poles of conductance of a large random $LC$ network. Such poles are a particular example of eigenvalues $\lambda_n$ of matrix pencils ${\bf H}-\lambda {\bf W}$,…
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…
The identification of distribution network topology and parameters is a critical problem that lays the foundation for improving network efficiency, enhancing reliability, and increasing its capacity to host distributed energy resources.…
Random graph models are playing an increasingly important role in various fields ranging from social networks, telecommunication systems, to physiologic and biological networks. Within this landscape, the random Kronecker graph model,…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
Many real-world complex networks contain a significant amount of structural redundancy, in which multiple vertices play identical topological roles. Such redundancy arises naturally from the simple growth processes which form and shape many…
In the case of some fractals, sampling with average values on cells is more natural than sampling on points. In this paper we investigate this method of sampling on $SG$ and $SG_{3}$. In the former, we show that the cell graph…
Off-diagonal disorder with random hopping between the sublattices of a bipartite lattice is described by a Hamiltonian which has chiral (sub-lattice) symmetry. The energy spectrum is symmetric around E=0 and for odd total number of lattice…
Majumdar and Tamm [Phys. Rev. E 86 021135 (2012), arXiv:1206.6184] recently obtained analytical expressions for the mean number of common sites W_N(t) visited up to time t by N independent random walkers starting from the origin of a…
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…