Graph connectivity and vector degree in motif-based graphs
Wang, Qihao
Loading…
Permalink
https://hdl.handle.net/2142/107975
Description
Title
Graph connectivity and vector degree in motif-based graphs
Author(s)
Wang, Qihao
Issue Date
2020-05-10
Director of Research (if dissertation) or Advisor (if thesis)
Chang, Kevin Chen-Chuan
Department of Study
Electrical & Computer Eng
Discipline
Electrical & Computer Engr
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
degree
graph theory
data mining
Abstract
Graph theory is frequently used to model and encode relationships in social networks, the internet, or biology. Due to the fundamental limitation that an edge can only connect two nodes, a standard graph is only capable of describing pairwise relationships. Therefore, some new models have been introduced to capture the relationships among more than two nodes by replacing standard edges with novel representations, like motif-edge or hyperedge. By replacing standard edges with motif-edges, the graph succeeds in describing the higher-order complex networks. However, a problem of connectivity in motif-based graphs also arises because generated motif-based graphs can be disconnected even though the standard graphs are connected. Here we first survey existing works on connectivity metrics in standard graphs, then propose a new measurement of degree, called vector degree, to extend the definition of degree from standard graphs to motif-based graphs. Some properties of vector degree will be compared with standard degree, and some connectivity metrics will be extended to motif-based graphs as well.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
