Link Prediction in Real-World Multiplex Networks via Layer Reconstruction Method

Amirheckmat Taghizadeh; Amir Mahdi Abdolhosseini-Qomi; Masoud Asadpour; Masoud Rahgozar; Naser Yazdani; Seyed Hossein Jafari

arxiv: 1906.09422 · v1 · pith:JLVQJMYSnew · submitted 2019-06-22 · ⚛️ physics.soc-ph · cs.SI· physics.data-an

Link Prediction in Real-World Multiplex Networks via Layer Reconstruction Method

Amir Mahdi Abdolhosseini-Qomi , Seyed Hossein Jafari , Amirheckmat Taghizadeh , Naser Yazdani , Masoud Asadpour , Masoud Rahgozar This is my paper

Pith reviewed 2026-05-25 18:06 UTC · model grok-4.3

classification ⚛️ physics.soc-ph cs.SIphysics.data-an

keywords link predictionmultiplex networkslayer reconstructioneigenvectorsstructural featuresinformation redundancymissing links

0 comments

The pith

The Layer Reconstruction Method rebuilds a target layer's structure from similar eigenvectors in other layers to predict missing links.

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

The paper establishes that layers of real-world multiplex networks share structural features reflected in similar eigenvectors far more than randomized versions would. It introduces the Layer Reconstruction Method to find the best reconstruction of the target layer's observed structure by drawing on those features from similar layers. This approach leverages information redundancy across layers. As a result, link prediction stays effective even when a high fraction of links is missing, because missing links remain predictable unless they alter the structural features substantially.

Core claim

Eigenvectors capture network structural features, so two layers are similar when they share similar eigenvectors. Experiments on real multiplex networks confirm that layers are similar in this regard beyond their randomized counterparts. Missing links are highly predictable if their addition or removal does not significantly change those features; otherwise a similar copy of the features from other layers helps. The Layer Reconstruction Method finds the best reconstruction of the target layer using structural features of other similar layers, and experiments show the method benefits from redundancy and keeps link prediction robust under high fractions of missing links.

What carries the argument

Layer Reconstruction Method (LRM), which reconstructs the observed structure of the target layer with structural features of other similar layers.

If this is right

Link prediction performance stays robust even under high fractions of missing links.
The method benefits from information redundancy present in multiplex networks.
Layers share similar eigenvectors far beyond randomized counterparts.
Missing links are highly predictable when they do not significantly alter structural features.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same eigenvector-overlap idea could be tested on temporal networks where time slices act as layers.
Selecting only the most similar layers might improve results when a multiplex network has many layers.
The approach suggests quantifying layer similarity via eigenvector overlap as a general preprocessing step for multiplex tasks.

Load-bearing premise

Layers of real-world multiplex networks share similar eigenvectors far beyond randomized counterparts, and missing links are highly predictable if their addition or removal does not significantly change the network structural features.

What would settle it

A test on real multiplex networks showing that layers do not share similar eigenvectors more than random versions, or that link prediction performance does not remain robust with high missing links under the Layer Reconstruction Method.

read the original abstract

A large body of research on link prediction problem is devoted to finding missing links in single-layer (simplex) networks. The proposed link prediction methods compute a similarity measure between unconnected node pairs based on the observed structure of the network. However, extension of notion of similarity to multiplex networks is a two-fold challenge. The layers of real-world multiplex networks do not have the same organization yet are not of totally different organizations. So, it should be determined that how similar are the layers of a multiplex network. On the other hand, it is needed to be known that how similar layers can contribute in link prediction task on a target layer with missing links. Eigenvectors are known to well reflect the structural features of networks. Therefore, two layers of a multiplex network are similar w.r.t. structural features if they share similar eigenvectors. Experiments show that layers of real-world multiplex networks are similar w.r.t. structural features and the value of similarity is far beyond their randomized counterparts. Furthermore, it is shown that missing links are highly predictable if their addition or removal do not significantly change the network structural features. Otherwise, if the change is significant a similar copy of structural features may come to help. Based on this concept, Layer Reconstruction Method (LRM) finds the best reconstruction of the observed structure of the target layer with structural features of other similar layers. Experiments on real multiplex networks from different disciplines show that this method benefits from information redundancy in the networks and helps the performance of link prediction to stay robust even under high fraction of missing links.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

LRM gives a workable way to exploit eigenvector overlap between layers for more robust link prediction under missing data, and the real-network tests support the basic claim.

read the letter

