We build a search-and-matching algorithm of network dynamics with decision-making under incomplete information, seeking to understand the determinants of the observed gradual downgrading of expert opinion on complicated issues and the decreasing trust in science. Even without fake news,...

We build a model of network dynamics with decision-making under incomplete information in order to understand the determinants of the observed gradual downgrading of expert opinion on complicated issues and the decreasing trust in science. We suggest a search and matching mechanism behind...

Many networks such as the Internet have been found to possess scale-free and small-world network properties reflected by so-called power law distributions. Scale-free properties evolve in large complex networks through self-organizing processes and more specifically, preferential attachment. New...

The website network of a tourism destination is examined. Network theoretic metrics are used to gauge the static and dynamic characteristics of the webspace. The topology of the network is found partly similar to the one exhibited by similar systems. However, some differences are found, mainly...

We analyze the spectra of eigenvalues for random graphs with a local tree-like structure. The exact equations to the spectra of networks with a local tree-like structure are presented. We propose a simple approximation, and in the framework of effective medium approximation, calculate spectra of...

Self-organized networks are pervasive in communication systems such as the Internet, overlay networks, peer-to-peer networks, and cluster-based services. These networks evolve into complex topologies, under specific driving forces, i.e. user demands, technological innovations, design objectives...

We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We...

Clever assignments of link weights are able to change communication routes in such a way that loads are distributed almost evenly across a network. This is achieved by weight assignments based on the link load. As demonstrated for scale-free as well as synthetic Internet networks, they...

The Internet is one of the largest and most complex communication and information exchange networks ever created. Therefore, its dynamics and traffic unsurprisingly take on a rich variety of complex dynamics, self-organization, and other phenomena that have been researched for years. This paper...