Analyzing and modeling real-world phenomena with complex networks: a survey of applications

Costa, Luciano da Fontoura; Oliveira, Osvaldo N.; Travieso, Gonzalo; Rodrigues, Francisco A.; Boas, Paulino Ribeiro Villas; Antiqueira, Lucas; Viana, Matheus P.; Rocha, Luis E. C.

doi:10.1080/00018732.2011.572452

Cited by 656 publications

(439 citation statements)

References 556 publications

Supporting

Mentioning

391

Contrasting

Unclassified

Order By: Relevance

“…Depending on the application, vertices and edges have different meanings [1,3]. For example, in condensed matter physics, vertices and edges of the ordered network known as Anderson's tight-binding model are the sites and hopping integrals, respectively [4].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Universality in the spectral and eigenfunction properties of random networks

et al. 2015

View full text Add to dashboard Cite

By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution P (s) and the entropic eigenfunction localization length of the adjacency matrices of Erdős-Rényi (ER) fully random networks are universal for fixed average degree ξ ≡ αN (α and N being the average network connectivity and the network size, respectively). We also demonstrate that Brody distribution characterizes well P (s) in the transition from α = 0, when the vertices in the network are isolated, to α = 1, when the network is fully connected. Moreover, we explore the validity of our findings when relaxing the randomness of our network model and show that, in contrast to standard ER networks, ER networks with diagonal disorder also show universality. Finally, we also discuss the spectral and eigenfunction properties of small-world networks.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Networks have been used to represent the organization of complex systems, such as social networks, Internet, and ecosystems [1,2]. Depending on the application, vertices and edges have different meanings [1,3].…”

Section: Introductionmentioning

confidence: 99%

Universality in the spectral and eigenfunction properties of random networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Values of α lower than or equal to c provided a utility equal to 0 since agents estimated that the expected reward was not enough to compensate the cost of the forwarding action. Values of α that were in the interval (5,10] made some agents estimate that the forwarding action was going to be profitable. Although the value for α was enough for agents to consider forwarding tasks, their utility was not always positive for all of the agents.…”

Section: The Influence Of Structural Properties and The Reward Payoffmentioning

confidence: 99%

“…Therefore, the average utility had a negative value. The interval (5,10] for α values could be considered risky. The average utility became positive with α values greater than 10 (see Figure 4 left).…”

Section: The Influence Of Structural Properties and The Reward Payoffmentioning

confidence: 99%

“…This area provides a theoretical basis for the development of models that help us to reason about how distributed systems are organized [19]. Complex Network models have been used in different contexts such as social networks (collaboration, music, religious networks), economic networks (trade, tourism, employment networks), Internet (structure and traffic networks), bio-molecular networks, and computer science networks among others [5,26].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

Martínez-Cánovas

Val

Botti

et al. 2016

Information Sciences

View full text Add to dashboard Cite

ElsevierMartínez-Cánovas, G.; Del Val Noguera, E.; Botti Navarro, VJ.; Hernández, P.; Rebollo Pedruelo, M. (2016) AbstractNew systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, agents must cooperate with other agents to be able to locate the required services. The aim of this paper is to formally and empirically analyze under what circumstances cooperation emerges in decentralized search for services. We propose a repeated game model that formalizes the interactions among agents in a search process where each agent has the freedom to choose whether or not to cooperate with other agents. Agents make decisions based on the cost of their actions and the expected reward if they participate by forwarding queries in a search process that ends successfully. We propose a strategy that is based on random-walks, and we study under what conditions the strategy is a Nash Equilibrium. We performed several experiments in order to evaluate the model and the strategy and to analyze which network structures are the most appropriate for promoting cooperation.

show abstract

References

2019

Fractional Dynamics on Networks and Lattices

View full text Add to dashboard Cite

Analyzing and modeling real-world phenomena with complex networks: a survey of applications

Cited by 656 publications

References 556 publications

Universality in the spectral and eigenfunction properties of random networks

Universality in the spectral and eigenfunction properties of random networks

A formal model based on Game Theory for the analysis of cooperation in distributed service discovery

References

Contact Info

Product

Resources

About