Pular para o conteúdo principal

livro Network Science - Albert-László Barabási

Disponível online em http://networksciencebook.com/

Capítulo 2

Exemplos de datasets de redes reais

 

The basic characteristics of ten networks used throughout this book to illustrate the tools of network science. The table lists the nature of their nodes and links, indicating if links are directed or undirected, the number of nodes (N) and links (L), and the average degree for each network. For directed networks the average degree shown is the average in- or out-degrees ‹k› = ‹kin›=‹kout› (see Equation (2.5)).  

In a complete graph each node is connected to every other node. A complete graph is often called a clique, a term frequently used in community identification. 
 
Sparseness has important consequences on the way we explore and store real networks. For example, when we store a large network in our computer, it is better to store only the list of links (i.e. elements for which Aij ≠ 0), rather than the full adjacency matrix, as an overwhelming fraction of the Aij elements are zero. Hence the matrix representation will block a huge chunk of memory, filled mainly with zeros
 
A bipartite graph (or bigraph) is a network whose nodes can be divided into two disjoint sets U and V such that each link connects a U-node to a V-node. Medicine offers another prominent example of a bipartite network: The Human Disease Network connects diseases to the genes whose mutations are known to cause or effect the corresponding disease. 

The shortest path between nodes i and j is the path with the fewest number of links. In practice we use the breadth first search (BFS) algorithm.Cycle: a path with the same start and end node. Eulerian Path: a path that traverses each link exactly once. Hamiltonian Path: a path that visits each node exactly once. 
 
The diameter of a network, denoted by dmax, is the maximum shortest path in the network.
A network is connected if all pairs of nodes in the network are connected.  
Clustering coefficient captures the degree to which the neighbors of a given node link to each other.
 
 
 

Comentários

  1. Veronica dos Santos3 de julho de 2021 às 18:23

    Livro para referência de conceitos em Teoria dos Grafos

    ResponderExcluir
  2. Veronica dos Santos3 de julho de 2021 às 19:03

    Várias explicações de como Ciência de Redes pode ser aplicado em várias áreas:
    Economic Impact: From Web Search to Social Networking
    Health: From Drug Design to Metabolic Engineering
    Security: Fighting Terrorism
    Epidemics: from Forecasting to Halting Deadly Viruses
    Neuroscience: Mapping the Brain
    Management: Uncovering the Internal Structure of an Organization

    Também explica "Six Deegree of Separation"

    ResponderExcluir

Postar um comentário

Sinta-se a vontade para comentar. Críticas construtivas são sempre bem vindas.

Postagens mais visitadas deste blog

Connected Papers: Uma abordagem alternativa para revisão da literatura

Durante um projeto de pesquisa podemos encontrar um artigo que nos identificamos em termos de problema de pesquisa e também de solução. Então surge a vontade de saber como essa área de pesquisa se desenvolveu até chegar a esse ponto ou quais desdobramentos ocorreram a partir dessa solução proposta para identificar o estado da arte nesse tema. Podemos seguir duas abordagens:  realizar uma revisão sistemática usando palavras chaves que melhor caracterizam o tema em bibliotecas digitais de referência para encontrar artigos relacionados ou realizar snowballing ancorado nesse artigo que identificamos previamente, explorando os artigos citados (backward) ou os artigos que o citam (forward)  Mas a ferramenta Connected Papers propõe uma abordagem alternativa para essa busca. O problema inicial é dado um artigo de interesse, precisamos encontrar outros artigos relacionados de "certa forma". Find different methods and approaches to the same subject Track down the state of the art rese...
3 comentários
Leia mais

Knowledge Graph Embedding with Triple Context - Leitura de Abstract

  Jun Shi, Huan Gao, Guilin Qi, and Zhangquan Zhou. 2017. Knowledge Graph Embedding with Triple Context. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (CIKM '17). Association for Computing Machinery, New York, NY, USA, 2299–2302. https://doi.org/10.1145/3132847.3133119 ABSTRACT Knowledge graph embedding, which aims to represent entities and relations in vector spaces, has shown outstanding performance on a few knowledge graph completion tasks. Most existing methods are based on the assumption that a knowledge graph is a set of separate triples, ignoring rich graph features, i.e., structural information in the graph. In this paper, we take advantages of structures in knowledge graphs, especially local structures around a triple, which we refer to as triple context. We then propose a Triple-Context-based knowledge Embedding model (TCE). For each triple, two kinds of structure information are considered as its context in the graph; one is the out...
Postar um comentário
Leia mais

KnOD 2021

Beyond Facts: Online Discourse and Knowledge Graphs A preface to the proceedings of the 1st International Workshop on Knowledge Graphs for Online Discourse Analysis (KnOD 2021, co-located with TheWebConf’21) https://ceur-ws.org/Vol-2877/preface.pdf https://knod2021.wordpress.com/   ABSTRACT Expressing opinions and interacting with others on the Web has led to the production of an abundance of online discourse data, such as claims and viewpoints on controversial topics, their sources and contexts . This data constitutes a valuable source of insights for studies into misinformation spread, bias reinforcement, echo chambers or political agenda setting. While knowledge graphs promise to provide the key to a Web of structured information, they are mainly focused on facts without keeping track of the diversity, connection or temporal evolution of online discourse data. As opposed to facts, claims are inherently more complex. Their interpretation strongly depends on the context and a vari...
2 comentários
Leia mais