The main point is that this paper shows real multiplex layers share structural features via eigenvectors well beyond random controls, and their Layer Reconstruction Method uses that overlap to rebuild a target layer and keep link prediction stable even with high missing-link fractions. The experiments on networks from different fields back the robustness claim without obvious circularity in the logic. What works is the direct test of the predictability condition: they check when adding or removing links changes the features and show the similar-layer copy helps in those cases. The approach is straightforward and grounded in the observed redundancy rather than assuming identical layers. Soft spots are limited. The gains look incremental rather than dramatic, and without effect-size numbers or clear baseline comparisons it is hard to judge how much better LRM is than simpler averaging of cross-layer scores. Reproducibility would benefit from more explicit steps on the optimization used to pick the best reconstruction. The citation pattern and math look standard for the area, with no load-bearing fitting issues. This is for network-science readers who already work on multiplex link prediction and want a method that treats layer similarity as a resource instead of noise. A serious editor should send it to referees; the empirical grounding is solid enough to merit review even if revisions are needed on the comparisons.

Referee Report

1 major / 3 minor

Summary. The manuscript proposes the Layer Reconstruction Method (LRM) for link prediction in multiplex networks. Layers of real-world multiplex networks are shown to share similar eigenvectors (structural features) far beyond randomized counterparts. Missing links are argued to be predictable when their addition or removal does not significantly alter structural features; otherwise, features from similar layers can assist. LRM reconstructs the observed structure of a target layer by optimizing over structural features of similar layers. Experiments on real multiplex networks from different disciplines indicate that LRM exploits information redundancy and maintains robust link-prediction performance even under high fractions of missing links.

Significance. If the results hold, the work is significant because it provides a concrete, eigenvector-based procedure for exploiting interlayer redundancy in multiplex link prediction, a setting where single-layer methods are known to be limited. The empirical tests on multiple real networks and the explicit robustness checks under missing-link fractions are strengths that support the central claim. The argument is internally consistent: similarity is quantified via eigenvector overlap, reconstruction is defined as an optimization, and the predictability condition is directly tested rather than assumed. The stress-test concern about circularity does not land on the full manuscript.

major comments (1)

[Experiments section] Experiments section: the statement that 'missing links are highly predictable if their addition or removal do not significantly change the network structural features' is load-bearing for the LRM justification, yet no quantitative threshold or statistical test for 'significant change' is supplied; this makes it impossible to verify whether the reported robustness follows from the stated condition or from post-hoc selection of layers.

minor comments (3)

[Abstract and §2] Abstract and §2: the phrase 'far beyond their randomized counterparts' is used without reporting the exact randomization model (configuration model, degree-preserving, etc.) or the number of realizations; this should be stated explicitly for reproducibility.
[Method section] Method section: the optimization objective that defines the 'best reconstruction' is described only at a high level; the precise loss function, any regularization, and how the reconstructed adjacency matrix is converted into link scores should be written as an equation.
[Figure captions and tables] Figure captions and tables: several figures compare LRM against baselines but do not report error bars or the number of independent runs; this affects assessment of whether performance gains are statistically reliable.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive assessment and constructive comment. We address the major comment below.

read point-by-point responses

Referee: [Experiments section] Experiments section: the statement that 'missing links are highly predictable if their addition or removal do not significantly change the network structural features' is load-bearing for the LRM justification, yet no quantitative threshold or statistical test for 'significant change' is supplied; this makes it impossible to verify whether the reported robustness follows from the stated condition or from post-hoc selection of layers.

Authors: We agree that the absence of a quantitative threshold or statistical test for 'significant change' in structural features (eigenvector overlap) is a limitation in the current manuscript. The statement is presented qualitatively, and while the robustness results are shown empirically across multiple networks, this does leave the justification open to the concern of post-hoc layer selection. In the revised manuscript we will add an explicit threshold (defined as overlap change below the mean plus two standard deviations of the distribution obtained from randomized layer pairs) together with a statistical comparison to the randomized baseline. This addition will make the condition directly verifiable from the data and clarify its relation to the reported performance. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines LRM as an optimization that reconstructs a target layer using eigenvector-based structural features from other layers, after first empirically measuring layer similarity via eigenvector overlap on real multiplex networks and comparing against randomized controls. All load-bearing steps are external empirical observations or direct definitions of the reconstruction procedure; no equation reduces to its own input by construction, no fitted parameter is relabeled as a prediction, and no self-citation chain supplies the central premise. Experiments test the stated predictability condition rather than assuming it, leaving the derivation self-contained against the reported data.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only; no free parameters, invented entities, or explicit axioms are described beyond the domain assumption that eigenvectors capture structural features.

