Link Prediction in Networks Using Effective Transitions

Benjamin Webb; Bryn Balls-Barker

REVIEW 3 major objections 4 minor 27 references

Link Prediction in Networks Using Effective Transitions

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A random-walk 'effective transition' score predicts links competitively on directed, undirected, weighted, and unweighted networks.

desk verdict The effective-transition score is a genuinely new link-prediction idea with a plausible theoretical core, but the experiments as written do not establish the claimed competitiveness. read the letter →

arxiv 1909.01076 v1 pith:NGR5OPG3 submitted 2019-08-12 cs.SI math.COmath.PRmath.SP

Bryn Balls-Barker , Benjamin Webb This is my paper · ORCID

classification cs.SImath.COmath.PRmath.SP MSC 62M2090B1515B5105C8160J10

keywords linkpredictioneffectivetransitionsisoradialreductionsisospectraltransitionmatrixweightednetworksrandomwalksdirected

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces a link-prediction method based on effective transitions: the probability that a random walk starting at node $i$ reaches node $j$ before returning to $i$. The authors' central claim is that these probabilities, arranged in an effective transition matrix $E(M)$ built from pairwise isoradial reductions, produce link scores that are competitive with standard predictors and often outperform them. Unlike most predictors, the method applies to directed or undirected and weighted or unweighted networks alike, so one score function covers all four cases. The paper also proves structural properties of $E(M)$ and of an $\ell$-step approximation that is cheaper to compute and, in the authors' experiments, frequently more accurate.

What carries the argument

The load-bearing object is the isoradial reduction $I_S(M)=M_{SS}-M_{S\bar S}(M_{\bar S\bar S}-\rho(M)I)^{-1}M_{\bar S S}$, a spectral-radius-preserving Schur complement over a node subset $S$. The effective transition matrix is assembled by computing this reduction for every pair $S=\{i,j\}$, reading the off-diagonal entries as eventual-transition scores, and summing the diagonal contributions as in Equations (9)/(10). The approximation replaces the inverse by a truncated Neumann series $\sum_{k=0}^\ell (\rho(M)^{-1}M_{\bar S\bar S})^k$ restricted to nodes within distance $\ell$ of both $i$ and $j$, which keeps the computation local and lowers the temporal complexity from $O(n^5)$ to $O(n^{2.373}+s^{2.373}n)$. This machinery turns a global random-walk quantity into pairwise scores while preserving the network's spectral structure, which is what lets the scores inherit the leading eigenvector and, for stochastic matrices, the stationary distribution.

What would settle it

Run the paper's 80/20 temporal split on a collection of strongly connected directed weighted networks and compare the effective-transition ranking of held-out edges with a random ranking: if its AUC is not above 0.5 while at least one standard predictor is, the competitiveness claim is refuted.

Watch

Extended reading notes

Core claim

The central discovery is that the off-diagonal entries of a matrix $E(M)$ assembled from pairwise isoradial reductions of the network's transition matrix can serve as link-prediction scores. For a stochastic transition matrix $P$, the entry $\varepsilon_{ij}$ is the probability that a random walk starting at $i$ reaches $j$ before returning to $i$, and the score ranks candidate edges by that probability. The paper proves that $E(M)$ is nonnegative and irreducible, shares its leading eigenvector with $M$, has spectral radius $(n-1)\rho(M)$, and, when $M$ is row stochastic, yields a primitive stochastic matrix $S(M)=E(M)/(n-1)$ with the same stationary distribution as $M$. It further proves that the $\ell$-step approximation $E_\ell(M)$, obtained by truncating the Neumann expansion inside each reduction, converges monotonically to $E(M)$ as $\ell\to\infty$. On social, technological, and information networks, the resulting scores match or beat standard predictors, including on directed and weighted networks.

Load-bearing premise

The load-bearing assumption is that the network is strongly connected—every node can reach every other node along directed paths—so the transition matrix is irreducible; if the graph is disconnected, the reductions that define the effective-transition scores can fail to exist.

