Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Equitable colorings extend Chernoff-Hoeffding bounds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Scalable, efficient epidemiological simulation
Proceedings of the 2002 ACM symposium on Applied computing
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Distributions on Level-Sets with Applications to Approximation Algorithms
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
EpiNet: a simulation framework to study the spread of malware in wireless networks
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Positive Influence Dominating Set in Online Social Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Latency-Bounded Minimum Influential Node Selection in Social Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
An interaction-based approach to computational epidemiology
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Estimating clustering indexes in data streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Journal of Discrete Algorithms
Coauthorship networks and academic literature recommendation
Electronic Commerce Research and Applications
On positive influence dominating sets in social networks
Theoretical Computer Science
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Efficient generation of networks with given expected degrees
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Biomonitoring, phylogenetics and anomaly aggregation systems
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science
On the hardness of optimization in power law graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the discovery of critical links and nodes for assessing network vulnerability
IEEE/ACM Transactions on Networking (TON)
Approximability of the vertex cover problem in power-law graphs
Theoretical Computer Science
Hi-index | 0.00 |
We study the algorithmic and structural properties of very large, realistic social contact networks. We consider the social network for the city of Portland, Oregon, USA, developed as a part of the TRANSIMS/EpiSims project at the Los Alamos National Laboratory. The most expressive social contact network is a bipartite graph, with two types of nodes: people and locations; edges represent people visiting locations on a typical day. Three types of results are presented. (i) Our empirical results show that many basic characteristics of the dataset are well-modeled by a random graph approach suggested by Fan Chung Graham and Lincoln Lu (the CL-model), with a power-law degree distribution. (ii) We obtain fast approximation algorithms for computing basic structural properties such as clustering coefficients and shortest paths distribution. We also study the dominating set problem for such networks; this problem arose in connection with optimal sensor-placement for disease-detection. We present a fast approximation algorithm for computing near-optimal dominating sets. (iii) Given the close approximations provided by the CL-model to our original dataset and the large data-volume, we investigate fast methods for generating such random graphs. We present methods that can generate such a random network in near-linear time, and show that these variants asymptotically share many key features of the CL-model, and also match the Portland social network.The structural results have been used to study the impact of policy decisions for controlling large-scale epidemics in urban environments.