axioms (1)

domain assumption Eigenvectors are known to well reflect the structural features of networks.
Stated directly in the abstract as background knowledge used to define layer similarity.

pith-pipeline@v0.9.0 · 5847 in / 1296 out tokens · 27824 ms · 2026-05-25T18:06:34.914250+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages · 2 internal anchors

[1]

Newman, M. E. J. Structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)

work page 2003
[2]

Scale-Free Networks: Complex Webs in Nature and Technology

Caldarelli, G. Scale-Free Networks: Complex Webs in Nature and Technology. Scale-Free Networks: Complex Webs in Nature and Technology (2010). doi:10.1093/acprof:oso/9780199211517.001.0001

work page doi:10.1093/acprof:oso/9780199211517.001.0001 2010
[3]

& Mendes, J

Dorogovtsev, S., Goltsev, A. & Mendes, J. Critical phenomena in complex networks. Rev. Mod. Phys. 80, 1275–1335 (2008)

work page 2008
[4]

R., Chen, B

Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H. & Chklovskii, D. B. Structural properties of the Caenorhabditis elegans neuronal network. PLoS Comput. Biol. 7, (2011)

work page 2011
[5]

& Faust, K

Wasserman, S. & Faust, K. Social network analysis : methods and applications. American Ethnologist 24, (1994)

work page 1994
[6]

Mossa, S. et al. The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles. Proc. Natl. Acad. Sci. U. S. A. 102, 7794–7799 (2005)

work page 2005
[7]

Kivelä, M. et al. Multilayer Networks. J. Complex Networks 2, 203–271 (2014)

work page 2014
[8]

Boccaletti, S. et al. The structure and dynamics of multilayer networks. Phys. Rep. 544, 1–122 (2014)

work page 2014
[9]

M., Min, B

Lee, K. M., Min, B. & Goh, K. Il. Towards real-world complexity: an introduction to multiplex networks. Eur. Phys. J. B 88, (2015)

work page 2015
[10]

& Latora, V

Nicosia, V. & Latora, V. Measuring and modeling correlations in multiplex networks. Phys. Rev. E - Stat. Nonlinear, Soft Matter Phys. 92, (2015)

work page 2015
[11]

Cardillo, A. et al. Emergence of network features from multiplexity. Sci. Rep. 3, 1–6 (2013)

work page 2013
[12]

M., Kim, J

Lee, K. M., Kim, J. Y., Cho, W. K., Goh, K. I. & Kim, I. M. Correlated multiplexity and connectivity of multiplex random networks. New J. Phys. 14, (2012)

work page 2012
[13]

Barabási, A. L. Scale-free networks: A decade and beyond. Science 325, 412–413 (2009)

work page 2009
[14]

& Cook, J

McPherson, M., Smith-Lovin, L. & Cook, J. M. Birds of a Feather: Homophily in Social Networks. Annu. Rev. Sociol. 27, 415–444 (2002)

work page 2002
[15]

& Kaufman, J

Lewis, K., Gonzalez, M. & Kaufman, J. Social selection and peer influence in an online social network. Proc. Natl. Acad. Sci. 109, 68–72 (2011)

work page 2011
[16]

& Kertész, J

Szabó, G., Alava, M. & Kertész, J. in 139–162 (2012). doi:10.1007/978-3-540-44485-5_7

work page doi:10.1007/978-3-540-44485-5_7 2012
[17]

Barabási, A. L. & Albert, R. Emergence of scaling in random networks. Science (80-. ). 286, 509–512 (1999)

work page 1999
[18]

& Barabási, A

Jeong, H., Néda, Z. & Barabási, A. L. Measuring preferential attachment in evolving networks. Europhys. Lett. 61, 567–572 (2003)

work page 2003
[19]

A., Strogatz, S

Marvel, S. A., Strogatz, S. H. & Kleinberg, J. M. Energy landscape of social balance. Phys. Rev. Lett. 103, (2009)

work page 2009
[20]

E., Zhou, T., Zhang, Y.-C

Lü, L., Stanley, H. E., Zhou, T., Zhang, Y.-C. & Pan, L. Toward link predictability of complex networks. Proc. Natl. Acad. Sci. 112, 2325–2330 (2015)

work page 2015
[21]