Editorial extensions

If this is right

One score function covers all four network types—directed or undirected, weighted or unweighted—so a practitioner does not need a separate predictor for each case.
The $\ell$-step approximation makes the method feasible on large networks, with complexity $O(n^{2.373}+s^{2.373}n)$, and in the reported tests it often predicts more accurately than the exact effective-transition score.
Because $E(M)$ and $M$ share the same leading eigenvector, and because the scaled matrix $S(M)$ has the same stationary distribution as a stochastic $M$, rankings from effective transitions are consistent with the network's long-run random-walk behavior.
The value of $\ell$ that maximizes accuracy gives a rough measure of the neighborhood size over which links tend to form, so the approximation doubles as a diagnostic for the network's growth mechanism.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper does not pursue it, but the spectral-preservation property suggests a principled coarse-graining: reducing a network to a subset of nodes while keeping the leading eigenvector could support approximate centrality computations on very large graphs.
The reported dependence of accuracy on $\ell$ implies that the optimal $\ell$ is itself a measurable network statistic—an effective link-formation horizon—that could be compared across datasets as a signature of how new edges appear.
A testable extension is to choose $\ell$ adaptively per candidate pair rather than globally, since exact convergence only requires $\ell$ to reach twice the network diameter; local values could cut the cost further with little loss in ranking quality.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Worth a look. The paper introduces a link prediction score based on pairwise isoradial reductions of the transition matrix. The entry ε_ij is the probability of hitting j before returning to i, computed by reducing the matrix to a 2x2 block. That's a clean idea and, as far as the cited literature goes, new. The same score works for directed, undirected, weighted, and unweighted networks, which is genuinely useful. The l-step approximation with monotone convergence to the full score is a nice practical complement, and the spectral properties (nonnegative, irreducible, inherited leading eigenvector) are well chosen. If the empirical part held up, this would be a solid contribution to link prediction.

The empirical part does not hold up as written. The evaluation uses a single 80/20 temporal split, no error bars, no significance tests, and the baselines (Katz β, etc.) do not have their parameters reported. The bigger problem is that the horizon l is selected per network (l=3 for HepTh and Facebook, l=2 for Internet, Wikipedia, and the weighted network) without any description of a model-selection rule that separates training from test. Figure 6 sweeps l and appears to report accuracy on the same data used to pick the best l. That makes the 'often outperforming' claim unsubstantiated. The exact method also requires the training subgraph to be strongly connected; the paper never verifies that after the temporal split. These are fixable, but they are not cosmetic.

The mathematical core looks basically sound, though the appendix has several typos. The proof of Theorem 2(ii) writes an infinite series where the definition uses a finite one; the proof of Theorem 1 cites Equation (10) when it means the reduction formula; and the proof of Proposition 4.3 mislabels (iii)/(iv) and calls a general non-stochastic reduction row stochastic. None of these sink the results, but the appendix needs a careful rewriting.

Bottom line: this is a novel method worth a serious referee. The theory is plausible and the idea is interesting; the experiments need to be redone with proper validation, baseline reporting, and a check on connectivity. I would send it to review, not desk-reject, but I would make it clear that the empirical claims will only survive after a re-run.

Referee Report

3 major / 4 minor

Summary. The paper introduces a link prediction method based on effective transitions, where the score of a potential link (i,j) is the probability that a random walk starting at i reaches j before returning to i. This score is computed via isoradial reductions of the network's transition matrix, yielding an effective transition matrix E(M) for general nonnegative matrices M. The authors prove structural properties of E(M) (nonnegativity, irreducibility, same leading eigenvector, scaled spectral radius), propose an l-step approximation E_l(M), and prove that it converges monotonically to E(M). They present empirical comparisons on several directed and undirected, weighted and unweighted networks, claiming competitiveness with standard link predictors. The appendix contains proofs of the main theorems.

