Pith. sign in

REVIEW 3 major objections 4 minor 56 references

SimBins: An information-theoretic approach to link prediction in real multiplex networks

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 SimBins claims that an information-theoretic score built from similarity bins and a second layer's connection odds improves link prediction in a target layer of real multiplex networks.

desk verdict A plausible empirical multiplex link predictor, but the information-theoretic derivation as printed is internally inconsistent and the reported AUCs are not tied to a well-defined scoring rule. read the letter →

arxiv 1908.10053 v4 pith:7QG5AQRN submitted 2019-08-27 physics.soc-ph cs.SIphysics.data-an

Seyed Hossein Jafari , Amir Mahdi Abdolhosseini-Qomi , Maseud Rahgozar , Masoud Asadpour , Naser Yazdani This is my paper · ORCID
classification physics.soc-phcs.SIphysics.data-an
keywords multiplexnetworkslinkpredictioninformationtheorysimilaritybinstrans-layercorrelationAUCevaluationunsupervisednetworkmethods
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

SimBins is an unsupervised, information-theoretic method for link prediction in multiplex networks. Its central claim is that in most real multiplex networks the probability two nodes are connected in one layer is positively correlated with their similarity in another layer, and that this trans-layer signal can be exploited automatically. The paper constructs bins of node pairs by similarity in the target and auxiliary layers, estimates connection probabilities within those bins, and fuses them into a single surprisal-based score. Across eight real multiplex datasets, this score improves held-out link ranking over target-layer-only similarity and over simply adding the two similarity scores in the majority of duplexes. A sympathetic reader would care because the method offers a cheap, model-free way to sharpen link prediction in any layer of a multilayer network using structure that is already present.

What carries the argument

The central object is the SimBins score of Equation 24. Node pairs are first partitioned into equal-depth bins by their similarity scores in the target layer and, separately, in the auxiliary layer. The method then estimates two empirical probabilities per bin: the intra-layer connection probability (fraction of target-layer links within a target bin) and the trans-layer connection probability (fraction of target-layer links within an auxiliary bin), the latter computed separately for pairs that are connected or unconnected in the auxiliary layer. These estimates are fused by the weighted OR operator of Equation 23, with the auxiliary decision weighted by $1/b_A$, and the surprisal (negative log) of the fused probability produces the final score. The machinery turns coarse-grained bin frequencies into a ranking without any training or fitted parameters.

What would settle it

Rerun the RA experiments on the paper's datasets but replace the similarity-as-probability step (Equation 20) with an empirical link frequency estimated from the same training bins; if the modified score systematically raises held-out AUC, then the paper's identification of normalized similarity with connection probability is the limiting assumption and can be abandoned.

Watch

Extended reading notes

Core claim

