NOTATION FOR SOCIAL NETWORK DATA Three network schemas to represent a wide range of network data Graph theoretic Sociometric Algebraic A graph consists.

Slides:

Advertisements

Similar presentations

Lecture 2 Review Passive Sign Convention Power Generation, Absorption Power Sources Resistance Related educational modules: –Sections 1.1, 1.2, 1.3.

Advertisements

Discrete Mathematics 3. MATRICES, RELATIONS, AND FUNCTIONS Lecture 5 Dr.-Ing. Erwin Sitompul

Chapter 2 Entity-Relationship Data Modeling: Tools and Techniques

CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.

1 Section 7.3 Representing relations (part 1: matrices)

Lecture 17 Path Algebra Matrix multiplication of adjacency matrices of directed graphs give important information about the graphs. Manipulating these.

Analytical Methods in CS (CIS 505)

Social Position & Social Role Lei Tang 2009/02/13.

Graphs, relations and matrices

Real Numbers and Algebra

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.

Database Processing: Fundamentals, Design and Implementation, 9/e by David M. KroenkeChapter 2/1 Copyright © 2004 Please……. No Food Or Drink in the class.

Compound Inequalities

Victor Lee.  What are Social Networks?  Role and Position Analysis  Equivalence Models for Roles  Block Modelling.

Network Addressing. Internet Protocol Address An IP (Internet Protocol) address is a unique identifier for a node or host connection on an IP network.

1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.

Section Functions Function: A function is a correspondence between a first set, called the domain and a second set called the range such that each.

Algebra Sets of Numbers

Social Networks. 2 A social network is a social structure made up of individuals or organizations (called "nodes“), which are tied (connected) by one.

Introduction to Graph Theory

Graphs & Matrices Todd Cromedy & Bruce Nicometo March 30, 2004.

Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.

4. Relations and Digraphs Binary Relation Geometric and Algebraic Representation Method Properties Equivalence Relations Operations.

Inverses of Relations and Functions

 Class diagrams show the classes of the system, their interrelationships (including inheritance, aggregation, and association), and the operations and.

Chapter 2 Binary Values and Number Systems Chapter Goals Distinguish among categories of numbers Describe positional notation Convert numbers in.

OPTIMAL CONNECTIONS: STRENGTH AND DISTANCE IN VALUED GRAPHS Yang, Song and David Knoke RESEARCH QUESTION: How to identify optimal connections, that is,

Graphs Basic properties.

1-1 Sets of Numbers Warm Up Lesson Presentation Lesson Quiz

Chapter 3: Solving Inequalities

Probability and Simulation The Study of Randomness.

An Algorithm for Measuring Optimal Connections in Large Valued Networks Song Yang Henry Hexmoor Sociology Computer Science University of Arkansas Preparation.

Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.

Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.

Inequality Notation.

CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS

Copyright © Zeph Grunschlag,

Object-Oriented Analysis and Design

Graphing Relationships

Correlation – Regression

Topic 3 – Functions Class 1 – Domain, Range, and End Behavior

Lesson 1 -Introduction to Functions

Minimum Spanning Tree 8/7/2018 4:26 AM

Matrix Representation of Graph

1-1 Sets of Numbers Warm Up Lesson Presentation Lesson Quiz

Mathematical Structures for Computer Science Chapter 6

Network Science: A Short Introduction i3 Workshop

1-1 Sets of Numbers Warm Up Lesson Presentation Lesson Quiz

Matrix Algebra - Overview

Graph Theory By Amy C. and John M..

Discrete Mathematics Lecture 6: Set and Function

1-1 Sets of Numbers Warm Up Lesson Presentation Lesson Quiz

Discrete Mathematics Lecture 12: Graph Theory

1-7 Function Notation Aim: To write functions using function notation.

Proportional and Non-proportional Relationships

Graphs By Rajanikanth B.

Topic 3: Relations, Functions, Function Behavior Lesson 15 (1.7)

Objective- To use an equation to graph the

Discrete Mathematics for Computer Science

Graph Vocabulary.

Ordered Pair – (11 - 2) CS-708.

For Friday Read chapter 9, sections 2-3 No homework

Algebra 1 Notes Lesson 7-5 Graphing Systems of Inequalities

Equations & Graphing Algebra 1, Unit 3, Lesson 5.

45 + (−32) 16 + (−24) − − /12/2019 Algebra IA Agenda

12 + (−19) −24 + (−32) (−6) − 7 (−6) − 9 08/13/2019 Algebra IA Agenda

Presentation transcript:

NOTATION FOR SOCIAL NETWORK DATA Three network schemas to represent a wide range of network data Graph theoretic Sociometric Algebraic A graph consists of nodes connected by lines. The symbol N is used to indicate a set of actors/nodes in a graph, denoted as {N 1, N 2,…N n }

A set Suppose we have a collection of 6 actors N = {N 1 = Allison; N 2 = Drew; N 3 = Eliot; N 4 = Keith; N 5 = Ross; N 6 = Sarah} A single relation: we define a relation and see how each actor is related to other actors on this relation. To start, we assume the relation to be dichotomous and directional.

Ordered pair Dichotomous relations mean either the relation among actors/nodes present or absent in a graph Directional ties mean relationship from actor A to B is distinctive from the relationship from actor B to A. Ordered pair denotes a pair of actors/nodes related from actor I to actor J on a relationship. How many ordered pair can be present in a directional graph with g nodes/actors?

A Graph A graph consists of a number of nodes and a number of lines connecting those nodes G (N{n 1, n 2, … n n }, L{l 1, l 2, … l n }) Valued graphs have one more factor of values attached to each line G (N{n 1, n 2, … n n }, L{l 1, l 2, … l n }, W{w 1, w 2, … w n }) Some graphs have directions attached to each line, which are called directed graphs

Classification of Graphs Four types of graphs Non-directedDirected BinaryBinary, non- directional graphs Binary Directional Graphs ValuedValued, non- directional graphs Valued, directional graphs

Multiple Relations Sometimes, graphs can encompass more than one relation among their actors. Mathematically, we denote those graphs as G (N{n 1, n 2, … n n }, L{l 1, l 2, … l n }, R (r 1, r 2, …r n ))

Sociometric Notation Sociometric notation is another way to describe a matrix network dataset in addition to graph representation X ij = the value of the tie from n i to n j To capture multiple relationship among actors X ijr = the value of the tie from n i to n j on relation X R.