The views expressed here are those of the individual authors and not necessarily those of the JSM sponsors, their officers, or their staff.
Online Program Home
Abstract Details
|
Activity Number:
|
355
|
|
Type:
|
Contributed
|
|
Date/Time:
|
Tuesday, July 31, 2012 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
Section on Statistical Graphics
|
| Abstract - #305570 |
|
Title:
|
Complexity of Families of Multigraphs
|
|
Author(s):
|
Termeh Shafie*+ and Ove Frank
|
|
Companies:
|
Stockholm University and Stockholm University
|
|
Address:
|
Universitetsvägen 10, Stockholm, 10691, Sweden
|
|
Keywords:
|
network analysis ;
edge multiplicity ;
complexity measure ;
entropy ;
labeled graph ;
isomorphism
|
|
Abstract:
|
This article describes families of finite multigraphs with labeled or unlabeled edges and vertices. It shows how size and complexity vary for different types of equivalence classes of graphs defined by ignoring only edge labels or ignoring both edge and vertex labels. Complexity is quantified by the distribution of edge multiplicities, and different complexity measures are discussed. Basic occupancy models for multigraphs are used to illustrate different graph distributions on isomorphism and complexity. The loss of information caused by ignoring edge and vertex labels is quantified by entropy and joint information that provide tools for studying properties of and relations between different graph families.
|
The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.
Back to the full JSM 2012 program
|
2012 JSM Online Program Home
For information, contact jsm@amstat.org or phone (888) 231-3473.
If you have questions about the Continuing Education program, please contact the Education Department.