Time-stamped graphs and their associated influence digraphs

Authors:
Eddie Cheng;Jerrold W. Grossman;Marc J. Lipman
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, MI;Department of Mathematics and Statistics, Oakland University, Rochester, MI;Dean, School of Arts and Sciences, Indiana University-Purdue University Fort Wayne, Fort Wayne, IN
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 0
Cited 3

The structure of information pathways in a social communication network

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining the Temporal Dimension of the Information Propagation

IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
A temporal network analysis reveals the unprofitability of arbitrage in The Prosper Marketplace

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.06

Visualization

Abstract

A time-stamped graph is an undirected graph with a real number on each edge. Vertex u influences vertex v if there is a non-decreasing path from u to v. The associated influence digraph of a time-stamped graph is the directed graph that records the influences. Among other results, we determine for what n and t there exists a time-stamped graph whose associated influence digraph has n vertices and t arcs. We also investigate the minimum number of vertices a graph can have so that a given digraph is an induced subgraph of its associated influence digraph. A number of other questions are also explored.