Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2020
Fiedler Vector Approximation via Interacting RandomWalks
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 48, Issue 1Pages 101–102https://doi.org/10.1145/3410048.3410107The Fiedler vector of a graph, namely the eigenvector corresponding to the second smallest eigenvalue of a graph Laplacian matrix, plays an important role in spectral graph theory with applications in problems such as graph bi-partitioning and envelope ...
- research-articleJune 2018
The Cost of Uncertainty in Curing Epidemics
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 46, Issue 1Pages 11–13https://doi.org/10.1145/3292040.3219622Epidemic models are used across biological and social sciences, engineering, and computer science, and have had important impact in the study of the dynamics of human disease and computer viruses, but also trends rumors, viral videos, and most recently ...
Also Published in:
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450358460 - research-articleJune 2018
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 46, Issue 1Pages 8–10https://doi.org/10.1145/3292040.3219621Graph-based semi-supervised learning (SSL) algorithms predict labels for all nodes based on provided labels of a small set of seed nodes. Classic methods capture the graph structure through some underlying diffusion process that propagates through the ...
Also Published in:
SIGMETRICS '18: Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450358460 - abstractJune 2017
Hieroglyph: Locally-Sufficient Graph Processing via Compute-Sync-Merge
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 45, Issue 1Page 5https://doi.org/10.1145/3143314.3078589Mainstream graph processing systems (such as Pregel [3] and PowerGraph [1]) follow the bulk synchronous parallel model. This design leads to the tight coupling of computation and communication, where no vertex can proceed to the next iteration of ...
Also Published in:
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450350327 - abstractJune 2017
A Simple Yet Effective Balanced Edge Partition Model for Parallel Computing
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 45, Issue 1Page 6https://doi.org/10.1145/3143314.3078520Graph edge partition models have recently become an appealing alternative to graph vertex partition models for distributed computing due to both their flexibility in balancing loads and their performance in reducing communication cost.
In this paper, we ...
Also Published in:
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450350327 -
- extended-abstractJune 2016
Searching For A Single Community in a Graph
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 44, Issue 1Pages 399–400https://doi.org/10.1145/2964791.2901494In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. In contrast, the search problem of this paper aims to only find the nodes in a single such community, the target, ...
Also Published in:
SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science: ISBN 9781450342667 - posterJune 2015
Speeding up Glauber Dynamics for Random Generation of Independent Sets
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 43, Issue 1Pages 461–462https://doi.org/10.1145/2796314.2745893The maximum independent set (MIS) problem is a well-studied combinatorial optimization problem that naturally arises in many applications, such as wireless communication, information theory and statistical mechanics.
MIS problem is NP-hard, thus many ...
Also Published in:
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450334860 - research-articleJune 2015
Social Network Monetization via Sponsored Viral Marketing
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 43, Issue 1Pages 259–270https://doi.org/10.1145/2796314.2745853Viral marketing is a powerful tool for online advertising and sales because it exploits the influence people have on one another. While this marketing technique has been beneficial for advertisers, it has not been shown how the social network providers ...
Also Published in:
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450334860 - research-articleJune 2015
Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical Approaches for Information Recovery
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 43, Issue 1Pages 361–374https://doi.org/10.1145/2796314.2745846Recent events demonstrated the vulnerability of power grids to cyber attacks and to physical attacks. Therefore, we focus on joint cyber and physical attacks and develop methods to retrieve the grid state information following such an attack. We ...
Also Published in:
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems: ISBN 9781450334860 - research-articleJune 2014
Tunable survivable spanning trees
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 42, Issue 1Pages 315–327https://doi.org/10.1145/2637364.2591997Coping with network failures has become a major networking challenge. The concept of tunable survivability provides a quantitative measure for specifying any desired level (0%-100%) of survivability, thus offering flexibility in the routing choice. ...
Also Published in:
SIGMETRICS '14: The 2014 ACM international conference on Measurement and modeling of computer systems: ISBN 9781450327893 - research-articleJune 2014
Rumor source detection with multiple observations: fundamental limits and algorithms
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 42, Issue 1Pages 1–13https://doi.org/10.1145/2637364.2591993This paper addresses the problem of a single rumor source detection with multiple observations, from a statistical point of view of a spreading over a network, based on the susceptible-infectious model. For tree networks, multiple sequential ...
Also Published in:
SIGMETRICS '14: The 2014 ACM international conference on Measurement and modeling of computer systems: ISBN 9781450327893 - extended-abstractApril 2014
Beyond graphs: toward scalable hypergraph analysis systems
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 41, Issue 4Pages 94–97https://doi.org/10.1145/2627534.2627563Graph theory has provided a powerful modeling foundation for problems in many domains, but we argue that group interactions are better modeled by hypergraphs. As we work toward scalable systems for such hypergraph analysis, several major challenges and ...
- extended-abstractApril 2014
Analysis of influence maximization in large-scale social networks
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 41, Issue 4Pages 78–81https://doi.org/10.1145/2627534.2627559Influence maximization is an important problem in online social networks. With the scale of social networks increasing, the requirements of solutions for influence maximization are becoming more and more strict. In this paper, we discuss two basic ...
- posterJune 2013
Computational analysis of cascading failures in power networks
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 41, Issue 1Pages 337–338https://doi.org/10.1145/2494232.2465752This paper focuses on cascading line failures in the transmission system of the power grid. Such a cascade may have a devastating effect not only on the power grid but also on the interconnected communication networks. Recent large-scale power outages ...
Also Published in:
SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems: ISBN 9781450319003 - research-articleJune 2012
Learning the graph of epidemic cascades
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 40, Issue 1Pages 211–222https://doi.org/10.1145/2318857.2254783We consider the problem of finding the graph on which an epidemic spreads, given only the times when each node gets infected. While this is a problem of central importance in several contexts -- offline and online social networks, e-commerce, ...
Also Published in:
SIGMETRICS '12: Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems: ISBN 9781450310970 - research-articleJune 2012
Rumor centrality: a universal source detector
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 40, Issue 1Pages 199–210https://doi.org/10.1145/2318857.2254782We consider the problem of detecting the source of a rumor (information diffusion) in a network based on observations about which set of nodes possess the rumor. In a recent work [10], this question was introduced and studied. The authors proposed rumor ...
Also Published in:
SIGMETRICS '12: Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems: ISBN 9781450310970 - short-paperOctober 2010
On random walks in direction-aware network problems
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 38, Issue 2Pages 9–11https://doi.org/10.1145/1870178.1870182Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the networking literature are based on undirected graph models, where a symmetric ...
- research-articleJune 2010
Detecting sources of computer viruses in networks: theory and experiment
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 38, Issue 1Pages 203–214https://doi.org/10.1145/1811099.1811063We provide a systematic study of the problem of finding the source of a computer virus in a network. We model virus spreading in a network with a variant of the popular SIR model and then construct an estimator for the virus source. This estimator is ...
Also Published in:
SIGMETRICS '10: Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems: ISBN 9781450300384 - research-articleJune 2009
Node weighted scheduling
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 37, Issue 1Pages 97–108https://doi.org/10.1145/2492101.1555361This paper proposes a new class of online policies for scheduling in input-buffered crossbar switches. Given an initial configuration of packets at the input buffers, these policies drain all packets in the system in the minimal amount of time provided ...
Also Published in:
SIGMETRICS '09: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems: ISBN 9781605585116