scholarly journals The Emergence of Scaling Law, Fractal Patterns and Small-World in Wireless Networks

IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 3121-3130 ◽  
Author(s):  
Chao Yuan ◽  
Zhifeng Zhao ◽  
Rongpeng Li ◽  
Meng Li ◽  
Honggang Zhang
2011 ◽  
Vol 55-57 ◽  
pp. 555-560
Author(s):  
Xin Yan ◽  
Jia Gen Du

Topology clustering, constructing overlay graphs, adding relay nodes, or creating a “small-world” network by building some shortcuts etc, topology control schemes are able to achieve the scalability, resilience, and fault-tolerance for wireless communication networks. In this article, we take a different approach to reach such aim for heterogeneous integrated wireless networks by generating a topology such that the resulting network is “scale-free”. Thereby we propose a topology control algorithm based on the “scale-free” complex network concept and directed proximity graph theory for integrated wireless networks with non-uniform transmission ranges. In this algorithm, the topology is also generated by new nodes’ growth and preferential attachment procedure, but where each new node connects to the existing nodes in its directed attachable proximity in terms of certain probability at each time step. Each node’s directed attachable proximity graph is generated from its directed reachable proximity graph that is built by regulating its transmission power based on locally collected information. The simulation experiments are provided to validate our claims.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Nicolò Pagan ◽  
Wenjun Mei ◽  
Cheng Li ◽  
Florian Dörfler

AbstractMany of today’s most used online social networks such as Instagram, YouTube, Twitter, or Twitch are based on User-Generated Content (UGC). Thanks to the integrated search engines, users of these platforms can discover and follow their peers based on the UGC and its quality. Here, we propose an untouched meritocratic approach for directed network formation, inspired by empirical evidence on Twitter data: actors continuously search for the best UGC provider. We theoretically and numerically analyze the network equilibria properties under different meeting probabilities: while featuring common real-world networks properties, e.g., scaling law or small-world effect, our model predicts that the expected in-degree follows a Zipf’s law with respect to the quality ranking. Notably, the results are robust against the effect of recommendation systems mimicked through preferential attachment based meeting approaches. Our theoretical results are empirically validated against large data sets collected from Twitch, a fast-growing platform for online gamers.


2013 ◽  
Vol 17 (10) ◽  
pp. 1928-1931 ◽  
Author(s):  
Tiankui Zhang ◽  
Jinlong Cao ◽  
Yue Chen ◽  
Laurie Cuthbert ◽  
Maged Elkashlan

Author(s):  
Ziqian Dong ◽  
Zheng Wang ◽  
Wen Xie ◽  
Obinna Emelumadu ◽  
Chuanbi Lin ◽  
...  

2008 ◽  
Vol 19 (07) ◽  
pp. 1035-1045 ◽  
Author(s):  
A. KRAWIECKI

A multi-agent spin model for changes of prices in the stock market based on the Ising-like cellular automaton with interactions between traders randomly varying in time is investigated by means of Monte Carlo simulations. The structure of interactions has topology of a small-world network obtained from regular two-dimensional square lattices with various coordination numbers by randomly cutting and rewiring edges. Simulations of the model on regular lattices do not yield time series of logarithmic price returns with statistical properties comparable with the empirical ones. In contrast, in the case of networks with a certain degree of randomness for a wide range of parameters the time series of the logarithmic price returns exhibit intermittent bursting typical of volatility clustering. Also the tails of distributions of returns obey a power scaling law with exponents comparable to those obtained from the empirical data.


2012 ◽  
Vol 55 (8) ◽  
pp. 909-931 ◽  
Author(s):  
R. Agarwal ◽  
A. Banerjee ◽  
V. Gauthier ◽  
M. Becker ◽  
C. K. Yeo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document