Significance. If the empirical claims are confirmed, this is a useful contribution to link prediction: it provides a single score framework that naturally handles directed, weighted, and unweighted networks, a property few existing predictors have. The theoretical core is a genuine strength: the use of isoradial reductions to define transition probabilities is elegant, and the monotone-convergence result for the approximation is nontrivial. Unlike many heuristics, the score has a clear probabilistic interpretation and comes with a spectral rationale. The main risk is empirical: the reported competitiveness rests on a small, unvalidated experimental setup, so the central claim is not yet established. With a cleaned-up evaluation, the method could merit publication.

major comments (3)

[§6.2, Figure 6] The approximation horizon l appears to be selected per network without a rule that separates model selection from evaluation: l=3 for HepTh and Facebook, l=2 for Internet, Wikipedia, and the weighted Facebook network. Figure 6 sweeps l on the smaller HepTh network and the text reports the best accuracy from this sweep; if l is chosen using test edges, the reported accuracies are not unbiased estimates of out-of-sample performance. Please re-run the experiments with l selected on the training portion only (or via nested cross-validation) and report results for all l values considered.
[§5.1, Steps 1–3; §8] The method's definition requires the graph to be (strongly) connected: Section 8 explicitly states that isoradial reductions can fail otherwise, and Proposition 4.3 relies on irreducibility. After temporally splitting each network into an 80% training and 20% test subgraph, the paper never verifies that the training subgraph is (strongly) connected. If a training subgraph is disconnected, the scores reported in Figures 3, 4, 5, and 7 are not the effective transition scores defined in Section 4. Please report connectivity checks for every training subgraph and state how any disconnected cases were handled.
[§5.2, Figures 3–5] The empirical support for the central 'competitive' claim is a single 80/20 temporal split per network with no error bars, no significance tests, and no variation across subsamples or edge-order permutations. The baseline predictors are also incompletely specified: the Katz parameter β is never reported, and tie-breaking for shortest-path scores is not described. This is insufficient to support the abstract's claim that the method 'often outperforms' standard predictors. Please add repeated splits, error bars, and a clear specification of all baseline parameters.

minor comments (4)

[§5.1, Step 2] The text says 'remove any edges from the test set that involve nodes not included in the test set'; this should say 'not included in the training set.'
[Appendix, proof of Theorem 1] The derivation of r_ij is said to use 'Equation (10)', but the displayed formula is the isoradial reduction formula from Definition 3, Equation (8).
[Appendix, proof of Theorem 2, part (ii)] The inequality in (17) displays an infinite sum over k, but P and Q are finite matrices and I^l_S(M) is defined by a finite sum to l; the proof should use finite sums to be consistent with Definition 5.
[Abstract] The phrase 'We also, prove' contains an errant comma; it should read 'We also prove.'

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the effective transition score is defined directly from the network transition matrix via isoradial reductions; the cited prior work supplies general matrix theorems, not the link-prediction conclusion.

full rationale

The derivation chain is self-contained. The predictive score is defined in Definitions 2 and 4 and Equations (9) and (10), which take the network's transition matrix M and define epsilon_ij as entries of pairwise isoradial reductions I_{i,j}(M); no external fitted quantity enters the score definition. The mathematical properties used (Theorem 1, Proposition 4.3, Theorem 2) are proved in the Appendix from the theory of isoradial and isospectral reductions. Although some supporting results are cited from the same group's earlier work (Corollary 8.1 from [8] and Theorem 3 from [26]), those results concern existence, uniqueness, and eigenvector inheritance of reductions under stated assumptions on nonnegative irreducible matrices; they do not include or presuppose the link-prediction claim. The approximation E_l(M) is an explicit truncation of the same reduction, and Theorem 2 proves monotone convergence to E(M); choosing l per network is a hyperparameter choice in the empirical comparison, not a fitted parameter renamed as a prediction. The paper's own Section 8 limitation about strong connectivity affects applicability, not circularity. Therefore the score is 0.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The mathematical core rests on imported theorems about isoradial reductions from two same-author prior papers, plus the explicit irreducibility assumption. No new physical entities are postulated. The only fitted element is the approximation horizon l, which is selected per network without a validation split.

