Matches in SemOpenAlex for { <https://semopenalex.org/work/W2736133083> ?p ?o ?g. }
Showing items 1 to 52 of
52
with 100 items per page.
- W2736133083 abstract "Core percolation is crucial in network controllability and robustness. Prior works are mainly based on single, non-interacting network where core nodes are obtained by a classic Greedy Leaf Removal (GLR) procedure that takes of leaf nodes along with their neighbors iteratively. We take a first look into core percolation in coupled networks with two fully-interdependent networks. To obtain core nodes in both networks, we propose a new algorithm, called Alternating GLR procedure, that recursively switches between networks in carrying out GLR for node removal. We prove that the proposed algorithm can guarantee the uniqueness in the sense that the final remaining nodes and edges in either of the coupled networks remain the same, and then present analytical solutions for the fraction of core nodes that will be ultimately left when the algorithm terminates. Our simulation demonstrates that the presence of core exhibits a jump at the critical point as a first order transition in coupled networks." @default.
- W2736133083 created "2017-07-21" @default.
- W2736133083 creator A5024257250 @default.
- W2736133083 creator A5032981112 @default.
- W2736133083 creator A5034483183 @default.
- W2736133083 creator A5048486573 @default.
- W2736133083 date "2017-07-10" @default.
- W2736133083 modified "2023-09-25" @default.
- W2736133083 title "Core Percolation in Coupled Networks" @default.
- W2736133083 cites W1982862453 @default.
- W2736133083 cites W1990525562 @default.
- W2736133083 cites W2101420429 @default.
- W2736133083 cites W2150343509 @default.
- W2736133083 doi "https://doi.org/10.1145/3084041.3098919" @default.
- W2736133083 hasPublicationYear "2017" @default.
- W2736133083 type Work @default.
- W2736133083 sameAs 2736133083 @default.
- W2736133083 citedByCount "0" @default.
- W2736133083 crossrefType "proceedings-article" @default.
- W2736133083 hasAuthorship W2736133083A5024257250 @default.
- W2736133083 hasAuthorship W2736133083A5032981112 @default.
- W2736133083 hasAuthorship W2736133083A5034483183 @default.
- W2736133083 hasAuthorship W2736133083A5048486573 @default.
- W2736133083 hasConcept C169760540 @default.
- W2736133083 hasConcept C2164484 @default.
- W2736133083 hasConcept C2780457167 @default.
- W2736133083 hasConcept C41008148 @default.
- W2736133083 hasConcept C76155785 @default.
- W2736133083 hasConcept C86803240 @default.
- W2736133083 hasConceptScore W2736133083C169760540 @default.
- W2736133083 hasConceptScore W2736133083C2164484 @default.
- W2736133083 hasConceptScore W2736133083C2780457167 @default.
- W2736133083 hasConceptScore W2736133083C41008148 @default.
- W2736133083 hasConceptScore W2736133083C76155785 @default.
- W2736133083 hasConceptScore W2736133083C86803240 @default.
- W2736133083 hasLocation W27361330831 @default.
- W2736133083 hasOpenAccess W2736133083 @default.
- W2736133083 hasPrimaryLocation W27361330831 @default.
- W2736133083 hasRelatedWork W1654868338 @default.
- W2736133083 hasRelatedWork W1970381667 @default.
- W2736133083 hasRelatedWork W2042657449 @default.
- W2736133083 hasRelatedWork W2351109918 @default.
- W2736133083 hasRelatedWork W2385072505 @default.
- W2736133083 hasRelatedWork W2748952813 @default.
- W2736133083 hasRelatedWork W2782327182 @default.
- W2736133083 hasRelatedWork W2787277196 @default.
- W2736133083 hasRelatedWork W2899084033 @default.
- W2736133083 hasRelatedWork W93493066 @default.
- W2736133083 isParatext "false" @default.
- W2736133083 isRetracted "false" @default.
- W2736133083 magId "2736133083" @default.
- W2736133083 workType "article" @default.