Zhou, T., Lu, L. & Lü, L. Link Prediction in Complex Networks: A Survey. arXiv physics.so, 1150–1170 (2010)

work page 2010
[22]

Q., Zhang, Q

Wang, W. Q., Zhang, Q. M. & Zhou, T. Evaluating network models: A likelihood analysis. EPL 98, (2012)

work page 2012
[23]

& Kleinberg, J

Liben-Nowell, D. & Kleinberg, J. The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58, 1019–1031 (2007)

work page 2007
[24]

& Zhang, Y

Zhou, T., Lü, L. & Zhang, Y. C. Predicting missing links via local information. Eur. Phys. J. B 71, 623–630 (2009)

work page 2009
[25]

& Chawla, N

Davis, D., Lichtenwalter, R. & Chawla, N. V. Multi-relational Link Prediction in Heterogeneous Information Networks. 2011 Int. Conf. Adv. Soc. Networks Anal. Min. 281–288 (2011). doi:10.1109/ASONAM.2011.107

work page doi:10.1109/asonam.2011.107 2011
[26]

Brouwer, A. E. & Haemers, W. H. Spectra of graphs -Monograph-. Springer (2011). doi:10.1007/978-1- 4614-1939-6

work page doi:10.1007/978-1- 2011
[27]

& Mascolo, C

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 Sci. 5, (2016)

work page 2016
[28]

K., Boguñá, M., Ángeles Serrano, M

Kleineberg, K. K., Boguñá, M., Ángeles Serrano, M. & Papadopoulos, F. Hidden geometric correlations in real multiplex networks. Nat. Phys. 12, 1076–1081 (2016)

work page 2016
[29]

& Kleineberg, K

Papadopoulos, F. & Kleineberg, K. K. Link persistence and conditional distances in multiplex networks. Phys. Rev. E 99, (2019)

work page 2019
[30]

& Gabrilovich, E

Nickel, M., Murphy, K., Tresp, V. & Gabrilovich, E. A Review of Relational Machine Learning for Kno wledge Graphs From Multi-Relational Link Prediction to Automated Knowledge Graph Construction. Proc. IEEE 1– 18 (2015)

work page 2015
[31]

Menon, A. K. & Elkan, C. Link Prediction via Matrix Factorization. 437–452 (2011)

work page 2011
[32]

& Rényi, A

Erdos, P. & Rényi, A. On the strength of connectedness of a random graph. Acta Math. Acad. Sci. Hungaricae 12, 261–267 (1961)

work page 1961
[33]

Combinatorial Analysis of Multiple Networks

Magnani, M., Micenkova, B. & Rossi, L. Combinatorial Analysis of Multiple Networks. (2013). at <http://arxiv.org/abs/1303.4986>

work page internal anchor Pith review Pith/arXiv arXiv 2013
[34]

Feizi, S. et al. Spectral Alignment of Graphs. (2016). at <http://arxiv.org/abs/1602.04181>

work page internal anchor Pith review Pith/arXiv arXiv 2016
[35]

& Menzel, H

Coleman, J., Katz, E. & Menzel, H. The Diffusion of an Innovation Among Physicians. Sociometry 20, 253 (2006)

work page 2006
[36]

Simas, T., Chavez, M., Rodriguez, P. R. & Diaz-Guilera, A. An algebraic topological method for multimodal brain networks comparisons. Front. Psychol. 6, (2015)

work page 2015
[37]

L., Hall, D

Chen, B. L., Hall, D. H. & Chklovskii, D. B. Wiring optimization can relate neuronal structure and function. Proc. Natl. Acad. Sci. U. S. A. 103, 4723–8 (2006)

work page 2006
[38]

BioGRID: a general repository for interaction datasets

Stark, C. BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 34, D535–D539 (2005)

work page 2005
[39]

& Bianconi, G

Halu, A., Mukherjee, S. & Bianconi, G. Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles. Phys. Rev. E - Stat. Nonlinear, Soft Matter Phys. 89, (2014)

work page 2014
[40]

& Arenas, A

De Domenico, M., Sole-Ribalta, A., Gomez, S. & Arenas, A. Navigability of interconnected networks under random failures. Proc. Natl. Acad. Sci. 111, 8351–8356 (2014)

work page 2014
[41]

Hanley, J. A. & McNeil, B. J. A method of Comparing the Areas under Characteristic Curves Derived the Same Cases. Radiology 148, 839–843 (1983)

work page 1983
[42]

L., Konstan, J