free parameters (1)

approximation horizon l = l=3 for full HepTh and full Facebook Wall Posts; l=2 for Internet topology, Wikipedia, and weighted Facebook
The choice of l is not based on a validation set, and Figure 6 shows test accuracy varies with l, indicating that reported accuracies could reflect post hoc selection.

assumptions (4)

standard math Nonnegative irreducible matrices admit isoradial reductions over any subset, preserving spectral radius and projecting leading eigenvectors (Theorem 3, cited from [26]).
Used in the proofs of Theorem 1 and Proposition 4.3 to guarantee existence and spectral properties of E(M).
standard math Sequential isoradial reductions over nested subsets are independent of the order of reduction (Corollary 8.1, cited from [8]).
Used in the proof of Theorem 1 to justify reducing to each pair {i,j} in any order.
domain assumption The network is (strongly) connected, equivalently the transition matrix is irreducible.
Assumed throughout Sections 4 and 5; Section 8 notes isoradial reductions can fail if the network is not strongly connected.
domain assumption Edge weights of a weighted graph can be used directly as entries of the transition matrix.
Section 7 uses the weighted adjacency matrix W as the transition matrix for link prediction on weighted networks.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Link Prediction in Networks Using Effective Transitions." pith.science (2026). https://pith.science/paper/NGR5OPG3

@misc{pith2026190901076,
  author       = {Pith},
  title        = {Pith review of: Link Prediction in Networks Using Effective Transitions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NGR5OPG3}},
  note         = {Machine review of arXiv:1909.01076}
}

read the original abstract

We introduce a new method for predicting the formation of links in real-world networks, which we refer to as the method of effective transitions. This method relies on the theory of isospectral matrix reductions to compute the probability of eventually transitioning from one vertex to another in a (biased) random walk on the network. Unlike the large majority of link prediction techniques, this method can be used to predict links in networks that are directed or undirected which are either weighted or unweighted. We apply this method to a number of social, technological, and natural networks and show that it is competitive with other link predictors often outperforming them. We also provide a method of approximating our effective transition method and show that aside from having much lower temporal complexity, this approximation often provides more accurate predictions than the original effective transition method. We also, prove a number of mathematical results regarding our effective transition algorithm and its approximation.

Figures

Figures reproduced from arXiv: 1909.01076 by the authors.

**Figure 1.** The network G = (N, E) consisting of four individuals N = {1, 2, 3, 4} is shown (left), with transition matrix P = [pi j] ∈ R 4×4 given by Equation (4). Here pi j indicate that probabilities that information is passed directly from one member of the network to another. The associated effective network E(G) is shown (right) which has the effective transition matrix E(P) = [εi j] ∈ R 4×4 given by Equation (5). The pro… view at source ↗

