Matches in SemOpenAlex for { <https://semopenalex.org/work/W2964279298> ?p ?o ?g. }
Showing items 1 to 85 of
85
with 100 items per page.
- W2964279298 abstract "We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment.In a model of communication based on a random walk on an undirected graph, the optimal set over all sets of the same or smaller cardinality minimizes the sum of the mean first arrival times to the set by walkers starting at nodes outside the set. The problem originates from the study of the spread of information or consensus in a network and was introduced in this form by V.Borkar et al. in 2010. More generally, the work of A. Clark et al. in 2012 showed that estimating the fastest rate of convergence to consensus of so-called leader follower systems leads to a consideration of the same optimization problem. The set function F to be minimized is supermodular and therefore the greedy algorithm is commonly used to construct optimal sets or their approximations. In this paper, the problem is reformulated so that the search for solutions is restricted to optimal and near optimal subsets of the graph. We prove sufficient conditions for the existence of a greedoid structure that contains feasible optimal and near optimal sets. It is therefore possible we conjecture, to search for optimal or near optimal sets by local moves in a stepwise manner to obtain near optimal sets that are better approximations than the factor (1 − 1/e) degree of optimality guaranteed by the use of the greedy algorithm. A simple example illustrates aspects of the method. Random Walk Consensus Model Given a connected graph G = (V, E), with vertices or nodes V and edges E, we imagine a random walker situated at a node i ∈ V , moving to another node j ∈ V in a single discrete time step. The choice of j is random and has probability, pij > 0, if (i, j) ∈ E P rob{i → j} = (1) pij = 0 otherwise. The matrix P = (pij )i,j=1···N is the transition matrix of a Markov chain which in this paper, is assumed to be irreducible and aperiodic ([7]). N is the number of nodes and as in [1] the spread of information is described in terms of a process that is dual to the movement from informed to uninformed nodes. A random walk begins outside a pre-determined set A of informed target nodes" @default.
- W2964279298 created "2019-07-30" @default.
- W2964279298 creator A5085256229 @default.
- W2964279298 date "2014-12-01" @default.
- W2964279298 modified "2023-10-03" @default.
- W2964279298 title "The Structure of Optimal and Near Optimal Target Sets in Consensus Models" @default.
- W2964279298 cites W1507039213 @default.
- W2964279298 cites W1680189815 @default.
- W2964279298 cites W2058653097 @default.
- W2964279298 cites W2061820396 @default.
- W2964279298 doi "https://doi.org/10.6028/nist.sp.500-303" @default.
- W2964279298 hasPublicationYear "2014" @default.
- W2964279298 type Work @default.
- W2964279298 sameAs 2964279298 @default.
- W2964279298 citedByCount "0" @default.
- W2964279298 crossrefType "report" @default.
- W2964279298 hasAuthorship W2964279298A5085256229 @default.
- W2964279298 hasBestOaLocation W29642792982 @default.
- W2964279298 hasConcept C111472728 @default.
- W2964279298 hasConcept C114614502 @default.
- W2964279298 hasConcept C124101348 @default.
- W2964279298 hasConcept C126255220 @default.
- W2964279298 hasConcept C132525143 @default.
- W2964279298 hasConcept C138885662 @default.
- W2964279298 hasConcept C148764684 @default.
- W2964279298 hasConcept C162324750 @default.
- W2964279298 hasConcept C177264268 @default.
- W2964279298 hasConcept C199360897 @default.
- W2964279298 hasConcept C2777303404 @default.
- W2964279298 hasConcept C2780586882 @default.
- W2964279298 hasConcept C2780990831 @default.
- W2964279298 hasConcept C3018234147 @default.
- W2964279298 hasConcept C33923547 @default.
- W2964279298 hasConcept C41008148 @default.
- W2964279298 hasConcept C50522688 @default.
- W2964279298 hasConcept C51823790 @default.
- W2964279298 hasConcept C87117476 @default.
- W2964279298 hasConceptScore W2964279298C111472728 @default.
- W2964279298 hasConceptScore W2964279298C114614502 @default.
- W2964279298 hasConceptScore W2964279298C124101348 @default.
- W2964279298 hasConceptScore W2964279298C126255220 @default.
- W2964279298 hasConceptScore W2964279298C132525143 @default.
- W2964279298 hasConceptScore W2964279298C138885662 @default.
- W2964279298 hasConceptScore W2964279298C148764684 @default.
- W2964279298 hasConceptScore W2964279298C162324750 @default.
- W2964279298 hasConceptScore W2964279298C177264268 @default.
- W2964279298 hasConceptScore W2964279298C199360897 @default.
- W2964279298 hasConceptScore W2964279298C2777303404 @default.
- W2964279298 hasConceptScore W2964279298C2780586882 @default.
- W2964279298 hasConceptScore W2964279298C2780990831 @default.
- W2964279298 hasConceptScore W2964279298C3018234147 @default.
- W2964279298 hasConceptScore W2964279298C33923547 @default.
- W2964279298 hasConceptScore W2964279298C41008148 @default.
- W2964279298 hasConceptScore W2964279298C50522688 @default.
- W2964279298 hasConceptScore W2964279298C51823790 @default.
- W2964279298 hasConceptScore W2964279298C87117476 @default.
- W2964279298 hasLocation W29642792981 @default.
- W2964279298 hasLocation W29642792982 @default.
- W2964279298 hasLocation W29642792983 @default.
- W2964279298 hasOpenAccess W2964279298 @default.
- W2964279298 hasPrimaryLocation W29642792981 @default.
- W2964279298 hasRelatedWork W1531274257 @default.
- W2964279298 hasRelatedWork W1575611224 @default.
- W2964279298 hasRelatedWork W1577719727 @default.
- W2964279298 hasRelatedWork W2005294461 @default.
- W2964279298 hasRelatedWork W2029392249 @default.
- W2964279298 hasRelatedWork W204944272 @default.
- W2964279298 hasRelatedWork W2122684646 @default.
- W2964279298 hasRelatedWork W2138857507 @default.
- W2964279298 hasRelatedWork W2189116201 @default.
- W2964279298 hasRelatedWork W2531658223 @default.
- W2964279298 hasRelatedWork W2568718018 @default.
- W2964279298 hasRelatedWork W2766359923 @default.
- W2964279298 hasRelatedWork W2802261039 @default.
- W2964279298 hasRelatedWork W2951186298 @default.
- W2964279298 hasRelatedWork W2952739130 @default.
- W2964279298 hasRelatedWork W2952937362 @default.
- W2964279298 hasRelatedWork W2962782115 @default.
- W2964279298 hasRelatedWork W2998536432 @default.
- W2964279298 hasRelatedWork W3131432665 @default.
- W2964279298 hasRelatedWork W44222257 @default.
- W2964279298 isParatext "false" @default.
- W2964279298 isRetracted "false" @default.
- W2964279298 magId "2964279298" @default.
- W2964279298 workType "report" @default.