scholarly journals Poisson approximation and connectivity in a scale-free random connection model

2021 ◽  
Vol 26 (none) ◽  
Author(s):  
Srikanth K. Iyer ◽  
Sanjoy Kr Jhawar
Keyword(s):  
Poisson Approximation ◽  
Scale Free ◽  
Random Connection Model

scholarly journals Navigation in small-world networks: a scale-free continuum model

2006 ◽  
Vol 43 (04) ◽  
pp. 1173-1180 ◽  
Author(s):  
Massimo Franceschetti ◽  
Ronald Meester
Keyword(s):  
Social Sciences ◽  
Scale Invariance ◽  
Small World ◽  
Local Information ◽  
Engineering Systems ◽  
Small World Networks ◽  
Social Contacts ◽  
Scale Free ◽  
Free Model ◽  
Random Connection Model

The small-world phenomenon, the principle that we are all linked by a short chain of intermediate acquaintances, has been investigated in mathematics and social sciences. It has been shown to be pervasive both in nature and in engineering systems like the World Wide Web. Work of Jon Kleinberg has shown that people, using only local information, are very effective at finding short paths in a network of social contacts. In this paper we argue that the underlying key to finding short paths is scale invariance. In order to appreciate scale invariance we suggest a continuum setting, since true scale invariance happens at all scales, something which cannot be observed in a discrete model. We introduce a random-connection model that is related to continuum percolation, and we prove the existence of a unique scale-free model, among a large class of models, that allows the construction, with high probability, of short paths between pairs of points separated by any distance.

scholarly journals Navigation in small-world networks: a scale-free continuum model

2006 ◽  
Vol 43 (4) ◽  
pp. 1173-1180 ◽  
Author(s):  
Massimo Franceschetti ◽  
Ronald Meester
Keyword(s):  
Social Sciences ◽  
Scale Invariance ◽  
Small World ◽  
Local Information ◽  
Engineering Systems ◽  
Small World Networks ◽  
Social Contacts ◽  
Scale Free ◽  
Free Model ◽  
Random Connection Model

The small-world phenomenon, the principle that we are all linked by a short chain of intermediate acquaintances, has been investigated in mathematics and social sciences. It has been shown to be pervasive both in nature and in engineering systems like the World Wide Web. Work of Jon Kleinberg has shown that people, using only local information, are very effective at finding short paths in a network of social contacts. In this paper we argue that the underlying key to finding short paths is scale invariance. In order to appreciate scale invariance we suggest a continuum setting, since true scale invariance happens at all scales, something which cannot be observed in a discrete model. We introduce a random-connection model that is related to continuum percolation, and we prove the existence of a unique scale-free model, among a large class of models, that allows the construction, with high probability, of short paths between pairs of points separated by any distance.

Scale-free architectures support representational diversity

2020 ◽  
Vol 43 ◽  
Author(s):  
Chris Fields ◽  
James F. Glazebrook
Keyword(s):  
Cognitive Architecture ◽  
Levels Of Abstraction ◽  
Scale Free ◽  
Abstract Representations ◽  
Computational Architecture ◽  
Architectural Models ◽  
Cognition Scale

Abstract Gilead et al. propose an ontology of abstract representations based on folk-psychological conceptions of cognitive architecture. There is, however, no evidence that the experience of cognition reveals the architecture of cognition. Scale-free architectural models propose that cognition has the same computational architecture from sub-cellular to whole-organism scales. This scale-free architecture supports representations with diverse functions and levels of abstraction.

The Scale-free Property in Emotion: Associated Word Networks

2010 ◽  
Author(s):  
Takuma Takehara ◽  
Tumio Ochiai ◽  
Kosuke Tamiguchi ◽  
Naoto Suzuki
Keyword(s):  
Scale Free

Research on new evolution model of scale-free network

2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO
Keyword(s):  
Evolution Model ◽  
Scale Free Network ◽  
Scale Free ◽  
Free Network

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

Sign in / Sign up

Export Citation Format

Share Document