**Figure 2.** The graphs representing the six isoradial reductions [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

**Figure 3.** Left: The undirected HepTh coauthorship network, consisting of authors of high-energy physics papers, is analyzed using [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗

Figures from the paper (4 more)

**Figure 4.** Figure 4: Left: The full HepTh coauthorship network, consisting of authors of high-energy physics papers, is analyzed using the [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]

**Figure 5.** Figure 5: Left: The undirected Internet Topology network, consisting of computers and the connections between them is analyzed [PITH_FULL_IMAGE:figures/full_fig_p014_5.png]

**Figure 6.** Figure 6: Left: The accuracy of the approximate normalized e [PITH_FULL_IMAGE:figures/full_fig_p015_6.png]

**Figure 7.** Figure 7: A weighted Facebook friendship network, consisting of edges weighted by how frequently users post on eachother’s walls, is [PITH_FULL_IMAGE:figures/full_fig_p016_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 24 canonical work pages

[1]

2017, http://konect.uni-koblenz.de/networks/ ca-cit-HepTh

arxiv hep-th network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/networks/ ca-cit-HepTh

work page 2017
[2]

2017, http://konect.uni-koblenz.de/ networks/facebook-wosn-wall

Facebook wall posts network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/facebook-wosn-wall. 19

work page 2017
[3]

2017, http://konect.uni-koblenz.de/ networks/topology

Internet topology network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/topology

work page 2017
[4]

2017, http://konect.uni-koblenz.de/ networks/link-dynamic-dewiki

Wikipedia, de (dynamic) network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/link-dynamic-dewiki

work page 2017
[5]

A lbert and A.-L

R. A lbert and A.-L. Barabsi, Topology of evolving networks: Local events and universiality, Physical Review Letters, 85 (2000), pp. 5234–5237

work page 2000
[6]

B arzel and A.-L

B. B arzel and A.-L. Barabsi, Network link prediction by global silencing of indirect correlations , Nature Biotechnology, 31 (2013), pp. 720–725

work page 2013
[7]

B ogich, S

T. B ogich, S. Funk, T. Malcolm, N. Chhun, J. Epstein, A. Chmura, A. M. Kilpatrick, J. Brownstein, C. H utchison, C. D oyle-Capitman, R. D ea ville, S. M orse, A. C unningham, and P. Daszak, Using network theory to identify the causes of disease outbreaks of unknown origin , J R Soc Interface, 10 (2012), https://doi.org/10.1098/rsif.2012.0904

work page arXiv 2012
[8]

B unimovich and B

L. B unimovich and B. Webb, Isospectral Transformations: A New Approach to Analyzing Multidimen- sional Systems and Networks, Springer Monographs in Mathematics, New York, NY , 2014

work page 2014

Show all 27 references

[9]

C hakraborty, T

A. C hakraborty, T. D utta, S. M ondal, and A. Nath, Application of graph theory in social media , International Journal of Computer Science and Engineering, 6 (2018), pp. 722–729

2018
[10]

C lauset, C

A. C lauset, C. Moore, and M. Newman, Hierarchical structure and the prediction of missing links in networks, Nature, 453 (2008), pp. 98–101

2008
[11]

E spinosa-Soto and A

C. E spinosa-Soto and A. Wagner, Specialization can drive the evolution of modularity, PLoS Compu- tational Biology, 6 (2010), https://doi.org/10.1371/journal.pcbi.1000719

2010 doi
[12]

C. F an, Z. L iu, X. L u, B. X iu, and Q. Chen, An eﬃcient link prediction index for complex military organization, Physics A: Statistical Mechanics and its Applications, 469 (2017), pp. 572–587

2017
[13]

G hasemian, H

A. G hasemian, H. Hosseinmardi, and A. Clauset, Evaluating overﬁt and underﬁt in models of network community structure, IEEE Transactions on Knowledge and Data Engineering, (2018),https://doi. org/10.1109/TKDE.2019.2911585

2018
[14]

H orn and C

R. H orn and C. J ohnson, Matrix Analysis, Cambridge University Press, Cambridge, MA, 2nd ed., 2013

2013
[15]

J ohnston, Network theory and life on the internet, JAC, 24 (2004), pp

J. J ohnston, Network theory and life on the internet, JAC, 24 (2004), pp. 881–899

2004
[16]

L eGall, Powers of tensors and fast matrix multiplication , in Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ACM, pp

F. L eGall, Powers of tensors and fast matrix multiplication , in Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ACM, pp. 296–303, https://doi.org/10. 1145/2608628.2608664
[17]

L iben-Nowell and J

D. L iben-Nowell and J. Kleinberg, The link-prediction problem for social networks , Journal of the American Society for Information Science and Technology, 58 (2004), pp. 1019–1031

2004
[18]

M asuda and P

N. M asuda and P. Holme, Predicting and controlling infectious disease epidemics using temporal net- works, F1000Prime Rep, 5 (2013), https://doi.org/10.12703/P5-6. 20

2013 doi
[19]

M eyer, Uncoupling the perron eigenvector problem, Linar Algebra and its Applications, 114–115 (1989), pp

C. M eyer, Uncoupling the perron eigenvector problem, Linar Algebra and its Applications, 114–115 (1989), pp. 69–94

1989
[20]

N ewman, Clustering and preferential attachment in growing networks , Physical Review E, 64 (2001), https://doi.org/10.1103/PhysRevE.64.025102

M. N ewman, Clustering and preferential attachment in growing networks , Physical Review E, 64 (2001), https://doi.org/10.1103/PhysRevE.64.025102

2001 doi
[21]

N ewman, Networks: An Introduction, Oxford University Press, 2010

M. N ewman, Networks: An Introduction, Oxford University Press, 2010

2010
[22]

P achev and B

B. P achev and B. Webb, Fast link prediction for large networks using spectral embedding, Journal of Complex Networks, 6, pp. 79–94, https://doi.org/10.1093/comnet/cnx021

doi
[23]

P a vlopoulos, M

G. P a vlopoulos, M. S ecrier, C. M oschopoulos, T. Soldatos, S. Kossida, J. A erts, R. S chneider, and P. Bagos, Using graph theory to analyze biological networks , BioData Mining, 4 (2011), https: //doi.org/10.1186/1756-0381-4-10

2011 doi
[24]

Q uercia, H

D. Q uercia, H. Askham, and J. Crowcroft, Tweetlda: supervised topic classiﬁcation and link predic- tion in twitter, in Proceedings of the 4th Annual ACM Web Science Conference, ACM, pp. 247–250
[25]

S hojaie, Link prediction in biological networks using multi-mode exponential random graph models, in Proceedings of the Eleventh Workshop on Mining and Learning with Graphs, ACM

A. S hojaie, Link prediction in biological networks using multi-mode exponential random graph models, in Proceedings of the Eleventh Workshop on Mining and Learning with Graphs, ACM
[26]

S mith and B

D. S mith and B. W ebb, Hidden symmetries in real and theoretical networks , Physics A: Statistical Mechanics and its Applications, 514 (2019), pp. 855–867

2019
[27]

Sriniv as andP

V . Sriniv as andP. Mitra, Link Prediction in Social Networks-Role of Power Law Distribution, Springer, Switzerland, 2016. 21

2016

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

2017, http://konect.uni-koblenz.de/networks/ ca-cit-HepTh

arxiv hep-th network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/networks/ ca-cit-HepTh

work page 2017

[2] [2]

2017, http://konect.uni-koblenz.de/ networks/facebook-wosn-wall

Facebook wall posts network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/facebook-wosn-wall. 19

work page 2017

[3] [3]

2017, http://konect.uni-koblenz.de/ networks/topology

Internet topology network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/topology

work page 2017

[4] [4]

2017, http://konect.uni-koblenz.de/ networks/link-dynamic-dewiki

Wikipedia, de (dynamic) network dataset – konect , Apr. 2017, http://konect.uni-koblenz.de/ networks/link-dynamic-dewiki

work page 2017

[5] [5]

A lbert and A.-L

R. A lbert and A.-L. Barabsi, Topology of evolving networks: Local events and universiality, Physical Review Letters, 85 (2000), pp. 5234–5237

work page 2000

[6] [6]

B arzel and A.-L

B. B arzel and A.-L. Barabsi, Network link prediction by global silencing of indirect correlations , Nature Biotechnology, 31 (2013), pp. 720–725

work page 2013

[7] [7]

B ogich, S

T. B ogich, S. Funk, T. Malcolm, N. Chhun, J. Epstein, A. Chmura, A. M. Kilpatrick, J. Brownstein, C. H utchison, C. D oyle-Capitman, R. D ea ville, S. M orse, A. C unningham, and P. Daszak, Using network theory to identify the causes of disease outbreaks of unknown origin , J R Soc Interface, 10 (2012), https://doi.org/10.1098/rsif.2012.0904

work page arXiv 2012

[8] [8]

B unimovich and B

L. B unimovich and B. Webb, Isospectral Transformations: A New Approach to Analyzing Multidimen- sional Systems and Networks, Springer Monographs in Mathematics, New York, NY , 2014

work page 2014