The paper's discovery is that a rank-preserving information score can be assembled from bin-level conditional probabilities: for each node pair, the target layer contributes its intra-layer connection probability (the fraction of linked pairs in the pair's target-similarity bin), and the auxiliary layer contributes its trans-layer connection probability (the fraction of target-layer links in the pair's auxiliary-similarity bin), split into two cases depending on whether the pair is already connected in the auxiliary layer. These two probabilities are merged by a weighted OR, with the auxiliary term downweighted by the reciprocal of the number of auxiliary bins, and the negative logarithm of the result becomes the link score. This score, defined as SimBins in Equation 24, is what the paper shows to be superior to single-layer scoring and naive similarity addition in the majority of the 46 test duplexes.

Load-bearing premise

The load-bearing premise is that a min-max rescaled similarity score in the target layer equals the probability that the pair is linked; if similarity scores are not calibrated to real probabilities, the ranking can be distorted even when the bin frequencies are accurate.

Editorial extensions

If this is right

  • SimBins raises average held-out AUC over both target-only scoring and naive similarity addition for each of the three base measures tested (RA, CN, ACT), with the largest average gains for RA.
  • The method wins the highest AUC exclusively in 27 of 46 duplexes and shares the best score in 12 more, while degrading below target-layer scoring only rarely.
  • SimBins tolerates deceptive auxiliary layers: where the auxiliary layer carries negative or no correlation, it roughly matches target-only performance, whereas simple addition of similarities drops.
  • The overhead beyond the base similarity measure is minor, with a full ranking costing $O(n^2)$ plus $O(m \log m)$ for binning, so the method remains feasible for large multiplex networks.

Reading between the lines

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

  • An extension not explored in the paper is making the bin-to-probability mapping fully supervised, learning it from training data instead of assuming it equals normalized similarity; this would preserve the information-theoretic fusion while removing the weakest assumption.
  • A natural extension is to weight auxiliary layers by their measured trans-layer correlation before summing duplex SimBins scores, rather than treating every auxiliary layer as equally informative.
  • Because the method only needs sorted similarity values, it should transfer to weighted or directed multiplex layers by substituting any pairwise score for the undirected similarity indices tested here.
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.

Referee Report

3 major / 4 minor

Summary. The paper proposes SimBins, a link prediction method for multiplex networks. For a target layer T and auxiliary layer A, node pairs are partitioned into equal-depth similarity bins in each layer; within each bin the empirical frequency of links in the target layer defines an intra-layer connection probability, and the frequency of links in the target layer among pairs in an auxiliary-layer bin defines a trans-layer connection probability. The method then assigns each node pair a score derived from an information-theoretic expression: the conditional self-information of a link in the target layer given the pair's target and auxiliary bins. A weighted OR combination of the intra-layer and trans-layer probabilities is used to estimate the conditional probability, and the final score is claimed to be the negative of the conditional self-information, with an additional term involving the min-max normalized target-layer similarity. The method is evaluated on eight real-world multiplex datasets using three base similarity measures (RA, CN, ACT), with held-out AUC averaged over 100 training phases. The paper reports that SimBins improves over target-layer similarity alone and over simple addition of target and auxiliary similarities in the majority of the tested duplexes.

Significance. The empirical protocol is sound in its essentials: evaluation is on held-out test edges, the train/test split is repeated 100 times, and the results span social, biological, and technological multiplex networks. The paper also gives a useful and honest account of cases where the method fails, such as London Transport and the Drosophila duplex. If the scoring rule were well defined and the derivation internally consistent, SimBins would be a simple, general-purpose way to extend any base similarity measure to multiplex link prediction with modest computational overhead, and the empirical evidence of positive trans-layer correlation would be a useful contribution. As written, however, the central scoring formula is not well defined and the derivation is inconsistent, so the reported AUC improvements are not tied to a reproducible ranking function. The contribution is therefore conditional on a substantial correction of the method's definition.

major comments (3)
  1. [The Multiplex Link Prediction Model, Eq. (20) and Eq. (24)] Equation (20) identifies the unconditional self-information I(L^T=1) with -log S~_xy^T, where S~_xy^T is a min-max normalized similarity score. If this substitution is propagated consistently through equation (22) and into equation (19), the I(L^T=1) terms cancel, and the resulting score is log p_est(L^T=1 | S_i^T, S_j^A). The printed equation (24), however, contains an additional log(S~_xy^T) term. These two expressions are different ranking functions, and the manuscript does not state which one was used to produce Table 2. This is not a cosmetic issue: the two scoring rules can order node pairs differently, so the reported AUC values are not attached to a single, well-defined formula.
  2. [Equation (24), zero-similarity pairs] Equation (24) is undefined for pairs with S~_xy^T = 0, because log(S~_xy^T) is then -infinity. For local indices such as RA and CN, any pair with no common neighbors in the target layer receives a min-max normalized similarity of zero, and such pairs are abundant among the non-edge pairs that the AUC evaluation must rank. The paper gives no rule for these pairs, such as omitting the logarithmic term, applying a floor, or assigning a fixed value. Since the reported AUC averages in Table 2 depend on ranking these very pairs, the central empirical claim is not reproducible from the formula as written.
  3. [Equation (23), fusion of intra-layer and trans-layer probabilities] Equation (23) is introduced as an estimate of the conditional probability p(L^T=1 | S_i^T, S_j^A) using a weighted OR of the intra-layer and trans-layer connection probabilities, with weight 1/b_A. This is an ad hoc construction rather than a consequence of the information-theoretic expansion in equations (18)-(22). The weight depends only on the number of auxiliary bins, not on the data, the degree of inter-layer correlation, or any independence assumption, and it is effectively a free parameter. Because the purported derivation of the scoring rule relies on this conditional probability, the information-theoretic framing in the title and in Section 'The Multiplex Link Prediction Model' overstates what is actually established; the method as presented is a heuristic score whose behavior is not derived from the stated principles.
minor comments (4)
  1. [Abstract] The abstract contains a duplicated word: 'confirm that that in a wide range'; this should be corrected.
  2. [Discussion, London Transport paragraph] The text says 'the AA scores of Overground and DLR layers in London Transport are almost all zeros,' but AA (Adamic-Adar) is not one of the three base measures used in the reported experiments (RA, CN, ACT). This appears to be a typo, likely for ACT, and should be corrected.
  3. [Related Works, layer relevance discussion] Reference [35] is cited to support claims about layer relevance and link prediction, but the cited work is the Girvan-Newman community detection paper, which does not address layer relevance in multiplex networks. The citation should be checked and replaced or removed.
  4. [Discussion, unshown experiments] The statement that similar experiments were performed with Adamic-Adar and Preferential Attachment is not accompanied by any results or supplementary material; either include the results or remove the claim.

Circularity Check

2 steps flagged · score 4.0 of 10

Equation 20 defines the link probability as the normalized similarity, and Equation 24 retains that term in the final score; the 'information-theoretic' part of SimBins reduces to the base similarity input, although held-out AUC keeps the empirical claim partly independent.

  1. self definitional [Materials and Methods, 'The Multiplex Link Prediction Model', Equation (20)]
    "I(L^T_xy = 1) = − log p(L^T_xy = 1) ≈ − log S~_xy^T ... i.e. the probability of connection in target layer (without any knowledge on bins partitioning) is estimated with similarity in that same layer, intuitively."

    The derivation sets the unconditional link probability, and hence the self-information of link existence, equal to the min-max normalized base similarity S~_xy^T. This is not an information-theoretic result; it is a definitional identification of a probability with the similarity input. The same log(S~_xy^T) term is then retained in the final scoring rule (Eq. 24), so part of the 'predicted' score is simply the input similarity relabeled as self-information. No independent calibration or theorem converts S~ into p(L=1); the equation itself imposes the identity and the final score carries it forward.

  2. self definitional [Equations (19), (22), and (24)]
    "The term I(L^T = 1) in equation (22) is the self-information of that a randomly chosen node pair is linked in target layer T. Clearly, I(L^T = 1) is the same for every node pair in the multiplex network; therefore, it does not affect the scoring (node pairs ranking), and it can be safely neglected."

    If Equation 20 is substituted into Equations 19 and 22, the log(S~_xy^T) terms cancel and the score reduces to log p_est(L^T=1 | bins). If, instead, one follows the text's instruction to neglect I(L^T=1), the score becomes log(S~_xy^T) + log p_est(...), which is what the printed Equation 24 contains. The paper does not state which version produced Table 2. The retained log(S~_xy^T) is exactly the base similarity input, so the implemented scoring rule is not forced by the information-theoretic derivation; it re-introduces the input feature by construction while claiming to have derived it away.

full rationale

SimBins is evaluated against held-out test edges under a 90/10 train/test split with AUC as the metric, so the central empirical claim of improved link prediction is not tautological: the bin probabilities p_intra and p_trans are fitted on the training split and tested on unseen links. That independent evaluation prevents a score above 4 and is why this is not a fully circular paper. However, the information-theoretic derivation contains a genuine self-definitional step: Equation 20 identifies p(L^T=1) with the min-max normalized similarity S~_xy^T, and Equation 24 keeps log(S~_xy^T) in the final score. The derivation is also internally inconsistent, since Equation 22 says I(L^T=1) can be neglected while Equation 24 retains it; consequently, the score reported in Table 2 is a hand-chosen combination of the base similarity and fitted bin frequencies rather than a quantity forced by the information-theoretic argument. No load-bearing self-citation appears; references [24] and [25] are external prior work. The log(0) issue for zero-similarity pairs is a further correctness problem but is not itself a circularity, so it is not counted in the score.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The method rests almost entirely on assumptions imported at the modeling stage: similarity scores are treated as probabilities, binning is assumed to produce stable states, and a hand-picked OR fusion combines evidence. No independent benchmark, formal proof, or released code verifies these choices. The only empirical anchor is held-out AUC on public datasets, which supports the method's usefulness regardless of the derivation's validity.

free parameters (2)
  • number of bins b_T and b_A = 10 (set equal in both layers)
    Authors set b=10 for all experiments and state that smaller values degrade results; they recommend 10-50 without a full sensitivity analysis. The score depends on this choice.
  • auxiliary fusion weight 1/b_A = 0.1 with b_A=10
    Equation 23 uses 1/b_A as the coefficient in the weighted OR operator, determining how strongly auxiliary-layer evidence modifies the target-layer estimate. It is chosen by hand and not derived from information theory.
assumptions (5)
  • ad hoc to paper p(L_xy^T=1) can be approximated by the min-max normalized similarity score S~_xy^T (Equation 20).
    No derivation given; similarity scores are not calibrated probabilities and are often zero.
  • domain assumption Equal-depth binning of similarities yields states from which empirical connection probabilities are meaningful estimators.
    Binning is a coarse-graining choice; empty bins are filled by imputation, which is a modeling assumption.
  • ad hoc to paper Weighted OR with coefficient 1/b_A is an appropriate fusion of intra- and trans-layer evidence (Equation 23).
    Chosen based on informal reasoning about decision fusion; no optimization or derivation.
  • domain assumption Positive inter-layer correlation between auxiliary-layer similarity and target-layer connection probability exists in most real multiplex networks.
    Motivated by visual evidence and previous work; explicitly fails for Drosophila, so the claim is domain-dependent.
  • domain assumption Empirical frequencies on the 90% training set generalize to the 10% test edge set.
    Standard stationarity assumption; not tested.

how reviews work

0 comments
Cite this review

Pith. "Pith review of SimBins: An information-theoretic approach to link prediction in real multiplex networks." pith.science (2026). https://pith.science/paper/7QG5AQRN

@misc{pith2026190810053,
  author       = {Pith},
  title        = {Pith review of: SimBins: An information-theoretic approach to link prediction in real multiplex networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7QG5AQRN}},
  note         = {Machine review of arXiv:1908.10053}
}
read the original abstract

