2013
DOI: 10.1007/s10955-013-0720-1
|View full text |Cite
|
Sign up to set email alerts
|

Bootstrapping Topological Properties and Systemic Risk of Complex Networks Using the Fitness Model

Abstract: We present a novel method to reconstruct complex network from partial information. We assume to know the links only for a subset of the nodes and to know some non-topological quantity (fitness) characterising every node. The missing links are generated on the basis of the latter quantity according to a fitness model calibrated on the subset of nodes for which links are known. We measure the quality of the reconstruction of several topological properties, such as the network density and the degree distribution … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
74
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 78 publications
(79 citation statements)
references
References 21 publications
4
74
0
Order By: Relevance
“…Consequently, similarity indices may be local (like the Adamic-Adar index, common neighbors index, hub promoted index, hub suppressed index, Jaccard index, Leicht-Holme-Newman index, preferential attachment index, resource allocation index, Salton index, or the Sørensen index) mesoscopic (like the local path index or the local random walk index), or global (like the average commute time index, cosine-based index, Katz index, Leicht-Holme-Newman index, matrix forest index, random walk with restart index, or the SimRank index). Edge neighborhood may be compared by using the network degree, preferential attachment methods, fitness values, community structure, network hierarchy, a stochastic bloc model, a probabilistic model, or by using hypergraphs (Albert & Albert, 2004; Liben-Novell & Kleinberg 2007; Yan et al, 2007a; Guimerà & Sales-Pardo, 2009; Lü et al, 2009; Zhou et al, 2009; Chen et al, 2012a; Eronen & Toivonen, 2012; Hu et al, 2012; Musmeci et al, 2012; Yan & Gregory, 2012; Liu et al, 2013). It is important to note that methods may perform differently, if the missing edge is in a dense network core or in a sparsely connected network periphery (Zhu et al, 2012a).…”
Section: An Inventory Of Network Analysis Tools Helping Drug Designmentioning
confidence: 99%
“…Consequently, similarity indices may be local (like the Adamic-Adar index, common neighbors index, hub promoted index, hub suppressed index, Jaccard index, Leicht-Holme-Newman index, preferential attachment index, resource allocation index, Salton index, or the Sørensen index) mesoscopic (like the local path index or the local random walk index), or global (like the average commute time index, cosine-based index, Katz index, Leicht-Holme-Newman index, matrix forest index, random walk with restart index, or the SimRank index). Edge neighborhood may be compared by using the network degree, preferential attachment methods, fitness values, community structure, network hierarchy, a stochastic bloc model, a probabilistic model, or by using hypergraphs (Albert & Albert, 2004; Liben-Novell & Kleinberg 2007; Yan et al, 2007a; Guimerà & Sales-Pardo, 2009; Lü et al, 2009; Zhou et al, 2009; Chen et al, 2012a; Eronen & Toivonen, 2012; Hu et al, 2012; Musmeci et al, 2012; Yan & Gregory, 2012; Liu et al, 2013). It is important to note that methods may perform differently, if the missing edge is in a dense network core or in a sparsely connected network periphery (Zhu et al, 2012a).…”
Section: An Inventory Of Network Analysis Tools Helping Drug Designmentioning
confidence: 99%
“…Furthermore, our approach is Bayesian, making it possible to learn properties of the network from observed information. Musmeci et al (2013) consider the problem of reconstructing topological properties from limited information. They use a bootstrapping approach and decide on link existence via a fitness model.…”
Section: Introductionmentioning
confidence: 99%
“…Many researchers studied aggregate networks not necessarily because it conveys information about the interconnected risk structure, but rather [91] because it would reveal meaningful information about the structure of long-term relationships among banks. Another possible reason for why aggregate networks attract attention is that daily networks can be much sparser and noisier than aggregate networks, and they appear to change their structure from day to day in a purely random manner [93,94].…”
Section: Why Daily Scale?mentioning
confidence: 99%