Herlocker, J. L., Konstan, J. A., Terveen, L. G. & Riedl, J. T. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22, 5–53 (2004)

work page 2004

[1] [1]

Newman, M. E. J. Structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)

work page 2003

[2] [2]

Scale-Free Networks: Complex Webs in Nature and Technology

Caldarelli, G. Scale-Free Networks: Complex Webs in Nature and Technology. Scale-Free Networks: Complex Webs in Nature and Technology (2010). doi:10.1093/acprof:oso/9780199211517.001.0001

work page doi:10.1093/acprof:oso/9780199211517.001.0001 2010

[3] [3]

& Mendes, J

Dorogovtsev, S., Goltsev, A. & Mendes, J. Critical phenomena in complex networks. Rev. Mod. Phys. 80, 1275–1335 (2008)

work page 2008

[4] [4]

R., Chen, B

Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H. & Chklovskii, D. B. Structural properties of the Caenorhabditis elegans neuronal network. PLoS Comput. Biol. 7, (2011)

work page 2011

[5] [5]

& Faust, K

Wasserman, S. & Faust, K. Social network analysis : methods and applications. American Ethnologist 24, (1994)

work page 1994

[6] [6]

Mossa, S. et al. The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles. Proc. Natl. Acad. Sci. U. S. A. 102, 7794–7799 (2005)

work page 2005

[7] [7]

Kivelä, M. et al. Multilayer Networks. J. Complex Networks 2, 203–271 (2014)

work page 2014

[8] [8]

Boccaletti, S. et al. The structure and dynamics of multilayer networks. Phys. Rep. 544, 1–122 (2014)

work page 2014

[9] [9]

M., Min, B

Lee, K. M., Min, B. & Goh, K. Il. Towards real-world complexity: an introduction to multiplex networks. Eur. Phys. J. B 88, (2015)

work page 2015

[10] [10]

& Latora, V

Nicosia, V. & Latora, V. Measuring and modeling correlations in multiplex networks. Phys. Rev. E - Stat. Nonlinear, Soft Matter Phys. 92, (2015)

work page 2015

[11] [11]

Cardillo, A. et al. Emergence of network features from multiplexity. Sci. Rep. 3, 1–6 (2013)

work page 2013

[12] [12]

M., Kim, J

Lee, K. M., Kim, J. Y., Cho, W. K., Goh, K. I. & Kim, I. M. Correlated multiplexity and connectivity of multiplex random networks. New J. Phys. 14, (2012)

work page 2012

[13] [13]

Barabási, A. L. Scale-free networks: A decade and beyond. Science 325, 412–413 (2009)

work page 2009

[14] [14]

& Cook, J

McPherson, M., Smith-Lovin, L. & Cook, J. M. Birds of a Feather: Homophily in Social Networks. Annu. Rev. Sociol. 27, 415–444 (2002)

work page 2002

[15] [15]

& Kaufman, J

Lewis, K., Gonzalez, M. & Kaufman, J. Social selection and peer influence in an online social network. Proc. Natl. Acad. Sci. 109, 68–72 (2011)

work page 2011

[16] [16]

& Kertész, J

Szabó, G., Alava, M. & Kertész, J. in 139–162 (2012). doi:10.1007/978-3-540-44485-5_7

work page doi:10.1007/978-3-540-44485-5_7 2012

[17] [17]

Barabási, A. L. & Albert, R. Emergence of scaling in random networks. Science (80-. ). 286, 509–512 (1999)

work page 1999

[18] [18]

& Barabási, A

Jeong, H., Néda, Z. & Barabási, A. L. Measuring preferential attachment in evolving networks. Europhys. Lett. 61, 567–572 (2003)

work page 2003

[19] [19]

A., Strogatz, S

Marvel, S. A., Strogatz, S. H. & Kleinberg, J. M. Energy landscape of social balance. Phys. Rev. Lett. 103, (2009)

work page 2009

[20] [20]

E., Zhou, T., Zhang, Y.-C

Lü, L., Stanley, H. E., Zhou, T., Zhang, Y.-C. & Pan, L. Toward link predictability of complex networks. Proc. Natl. Acad. Sci. 112, 2325–2330 (2015)

work page 2015

[21] [21]

Zhou, T., Lu, L. & Lü, L. Link Prediction in Complex Networks: A Survey. arXiv physics.so, 1150–1170 (2010)

work page 2010

[22] [22]

Q., Zhang, Q

Wang, W. Q., Zhang, Q. M. & Zhou, T. Evaluating network models: A likelihood analysis. EPL 98, (2012)

