25 citations · 47 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
ERGMs are Hard
Michael J. Bannister, William E. Devanny, David Eppstein
We investigate the computational complexity of the exponential random graph model (ERGM) commonly used in social network analysis. This model represents a probability distribution…
cs.DS2014★ 8 cited
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
Michael J. Bannister, William E. Devanny, Michael T. Goodrich +2
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queri…