About: Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention
Creator	Liu, Lin Chen, Xue-Wen Jin, Ruoming Sheng, Yelong Phan, Nhathai
topic	covid:009877fd1b9048c67a1df6422986856f62068f51#this
Source	PMC
abstract	In this work, we study a basic and practically important strategy to help prevent and/or delay an outbreak in the context of network: limiting the contact between individuals. In this paper, we introduce the average neighborhood size as a new measure for the degree of being small-world and utilize it to formally define the de-small-world network problem. We also prove the NP-hardness of the general reachable pair cut problem and propose a greedy edge betweenness based approach as the benchmark in selecting the candidate edges for solving our problem. Furthermore, we transform the de-small-world network problem as an OR-AND Boolean function maximization problem, which is also an NP-hardness problem. In addition, we develop a numerical relaxation approach to solve the Boolean function maximization and the de-small-world problem. Also, we introduce the short-betweenness, which measures the edge importance in terms of all short paths with distance no greater than a certain threshold, and utilize it to speed up our numerical relaxation approach. The experimental evaluation demonstrates the effectiveness and efficiency of our approaches.
has issue date	2019-10-17(xsd:dateTime)
bibo:doi	10.1007/978-3-030-34980-6_27
has license	no-cc
sha1sum (hex)	009877fd1b9048c67a1df6422986856f62068f51
schema:url	https://doi.org/10.1007/978-3-030-34980-6_27
resource representing a document's title	Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention
has PubMed Central identifier	PMC7121964
schema:publication	Computational Data and Social Networks
resource representing a document's body	covid:009877fd1b9048c67a1df6422986856f62068f51#body_text
is http://vocab.deri.ie/void#inDataset of	proxy:http/ns.inria.fr/covid19/009877fd1b9048c67a1df6422986856f62068f51
is schema:about of	named entity 'BASED' named entity 'BASIC' named entity 'OUR' named entity 'STUDY' named entity 'PROBLEM' named entity 'BEING' named entity 'NUMERICAL' covid:arg/009877fd1b9048c67a1df6422986856f62068f51 named entity 'active set method' named entity 'vertex' named entity 'local maximum' named entity 'small-world network' named entity 'WWW' named entity 'small-world network' named entity 'betweenness' named entity 'small-world network' named entity 'numerical solvers' named entity 'optimization problem' named entity 'vertices' named entity 'local minimum' named entity 'graph' named entity 'virus' named entity 'upper bound' named entity 'Boolean function' named entity 'AMD Opteron' named entity 'graph' named entity 'optimization procedure' named entity 'vertex' named entity 'active set' named entity 'numerical optimization problem' named entity 'active set method' named entity 'betweenness' named entity 'vertex degree' named entity 'vertices' named entity 'epidemics' named entity 'numerical optimization' named entity 'time complexity' named entity 'algebraic variable' named entity 'vertices' named entity 'small-world network' named entity 'Milgram' named entity 'gradient ascent' named entity 'Internet' named entity 'Algorithm' named entity 'small-world' named entity 'small-world' named entity 'Boolean variable' named entity 'maximization problem' named entity 'and/or' named entity 'small-world' named entity 'NP-hardness' named entity 'Boolean function' named entity 'NP-hardness' named entity 'Beijing' named entity 'objective function' named entity 'betweenness' named entity 'diffusion process' named entity 'small-world network' named entity 'epidemic' named entity 'Small-World Network' named entity 'active set' named entity 'edge set' named entity 'network structure' named entity 'NP-hardness' named entity 'betweenness' named entity 'vertex' named entity 'NP-hard' named entity 'Algorithm' named entity 'graph' named entity 'small-world' named entity 'algorithm' named entity 'subgraphs' named entity 'Algorithm' named entity 'local minimum' named entity 'small-world effect' named entity 'betweenness' named entity 'graph diameter'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software