work page 2012

[23] [23]

& Kleinberg, J

Liben-Nowell, D. & Kleinberg, J. The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58, 1019–1031 (2007)

work page 2007

[24] [24]

& Zhang, Y

Zhou, T., Lü, L. & Zhang, Y. C. Predicting missing links via local information. Eur. Phys. J. B 71, 623–630 (2009)

work page 2009

[25] [25]

& Chawla, N

Davis, D., Lichtenwalter, R. & Chawla, N. V. Multi-relational Link Prediction in Heterogeneous Information Networks. 2011 Int. Conf. Adv. Soc. Networks Anal. Min. 281–288 (2011). doi:10.1109/ASONAM.2011.107

work page doi:10.1109/asonam.2011.107 2011

[26] [26]

Brouwer, A. E. & Haemers, W. H. Spectra of graphs -Monograph-. Springer (2011). doi:10.1007/978-1- 4614-1939-6

work page doi:10.1007/978-1- 2011

[27] [27]

& Mascolo, C

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 Sci. 5, (2016)

work page 2016

[28] [28]

K., Boguñá, M., Ángeles Serrano, M

Kleineberg, K. K., Boguñá, M., Ángeles Serrano, M. & Papadopoulos, F. Hidden geometric correlations in real multiplex networks. Nat. Phys. 12, 1076–1081 (2016)

work page 2016

[29] [29]

& Kleineberg, K

Papadopoulos, F. & Kleineberg, K. K. Link persistence and conditional distances in multiplex networks. Phys. Rev. E 99, (2019)

work page 2019

[30] [30]

& Gabrilovich, E

Nickel, M., Murphy, K., Tresp, V. & Gabrilovich, E. A Review of Relational Machine Learning for Kno wledge Graphs From Multi-Relational Link Prediction to Automated Knowledge Graph Construction. Proc. IEEE 1– 18 (2015)

work page 2015

[31] [31]

Menon, A. K. & Elkan, C. Link Prediction via Matrix Factorization. 437–452 (2011)

work page 2011

[32] [32]

& Rényi, A

Erdos, P. & Rényi, A. On the strength of connectedness of a random graph. Acta Math. Acad. Sci. Hungaricae 12, 261–267 (1961)

work page 1961

[33] [33]

Combinatorial Analysis of Multiple Networks

Magnani, M., Micenkova, B. & Rossi, L. Combinatorial Analysis of Multiple Networks. (2013). at <http://arxiv.org/abs/1303.4986>

work page internal anchor Pith review Pith/arXiv arXiv 2013

[34] [34]

Feizi, S. et al. Spectral Alignment of Graphs. (2016). at <http://arxiv.org/abs/1602.04181>

work page internal anchor Pith review Pith/arXiv arXiv 2016

[35] [35]

& Menzel, H

Coleman, J., Katz, E. & Menzel, H. The Diffusion of an Innovation Among Physicians. Sociometry 20, 253 (2006)

work page 2006

[36] [36]

Simas, T., Chavez, M., Rodriguez, P. R. & Diaz-Guilera, A. An algebraic topological method for multimodal brain networks comparisons. Front. Psychol. 6, (2015)

work page 2015

[37] [37]

L., Hall, D

Chen, B. L., Hall, D. H. & Chklovskii, D. B. Wiring optimization can relate neuronal structure and function. Proc. Natl. Acad. Sci. U. S. A. 103, 4723–8 (2006)

work page 2006

[38] [38]

BioGRID: a general repository for interaction datasets

Stark, C. BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 34, D535–D539 (2005)

work page 2005

[39] [39]

& Bianconi, G

Halu, A., Mukherjee, S. & Bianconi, G. Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles. Phys. Rev. E - Stat. Nonlinear, Soft Matter Phys. 89, (2014)

work page 2014

[40] [40]

& Arenas, A

De Domenico, M., Sole-Ribalta, A., Gomez, S. & Arenas, A. Navigability of interconnected networks under random failures. Proc. Natl. Acad. Sci. 111, 8351–8356 (2014)

work page 2014

[41] [41]

Hanley, J. A. & McNeil, B. J. A method of Comparing the Areas under Characteristic Curves Derived the Same Cases. Radiology 148, 839–843 (1983)

work page 1983

[42] [42]

L., Konstan, J

Herlocker, J. L., Konstan, J. A., Terveen, L. G. & Riedl, J. T. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22, 5–53 (2004)

work page 2004