Calculating effective resistances on underlying networks of association schemes

Abstract

Recently, in Refs. [1] and [2], calculation of effective resistances on distance-regular networks was investigated, where in the first paper, the calculation was based on stratification and Stieltjes function associated with the network, whereas in the latter one a recursive formula for effective resistances was given based on the Christoffel-Darboux identity. In this paper, evaluation of effective resistances on more general networks which are underlying networks of association schemes is considered, where by using the algebraic combinatoric structures of association schemes such as stratification and Bose-Mesner algebras, an explicit formula for effective resistances on these networks is given in terms of the parameters of corresponding association schemes. Moreover, we show that for particular underlying networks of association schemes with diameter d such that the adjacency matrix A possesses d + 1 distinct eigenvalues, all of the other adjacency matrices A i , i = 0, 1 can be written as polynomials of A, i.e., A i = P i (A), where P i is not necessarily of degree i. Then, we use this property for these particular networks and assume that all of the conductances except for one of them, say c ≡ c 1 = 1, are zero to give a procedure for evaluating effective resistances on these networks. The preference of this procedure is that one can evaluate effective resistances by using the structure of their Bose-Mesner algebra without any need to know the spectrum of the adjacency matrices.

Optimizing the convergence rate of the quantum consensus: A discrete-time model

“…In the following, we provide some preliminaries on association schemes and group association schemes [33,35,36] which have been used for obtaining the spectrum of the induced graphs corresponding to a network with complete underlying graph.…”

Fastest Distributed Consensus Problem on Fusion of Two Star Sensor Networks

“…Using Stratification method introduced in [26,29,30,31,32,33], the TFS graph can be stratified into a disjoint union of strata as shown in Fig. 1.…”

Generating a GHZ state in 2m-qubit spin network

“…Now, we recall some preliminary facts about spectral techniques used in the paper, where more details have been given in Refs. [26,27,28,29] Actually the spectral analysis of operators is an important issue in quantum mechanics, operator theory and mathematical physics [30,31]. As an example µ(dx) = |ψ(x)| 2 dx (µ(dp) = | ψ(p)| 2 dp) is a spectral distribution which is assigned to the position (momentum) operatorX(P ).…”

“…[34], we will refer to the parameters α k and ω k as QD (Quantum Decomposition) parameters (see Refs. [26,27,28,34] for more details). If such a spectral distribution is unique, the spectral distribution µ is determined by the identity…”