Matches in SemOpenAlex for { <https://semopenalex.org/work/W2883237896> ?p ?o ?g. }
Showing items 1 to 60 of
60
with 100 items per page.
- W2883237896 abstract "Abstract This chapter focuses on two different dynamic processes that unfold based on connections existing in a social graph: (i) targeted social search and (ii) altruistic data routing. One key difference between these dynamic processes is the extent to which network information is exploited to determine next-hop intermediaries. For the targeted social search process with a local view of network connections, existing models are first reviewed and then some recent results of the authors providing a good statistical fit to empirical data are discussed. These results shed light on the prime utility of long-range and short-range connections in dynamically evolving targeted social search processes. In particular, the long-range connections are utilized to identify the target location up to a “small” region in the social search space quickly, whereas their navigational convenience disappears and the short-range connections become more helpful to approach the target for small social distances. This hierarchical interaction between two different types of social ties is the underlying root cause for the linear growth and saturation regimes observed in the delay function for targeted social search processes. In contrast to the targeted social search, the process of dynamic data routing in sociotechnological networks depends on the global understanding of existing connections (both physical ones at the device level and social ones at the individual level) between data sources and targets. Considering the global view of network connections, the process of data routing is formulated as an altruistic data routing problem taking social connections into account while allocating data rates over paths connecting sources and targets. The necessary and sufficient conditions for a strategy profile to be a group Nash equilibrium are provided for the process of altruistic data routing as well as showing the existence of at least one Nash equilibrium point in pure strategies." @default.
- W2883237896 created "2018-08-03" @default.
- W2883237896 creator A5041857227 @default.
- W2883237896 creator A5042307561 @default.
- W2883237896 date "2018-01-01" @default.
- W2883237896 modified "2023-09-25" @default.
- W2883237896 title "Dynamic Social Networks: Search and Data Routing" @default.
- W2883237896 doi "https://doi.org/10.1016/b978-0-12-813677-5.00023-7" @default.
- W2883237896 hasPublicationYear "2018" @default.
- W2883237896 type Work @default.
- W2883237896 sameAs 2883237896 @default.
- W2883237896 citedByCount "0" @default.
- W2883237896 crossrefType "book-chapter" @default.
- W2883237896 hasAuthorship W2883237896A5041857227 @default.
- W2883237896 hasAuthorship W2883237896A5042307561 @default.
- W2883237896 hasConcept C111919701 @default.
- W2883237896 hasConcept C120314980 @default.
- W2883237896 hasConcept C136764020 @default.
- W2883237896 hasConcept C31258907 @default.
- W2883237896 hasConcept C41008148 @default.
- W2883237896 hasConcept C4727928 @default.
- W2883237896 hasConcept C518677369 @default.
- W2883237896 hasConcept C74172769 @default.
- W2883237896 hasConcept C98045186 @default.
- W2883237896 hasConceptScore W2883237896C111919701 @default.
- W2883237896 hasConceptScore W2883237896C120314980 @default.
- W2883237896 hasConceptScore W2883237896C136764020 @default.
- W2883237896 hasConceptScore W2883237896C31258907 @default.
- W2883237896 hasConceptScore W2883237896C41008148 @default.
- W2883237896 hasConceptScore W2883237896C4727928 @default.
- W2883237896 hasConceptScore W2883237896C518677369 @default.
- W2883237896 hasConceptScore W2883237896C74172769 @default.
- W2883237896 hasConceptScore W2883237896C98045186 @default.
- W2883237896 hasLocation W28832378961 @default.
- W2883237896 hasOpenAccess W2883237896 @default.
- W2883237896 hasPrimaryLocation W28832378961 @default.
- W2883237896 hasRelatedWork W1844055344 @default.
- W2883237896 hasRelatedWork W1986437707 @default.
- W2883237896 hasRelatedWork W2001724096 @default.
- W2883237896 hasRelatedWork W2012094814 @default.
- W2883237896 hasRelatedWork W2023633440 @default.
- W2883237896 hasRelatedWork W2090979489 @default.
- W2883237896 hasRelatedWork W2492705755 @default.
- W2883237896 hasRelatedWork W2554916275 @default.
- W2883237896 hasRelatedWork W2729780422 @default.
- W2883237896 hasRelatedWork W2743027438 @default.
- W2883237896 hasRelatedWork W2761914499 @default.
- W2883237896 hasRelatedWork W2780047881 @default.
- W2883237896 hasRelatedWork W2789683196 @default.
- W2883237896 hasRelatedWork W2896561635 @default.
- W2883237896 hasRelatedWork W2938430000 @default.
- W2883237896 hasRelatedWork W2952163328 @default.
- W2883237896 hasRelatedWork W3109456613 @default.
- W2883237896 hasRelatedWork W3112654882 @default.
- W2883237896 hasRelatedWork W3179637528 @default.
- W2883237896 hasRelatedWork W3202554481 @default.
- W2883237896 isParatext "false" @default.
- W2883237896 isRetracted "false" @default.
- W2883237896 magId "2883237896" @default.
- W2883237896 workType "book-chapter" @default.