Dynamical Growth Using Preferential Attachment and Emergent Probability - PowerPoint PPT Presentation

1 / 10
About This Presentation
Title:

Dynamical Growth Using Preferential Attachment and Emergent Probability

Description:

The edges can be directed or undirected and can have different weights. ... of networks include social relations, transportation systems, metabolic ... – PowerPoint PPT presentation

Number of Views:63
Avg rating:3.0/5.0
Slides: 11
Provided by: lsaU5
Category:

less

Transcript and Presenter's Notes

Title: Dynamical Growth Using Preferential Attachment and Emergent Probability


1
Dynamical Growth Using Preferential Attachment
and Emergent Probability
  • Rocio Ruelas
  • August 1, 2007
  • REU Physics

2
Networks
  • A network is any inter-connected group or system.
  • It consists of nodes and edges.
  • The edges can be directed or undirected and can
    have different weights.
  • The adjacency matrix of a network contains all of
    the information of that network.
  • Examples of networks include social relations,
    transportation systems, metabolic interactions
    and the Internet.

3
Model of Network Growth
  • Begins with a few nodes with a high degree of
    interconnectivity.
  • Adds new nodes and edges using preferential
    attachment.
  • Most edges are directed so that older nodes point
    to younger nodes, but there is a small
    probability that a younger node will point to an
    older node.
  • After a certain amount of growth, we turn on
    nodes and make them functional.
  • From the functional nodes we sort them into
    communities.
  • Then we search for recurrent schemes (RS), which
    are sets of nodes that form a loop.
  • Once a set is found, it is compressed into one
    node and the growth process is repeated.

4
Growing the Network
5
Functionality
6
Functionality
7
Community Splitting
  • Modularity is a measure of the quality of a
    splitting.
  • Communities are found through a divisive
    hierarchical greedy algorithm.
  • Starting from a graph of all the functional
    nodes, each node is assigned to one of two
    communities. If the assignment increases the
    modularity then the graph is split in two.
  • The same process occurs for the two communities
    and will continue for all sub-communities until
    an assignment does not correspond to an increase
    in modularity.

8
Recurrent Schemes
  • RS are found by taking each of the communities
    and removing trees until only the loops are left.
  • Once a set is found, it is merged into one super
    node that maintains all of the connections
    between the RS and external nodes.
  • We can then observe the dynamics between multiple
    RS.

9
Why Use This Model?
  • Original inspiration from Bernard Lonergan who
    wrote Insight A Study of Human Understanding
    in1957. Which outlined the process in which
    knowledge is acquired.
  • Useful for understanding biological processes and
    chemical interactions.
  • Useful for a general evolutionary model.
  • It helps us understand how complexity can arise
    from simple beginnings.

10
Acknowledgments
  • Professor Michael Bretz
  • Center for Complex Systems
  • Howard Oishi
  • Sarah Cherng
  • REU Physics Program
Write a Comment
User Comments (0)
About PowerShow.com