2014
DOI: 10.1103/physreve.90.012815
|View full text |Cite
|
Sign up to set email alerts
|

Percolation on fitness-dependent networks with heterogeneous resilience

Abstract: The ability to understand the impact of adversarial processes on networks is crucial to various disciplines. The objects of study in this article are fitness-driven networks. Fitness-dependent networks are fully described by a probability distribution of fitness and an attachment kernel. Every node in the network is endowed with a fitness value and the attachment kernel translates the fitness of two nodes into the probability that these two nodes share an edge. This concept is also known as mutual attractivene… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
14
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(14 citation statements)
references
References 33 publications
0
14
0
Order By: Relevance
“…The beauty of percolation [5] lays both in its simplicity and possible practical applications. The latter ranges from theoretical studies of geometrical model of the phase transition [6], via condensed matter physics [7], rheology [8], forest fires [9] to immunology [10] and quantum mechanics [11].…”
Section: Introductionmentioning
confidence: 99%
“…The beauty of percolation [5] lays both in its simplicity and possible practical applications. The latter ranges from theoretical studies of geometrical model of the phase transition [6], via condensed matter physics [7], rheology [8], forest fires [9] to immunology [10] and quantum mechanics [11].…”
Section: Introductionmentioning
confidence: 99%
“…If we imagine links are added one at a time at a given rate, from the kernel f (x, y) we can derive the probability that a node with fitness x increases its degree by one as [45] λ…”
Section: Model Setupmentioning
confidence: 99%
“…We define the average fraction f + = N + /N . The network constructed via the sequential deposition of links (as described above) may undergo a percolation transition [44,45,49,50] as a function of f + , such thatbeyond a critical value of f + -a giant connected component of N C nodes emerges, whose fractional average size S = N C /N remains finite as N → ∞. We stress that in any fixed instance N C ≤ N + , since some high-fitness nodes may still not engage in LN (see Fig.…”
Section: Model Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…We model the emergence of the Lightning Network as a (bond) percolation process on a graph, exploring how different conditions may impact its feasibility 46 . In particular, we consider fitness-dependent network models [47][48][49][50] where the probability of creating a new edge depends on intrinsic node features collectively denoted node fitness. In the LN case, the node fitness will be defined in terms of the node wealth and activity (i.e.…”
mentioning
confidence: 99%