The entities of real-world networks are connected via different types of connections (i.e. layers). The task of link prediction in multiplex networks is about finding missing connections based on both intra-layer and inter-layer correlations. Our observations confirm that that in a wide range of real-world multiplex networks, from social to biological and technological, a positive correlation exists between connection probability in one layer and similarity in other layers. Accordingly, a similarity-based automatic general-purpose multiplex link prediction method -- SimBins -- is devised that quantifies the amount of connection uncertainty based on observed inter-layer correlations in a multiplex network. Moreover, SimBins enhances the prediction quality in the target layer by incorporating the effect of link overlap across layers. Applied to various datasets from different domains, SimBins proves to be robust and superior than compared methods in majority of experimented cases in terms of accuracy of link prediction. Furthermore, it is discussed that SimBins imposes minor computational overhead to the base similarity measures making it a potentially fast method, suitable for large-scale multiplex networks.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

56 extracted references · 32 canonical work pages

  1. [1]

    The link prediction problem for social networks

    Liben-Nowell D, Kleinberg J. The link prediction problem for social networks. Proceedings of the twelfth international conference on Information and knowledge management; New Orleans, LA, USA. 956972: ACM; 2003. p. 556-9

    work page 2003

  2. [2]

    Hierarchical structure and the prediction of missing links in networks

    Clauset A, Moore C, Newman ME. Hierarchical structure and the prediction of missing links in networks. Nature. 2008;453(7191):98-101. Epub 2008/05/03. doi: 10.1038/nature06830. PubMed PMID: 18451861

    doi:10.1038/nature06830 2008

  3. [3]

    Missing and spurious interactions and the reconstruction o f complex networks

    Guimera R, Sales -Pardo M. Missing and spurious interactions and the reconstruction o f complex networks. Proc Natl Acad Sci U S A. 2009;106(52):22073-8. Epub 2009/12/19. doi: 10.1073/pnas.0908366106. PubMed PMID: 20018705; PubMed Central PMCID: PMCPMC2799723

    doi:10.1073/pnas.0908366106 2009

  4. [4]

    Recommendation as link prediction in bipartite graphs: A graph k ernel-based machine learning approach

    Li X, Chen H. Recommendation as link prediction in bipartite graphs: A graph k ernel-based machine learning approach. Decision Support Systems. 2013;54(2):880-90. doi: 10.1016/j.dss.2012.09.019

    doi:10.1016/j.dss.2012.09.019 2013

  5. [5]

    Densifying a behavioral recommender system by social networks link prediction methods

    Esslimani I, Brun A, Boyer A. Densifying a behavioral recommender system by social networks link prediction methods. Social N etwork Analysis and Mining. 2011;1(3):159-72. doi: 10.1007/s13278-010-0004-6

    work page doi:10.1007/s13278-010-0004-6 2011

  6. [6]

    Improving Routing Performance in AODV with Link Prediction in Mobile Adhoc Networks

    Yadav A, Singh YN, Singh RR. Improving Routing Performance in AODV with Link Prediction in Mobile Adhoc Networks. Wireless Pe rsonal Communications. 2015;83(1):603-18. doi: 10.1007/s11277-015-2411-5

    work page doi:10.1007/s11277-015-2411-5 2015

  7. [7]

    An Information -Theoretic Definition of Similarity

    Lin D. An Information -Theoretic Definition of Similarity. Proceedings of the Fifteenth International Conference on Machine Learning. 657297: Morgan Kaufmann Publishers Inc.; 1998. p. 296-304

    work page 1998

  8. [8]

    Link prediction approach to collaborative filtering

    Chen H, Li X, Huang Z, editors. Link prediction approach to collaborative filtering. Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05); 2005 7-11 June 2005

    work page 2005

Show all 56 references
  1. [9]

    Friends and neighbors on the Web

    Adamic LA, Adar E. Friends and neighbors on the Web. Social Networks. 2003;25(3):211-30. doi: 10.1016/S0378-8733(03)00009-1

    2003 doi

  2. [10]

    Predicting missing links via local information

    Zhou T, Lü L, Zhang Y -C. Predicting missing links via local information. The European Physical Journal B. 2009;71(4):623 -30. doi: 10.1140/epjb/e2009-00335-8

    2009 doi

  3. [11]

    A new status index derived from sociometric analysis

    Katz L. A new status index derived from sociometric analysis. Psychometrika. 1953;18:39-43. doi: 10.1007/BF02289026

    1953 doi

  4. [12]

    The Anatomy of a Large-Scale Hypertextual Web Search Engine

    Brin S, Page L. The Anatomy of a Large-Scale Hypertextual Web Search Engine. Seventh International World-Wide Web Conference (WWW 1998); Brisbane, Australia1998

    1998

  5. [13]

    Similarity index based on local paths for link prediction of complex networks

    Lü L, Jin C-H, Zhou T. Similarity index based on local paths for link prediction of complex networks. Physical Review E. 2009;80(4):046122. doi: 10.1103/PhysRevE.80.046122

    2009 doi

  6. [14]

    Link prediction based on local random walk

    Liu W, Lü L. Link prediction based on local random walk. EPL (Europhysics Letters). 2010;89(5):58007. doi: 10.1209/0295-5075/89/58007

    2010 doi

  7. [15]

    Link Prediction via Matrix Factorization2011; Berlin, Heidelberg: Springer Berlin Heidelberg

    Menon AK, Elkan C, editors. Link Prediction via Matrix Factorization2011; Berlin, Heidelberg: Springer Berlin Heidelberg

  8. [16]

    Link prediction in complex networks: A survey

    Lü L, Zhou T. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applicat ions. 2011;390(6):1150-70. doi: 10.1016/j.physa.2010.11.027

    2011 doi

  9. [17]

    Link Prediction in Complex Networks: A Mutual Information Perspective

    Tan F, Xia Y, Zhu B. Link Prediction in Complex Networks: A Mutual Information Perspective. PLOS ONE. 2014;9(9):e107056. doi: 10.1371/journal.pone.0107056

    2014 doi

  10. [18]

    Link predic tion based on path entropy

    Xu Z, Pu C, Yang J. Link predic tion based on path entropy. Physica A: Statistical Mechanics and its Applications. 2016;456:294 -301. doi: 10.1016/j.physa.2016.03.091

    2016 doi

  11. [19]

    New perspectives and methods in link prediction

    Lichtenwalter RN, Lussier JT, Chawla NV. New perspectives and methods in link prediction. Proceedings of the 16th AC M SIGKDD international conference on Knowledge discovery and data mining; Washington, DC, USA. 1835837: ACM; 2010. p. 243-52

    2010

  12. [20]

    node2vec: Scalable Feature Learning for Networks

    Grover A, Leskovec J. node2vec: Scalable Feature Learning for Networks. KDD : proceedings International Conference on Knowled ge Discovery & Data Mining. 2016;2016:855-64. doi: 10.1145/2939672.2939754. PubMed PMID: 27853626

    2016

  13. [21]

    Link prediction in social networks: the state-of-the-art

    Wang P, Xu B, Wu Y, Zhou X. Link prediction in social networks: the state-of-the-art. Science China Information Sciences. 2015;58(1):1-38. doi: 10.1007/s11432-014-5237-y

    2015 doi

  14. [22]

    Multilayer networks

    Kivelä M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA. Multilayer networks. Journal of Complex Networks. 2014;2(3):203-

    2014

  15. [23]

    Multilayer Networks in a Nutshell

    Aleta A, Moreno Y. Multilayer Networks in a Nutshell. Annual Review of Condensed Matter Physics. 2019;10(1):45 -62. doi: 10.1146/annurev-conmatphys-031218-013259

    2019 doi

  16. [24]

    Hidden geometric correlations in real multiplex networks

    Kleineberg K-K, Boguñá M, Ángeles Serrano M, Papadopoulos F. Hidden geometric correlations in real multiplex networks. Nature Physics. 2016;12:1076. doi: 10.1038/nphys3812 https://www.nature.com/articles/nphys3812#supplementary-information

    2016 doi

  17. [25]

    Link persistence and conditional distances in multiplex networks

    Papadopoulos F, Kleineberg K-K. Link persistence and conditional distances in multiplex networks. Physical Review E. 2019;99(1):012322. doi: 10.1103/PhysRevE.99.012322

    2019 doi

  18. [26]

    Pathsim: Meta path -based top-k similarity search in heterogeneous information networks

    Sun Y, Han J, Yan X, Yu PS, Wu T. Pathsim: Meta path -based top-k similarity search in heterogeneous information networks. Proceedings of the VLDB Endowment. 2011;4(11):992-1003

    2011

  19. [27]

    Hetesim: A general framework for relevance measure in heterogeneous networks

    Shi C, Kong X, Huang Y, Philip SY, Wu B. Hetesim: A general framework for relevance measure in heterogeneous networks. IEEE Transactions on Knowledge and Data Engineering. 2014;26(10):2479-92. doi: 10.1109/TKDE.2013.2297920

    2014

  20. [28]

    Mutual information model for link prediction in heterogeneous complex networks

    Shakibian H, Moghadam Charkari N. Mutual information model for link prediction in heterogeneous complex networks. Scientific Reports. 2017;7:44981. doi: 10.1038/srep44981

    2017 doi

  21. [29]

    A multilayer approach to multiplexity and link prediction in online geo -social networks

    Hristova D, Noulas A, Brown C, Musolesi M, Mascolo C. A multilayer approach to multiplexity and link prediction in online geo -social networks. EPJ Data Science. 2016;5(1):24. doi: 10.1140/epjds/s13688-016-0087-z

    2016 doi

  22. [30]

    Link prediction in multiplex online so cial networks

    Jalili M, Orouskhani Y, Asgari M, Alipourfard N, Perc M. Link prediction in multiplex online so cial networks. R Soc Open Sci. 2017;4(2):160863-. doi: 10.1098/rsos.160863. PubMed PMID: 28386441

    2017 doi

  23. [31]

    Link prediction in multiplex networks based on interlayer similarity

    Najari S, Salehi M, Ranjbar V, Jalili M. Link prediction in multiplex networks based on interlayer similarity. Physica A: Statistical Mechanics and its Applications. 2019:120978. doi: 10.1016/j.physa.2019.04.214

    2019 doi

  24. [32]

    Link prediction in multiplex networks

    Pujari M, Kanawati R. Link prediction in multiplex networks. Networks and Heterogeneous Media. 2015;10:17 -35. doi: 10.3934/nhm.2015.10.17

    2015 doi

  25. [33]

    A holis tic approach for predicting links in coevolving multiplex networks

    Hajibagheri A, Sukthankar G, Lakkaraju K. A holis tic approach for predicting links in coevolving multiplex networks. Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining; Davis, California. 3192628: IEEE P ress; 2016. p....

    2016

  26. [34]

    Application of hyperbolic geometry in link prediction of multiplex networks

    Samei Z, Jalili M. Application of hyperbolic geometry in link prediction of multiplex networks. Scientific Reports. 2019;9(1):12604. doi: 10.1038/s41598-019-49001-7

    2019 doi

  27. [35]

    Community structure in social and biological networks

    Girvan M, Newman MEJ. Community structure in social and biological networks. Proceedings of the Natio nal Academy of Sciences. 2002;99(12):7821-6. doi: 10.1073/pnas.122653799

    2002 doi

  28. [36]

    Multi-relational Link Prediction in Heterogeneous Information Networks

    Davis D, Lichtenwalter R, Chawla NV, editors. Multi-relational Link Prediction in Heterogeneous Information Networks. 2011 International Conference on Advances in Social Networks Analysis and Mining; 2011 25-27 July 2011

    2011

  29. [37]

    Complex networks: small-world, scale-free and beyond

    Xiao Fan W, Guanrong C. Complex networks: small-world, scale-free and beyond. IEEE Circuits and Systems Magazine. 2003;3(1):6-20. doi: 10.1109/MCAS.2003.1228503

    2003

  30. [38]

    The meaning and use of the area under a receiver operating characteristic (ROC) curve

    Hanley JA, McNeil BJ. The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology. 1982;143(1):29-

    1982

  31. [39]

    Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles

    Halu A, Mukherjee S, Bianconi G. Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles. Physical Review E. 2014;89(1):012806. doi: 10.1103/PhysRevE.89.012806

    2014 doi

  32. [40]

    doi: 10.1148/radiology.143.1.7063747

    Epub 1982/04/01. doi: 10.1148/radiology.143.1.7063747. PubMed PMID: 7063747

    1982 doi

  33. [41]

    BioGRID: a general repository for interaction datasets

    Stark C, Breitkreutz BJ, Reguly T, Boucher L, Breitkreutz A, Tyers M. BioGRID: a general repository for interaction datasets . Nucleic acids research. 2006;34(Database issue):D535 -9. Epub 2005/12/31. doi: 10.1093/nar/gkj109. PubMed PMID: 16381927; PubMed Central PMCID: PMCPMC1347471

    2006 doi

  34. [42]

    Wiring optimization can relate neuronal structure and function

    Chen BL, Hall DH, Chklovskii DB. Wiring optimization can relate neuronal structure and function. Proceedings of the National Academy of Sciences of the United States of America. 2006;103(12):4723-8. doi: 10.1073/pnas.0506806103

    2006 doi

  35. [43]

    An algebraic topological method for multimodal brain networks comparisons

    Simas T, Chavez M, Rodriguez PR, Diaz-Guilera A. An algebraic topological method for multimodal brain networks comparisons. Frontiers in psychology. 2015;6:904. Epub 2015/07/29. doi: 10.3389/fpsyg.2015.00904. PubMed PMID: 26217258; PubMed Central PMCID: PMCPMC4491601

    2015

  36. [44]

    Structural reducibility of multilayer networks

    De Domenico M, Nicosia V, Arenas A, Latora V. Structural reducibility of multilayer networks. Nature Communications. 2015;6:6864. doi: 10.1038/ncomms7864 https://www.nature.com/articles/ncomms7864#supplementary-information

    2015 doi

  37. [45]

    Structural measures for multiplex networks

    Battiston F, Nicosia V, Latora V. Structural measures for multiplex networks. Physical Review E. 2014;89(3):032804. doi: 10.1103/PhysRevE.89.032804

    2014 doi

  38. [46]

    The Diffusion of an Innovation Among Physicians

    Coleman J, Katz E, Menzel H. The Diffusion of an Innovation Among Physicians. Sociometry. 1957;20(4):253-70. doi: 10.2307/2785979

    1957 doi

  39. [47]

    Combinatorial Analysis of Multiple Networks

    Magnani M, Micenkova B, Rossi L. Combinatorial Analysis of Multiple Networks. arXiv preprint arXiv:13034986. 2013

    2013

  40. [48]

    Navigability of interconnected networks under random failures

    De Domenico M, Solé-Ribalta A, Gómez S, Arenas A. Navigability of interconnected networks under random failures. Proceedings of the National Academy of Sciences. 2014;111(23):8351-6. doi: 10.1073/pnas.1318469111

    2014 doi

  41. [49]

    Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing): Wiley -Interscience; 2006

    Cover TM, Thomas JA. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing): Wiley -Interscience; 2006

    2006

  42. [50]

    A Mathematical Theory of Communication

    Shannon CE. A Mathematical Theory of Communication. Bell System Technical Journal. 1948;27(3):379 -423. doi: 10.1002/j.1538 - 7305.1948.tb01338.x

    1948

  43. [51]

    Toward link predictability of complex networks

    Lü L, Pan L, Zhou T, Zhang Y-C, Stanley HE. Toward link predictability of complex networks. Proceedings of the National Academy of Sciences of the United States of America. 2015;112(8):2325-30. Epub 2015/02/06. doi: 10.1073/pnas.1424644112. PubMed PMID: 25659742

    2015 doi

  44. [52]

    Random -Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation

    Fouss F, Pirotte A, Renders J, Saerens M. Random -Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Transactions on Knowledge and Data Engineering. 2007;19(3):355-69. doi: 10.1109/TKDE.2007.46

    2007 doi

  45. [53]

    Matrix computations (3rd ed.): Johns Hopkins University Press; 1996

    Golub GH, Loan CFV. Matrix computations (3rd ed.): Johns Hopkins University Press; 1996. 694 p

    1996

  46. [54]

    Robust smoothing of gridded data in one and higher dimensions with missing values

    Garcia D. Robust smoothing of gridded data in one and higher dimensions with missing values. Computational Statistics & Data Analysis. 2010;54(4):1167-78. doi: 10.1016/j.csda.2009.09.020

    2010 doi

  47. [56]

    Factorizing YAGO: scalable machine lear ning for linked data

    Nickel M, Tresp V, Kriegel H -P. Factorizing YAGO: scalable machine lear ning for linked data. Proceedings of the 21st international conference on World Wide Web; Lyon, France. 2187874: ACM; 2012. p. 271-80

    2012

  48. [71]

    doi: 10.1093/comnet/cnu016

    doi

Pith tools

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