Cooperative Computing for Autonomous Data Centers
|
|
- Rodney Baker
- 6 years ago
- Views:
Transcription
1 Cooperative Computing for Autonomous Data Centers Jared Saia (U. New Mexico) Joint with: Jon Berry, Cindy Phillips (Sandia Labs), Aaron Kearns (U. New Mexico)
2 Outline 1) Bounding clustering coefficients in social networks 2) An application: Cooperative Computing
3 Power Law Bounded (PLB) Assumption [Brach, et al. 16] The PLB assumption holds for a network if, for some α > 1: The number of vertices with degree k is O(n k 1 - α )
4 Power Law Bounded Neighborhood (PLBN) Assumption [Brach, et al. 15] The PLBN Assumption holds for a network if for some α, 2 < α < 3: For every vertex v, of degree d, the number of neighbors of v of degree d is: O(d 3 - α )
5 Edge Weights Consider an edge (u,v) Let dᵤ, dᵥ be the degrees of u, v Let t be the number of triangles containing (u,v) Edge Weight: 2t / (dᵤ + dᵥ - 2)
6 Bounded Weighted Degree (BWD) Assumption For any human node, the sum of the weights of edges on that node is c, where c is a universal constant Inspired by Dunbar-like argument
7 Weighted Degrees Probability Density Extremely Unlikely any vertex has weighted degree above 40 Weighted Degree
8 Edge Weights Revisited Let dᵤ, dᵥ be the degrees of u, v Let t be the number of triangles containing (u,v) Edge Weight 1: 2t / (dᵤ + dᵥ - 2) Edge Weight 2: t / (dᵤ + dᵥ - t) Both of these greater than: t / (dᵤ + dᵥ)
9 O(d 4-α ) triangle bound Assume: PLBN: Number of neighbors of v with degree d is O(d 3 - α ) BWD: Sum of edge weights touching v is O(1) Then: Number of triangles v is in is O(d 4 - α )
10 Proof Sketch (1) Neighbors with degree d Each is in O(d) triangles with v O(d 3 - α ) of them (by PLBN) Contribute O(d 4 - α ) triangles
11 Proof Sketch (2) Neighbors with degree < d Let x = # of triangles these nodes contribute Claim: Sum of edge weights is minimized when x is evenly distributed Then, sum of edge weights is: Ω(d((x/d)/d)) = Ω(x/d) By the BWD Assumption, this sum is O(1). Thus x = O(d)
12 Clustering Coefficient Consider a node v, with degree d Clustering coefficient of v: # of triangles containing v / (d choose 2) Prediction: clustering coefficient is O(d 2-α )
13 Cleaning Networks
14 Removing Non-human Nodes Can buy 500 followers for $5 on Twitter Non-human nodes can be densely connected Our goal: remove non-human nodes
15 Removing Non-human Nodes Our approach (sketch): Remove nodes based on significant deviation from average weighted degree Cross-validate with human labelling and labelling based on non-topological features Cleaning removes few human nodes, among those we checked by hand J. Berry, A. Kearns, C. Phillips, J. Saia. Finding Non-human Nodes in Electronic Social Networks Using Only Topological Data Under Submission, 2016.
16 Does our Bound on Clustering Coefficients Hold on Cleaned Networks?
17 Youtube and Twitter
18 1e+06 Power Law Bounds on Degree Distributions Frequency Youtube (cleaned 6-σ) Twitter (cleaned 6-σ) α = 2.2 α = Degree 1 Clustering Coefficients Clustering Coefficient Youtube Twitter α' = Degree
19 LiveJournal and Friendster
20 1e+06 Power Law Bounds on Degree Distributions Frequency LiveJournal Frienster α = 2.5 α = Degree 1 Clustering Coefficients Clustering Coefficient LiveJournal (cleaned 6-σ) Frienster α' = 0.5 α' = Degree
21 The Takeaway Preliminary experiments suggest clustering coefficient is O(d 2-α ) Hidden constant seems fairly small Not necessarily tight Only holds after cleaning
22 Outline 1) Bounding clustering coefficients in social networks 2) An application: Cooperative Computing
23 Cooperative Computing
24 Cooperative Computing Alice and Bob (or more) have graphs G A and G B Share the name space for nodes Cooperate to solve problems on G A G B Goal: limit total communication s
25 Previous Work: Algorithms for s-t connectivity Assumes social network structure: giant component O(log² n) communication cost Can ensure players get no information beyond the output in honest-but-curious model J. Berry, J, M. Collins, A. Kearns, C. Phillips, J. Saia, and R. Smith. "Cooperative Computing for Autonomous Data Centers." IEEE Parallel and Distributed Processing Symposium (IPDPS), 2015.
26 CCR Finding a clique in G A G B Start with a social network O(log n) nodes chosen randomly to form a clique Adversary assigns edges to Alice and Bob Goal: Find the clique with little communication Blue edges to Alice Red edges to Bob
27 CCR Assumptions 1) PLB: for some α > 2, the number of vertices with degree k is O(n k 1 - α ) 2) PLBN + BWD: for some α > 2, any degree d nodes is in O(d 4 - α ) triangles Idea: Use these assumptions to bound the number of triangles outside the clique Blue edges to Alice Red edges to Bob
28 CCR Step 1: Ramsey Theory Plant a clique of size x, and split the edges arbitrarily between Alice and Bob Ramsey theory: either Alice or Bob has θ(x³) of the triangles Blue edges to Alice Red edges to Bob
29 Step 2: Find Maximum Triangle Dense Subgraph Goal: Find a subgraph that maximizes triangle density: # triangles in subgraph / # nodes in subgraph Triangle density is: 7/5 Can solve in polynomial time using Linear Programming Greedy 3-approximation (from Charikar s 2- approximation result for maximizing edge density)
30 Step 3: Communicate WLOG, assume Alice is the one who has θ(log³ n) triangles from the planted clique Lemma: Alice s maximum triangle dense subgraph contains only nodes in the planted clique, S Lemma: Whp, any nodes not in S have O(1) edges into S
31 Algorithm 1.Alice finds max triangle-density subgraph, H, and nodes (W A ) adjacent to at least half of H. Sends H and W A to Bob. 2.Bob finds nodes (W B ) adjacent to at least half of H, and sends all induced edges (between H, W A and W B ) 3.Alice finds clique (polynomial-time since O(log n)) H W A Alice s MTDS H W A W B W B
32 Main Result Can cooperatively find a O(log n) size clique planted in a social network Requires only polylogarithmic communication Key Assumptions: Power law network Bounded weighted degree
33 Questions?
34 Extra Slides
35 Planted Clique Problem Find a clique that has been artificially added to a graph O(log n) nodes chosen randomly and build a clique Can we find a clique that s a little larger than native clique size? For Erdos-Renyi, native is log n, can find (Deshpande and Montanari 2013, Alon, Krivelevich, Sudakov, 1998) A form of anomaly detection As a hardness assumption, hardness bounds for Finding a Nash equilibrium in a 2-party game (Hazan & Krauthgamer (2011)) Finding sparse principal components (Berthet and Rigollet (2013)) Testing whether distribution is k-wise independent (Alon et al 2007) NYC Theory Day April 15,
36 References Edge Weight 1: [J. Berry, B. Hendrickson, R. LaViolette, and C. Phillips, Tolerating the community detection resolution limit with edge weighting, Physical Review E, Vol. 83, No. 5, 2011.] Edge Weight 2: [Easley, David, and Jon Kleinberg. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2010.]
37 References PLB and PLBN Assumption: [Brach, P., Cygan, M., Łącki, J. and Sankowski, P., Algorithmic Complexity of Power Law Networks, Symposium on Discrete Algorithms (SODA), 2016.]
Distribution-Free Models of Social and Information Networks
Distribution-Free Models of Social and Information Networks Tim Roughgarden (Stanford CS) joint work with Jacob Fox (Stanford Math), Rishi Gupta (Stanford CS), C. Seshadhri (UC Santa Cruz), Fan Wei (Stanford
More informationLimits of Local Algorithms in Random Graphs
Limits of Local Algorithms in Random Graphs Madhu Sudan MSR Joint work with David Gamarnik (MIT) 10/07/2014 Local Algorithms on Random Graphs 1 Preliminaries Terminology: Graph ; symmetric : Vertices;
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationConstant Price of Anarchy in Network Creation Games via Public Service Advertising
Constant Price of Anarchy in Network Creation Games via Public Service Advertising Erik D. Demaine and Morteza Zadimoghaddam MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA 02139,
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationSubdivided graphs have linear Ramsey numbers
Subdivided graphs have linear Ramsey numbers Noga Alon Bellcore, Morristown, NJ 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv,
More information2 The Fractional Chromatic Gap
C 1 11 2 The Fractional Chromatic Gap As previously noted, for any finite graph. This result follows from the strong duality of linear programs. Since there is no such duality result for infinite linear
More informationarxiv: v1 [math.co] 28 Sep 2010
Densities of Minor-Closed Graph Families David Eppstein Computer Science Department University of California, Irvine Irvine, California, USA arxiv:1009.5633v1 [math.co] 28 Sep 2010 September 3, 2018 Abstract
More informationSocial, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior
Social, Information, and Routing Networks: Models, Algorithms, and Strategic Behavior Who? Prof. Aris Anagnostopoulos Prof. Luciana S. Buriol Prof. Guido Schäfer What will We Cover? Topics: Network properties
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationOn the Approximability of Modularity Clustering
On the Approximability of Modularity Clustering Newman s Community Finding Approach for Social Nets Bhaskar DasGupta Department of Computer Science University of Illinois at Chicago Chicago, IL 60607,
More informationHow Hard Is Inference for Structured Prediction?
How Hard Is Inference for Structured Prediction? Tim Roughgarden (Stanford University) joint work with Amir Globerson (Tel Aviv), David Sontag (NYU), and Cafer Yildirum (NYU) 1 Structured Prediction structured
More informationMath 575 Exam 3. (t). What is the chromatic number of G?
Math 575 Exam 3 Name 1 (a) Draw the Grötsch graph See your notes (b) Suppose that G is a graph having 6 vertices and 9 edges and that the chromatic polynomial of G is given below Fill in the missing coefficients
More informationVertex Cover Approximations on Random Graphs.
Vertex Cover Approximations on Random Graphs. Eyjolfur Asgeirsson 1 and Cliff Stein 2 1 Reykjavik University, Reykjavik, Iceland. 2 Department of IEOR, Columbia University, New York, NY. Abstract. The
More informationExtremal Graph Theory. Ajit A. Diwan Department of Computer Science and Engineering, I. I. T. Bombay.
Extremal Graph Theory Ajit A. Diwan Department of Computer Science and Engineering, I. I. T. Bombay. Email: aad@cse.iitb.ac.in Basic Question Let H be a fixed graph. What is the maximum number of edges
More informationGraph Theory and Network Measurment
Graph Theory and Network Measurment Social and Economic Networks MohammadAmin Fazli Social and Economic Networks 1 ToC Network Representation Basic Graph Theory Definitions (SE) Network Statistics and
More informationOverlay (and P2P) Networks
Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu
More informationFinding a -regular Supergraph of Minimum Order
Finding a -regular Supergraph of Minimum Order Hans L. Bodlaender a, Richard B. Tan a,b and Jan van Leeuwen a a Department of Computer Science Utrecht University Padualaan 14, 3584 CH Utrecht The Netherlands
More informationAlgorithms and Applications in Social Networks. 2017/2018, Semester B Slava Novgorodov
Algorithms and Applications in Social Networks 2017/2018, Semester B Slava Novgorodov 1 Lesson #1 Administrative questions Course overview Introduction to Social Networks Basic definitions Network properties
More informationJudicious bisections
Judicious bisections Po-Shen Loh Carnegie Mellon University Joint work with Choongbum Lee and Benny Sudakov Max Cut Problem Given a graph, find a bipartition which maximizes the number of crossing edges.
More informationGeometric Inhomogeneous Random Graphs (GIRGs)
Geometric Inhomogeneous Random Graphs (GIRGs) (ETH Zürich) joint work with K. Bringmann, R. Keusch, C. Koch Motivation: Network Models want to develop good algorithms for large real-world networks want
More informationExtremal results for Berge-hypergraphs
Extremal results for Berge-hypergraphs Dániel Gerbner Cory Palmer Abstract Let G be a graph and H be a hypergraph both on the same vertex set. We say that a hypergraph H is a Berge-G if there is a bijection
More informationThe k-in-a-path problem for claw-free graphs
The k-in-a-path problem for claw-free graphs Jiří Fiala Univerzita Karlova v Praze Bernard Lidický Univerzita Karlova v Praze Marcin Kamiński Université Libre de Bruxelles Daniël Paulusma University of
More informationHAMILTON CYCLES IN RANDOM LIFTS OF COMPLETE GRAPHS
HAMILTON CYCLES IN RANDOM LIFTS OF COMPLETE GRAPHS TOMASZ LUCZAK, LUKASZ WITKOWSKI, AND MARCIN WITKOWSKI Abstract. We study asymptotic properties of random lifts a model of random graph introduced by Amit
More informationProblem Set 2 Solutions
Problem Set 2 Solutions Graph Theory 2016 EPFL Frank de Zeeuw & Claudiu Valculescu 1. Prove that the following statements about a graph G are equivalent. - G is a tree; - G is minimally connected (it is
More informationOn a Network Generalization of the Minmax Theorem
On a Network Generalization of the Minmax Theorem Constantinos Daskalakis Christos H. Papadimitriou {costis, christos}@cs.berkeley.edu February 10, 2009 Abstract We consider graphical games in which edges
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
More informationInterleaving Schemes on Circulant Graphs with Two Offsets
Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationLecture and notes by: Nate Chenette, Brent Myers, Hari Prasad November 8, Property Testing
Property Testing 1 Introduction Broadly, property testing is the study of the following class of problems: Given the ability to perform (local) queries concerning a particular object (e.g., a function,
More informationRumour spreading in the spatial preferential attachment model
Rumour spreading in the spatial preferential attachment model Abbas Mehrabian University of British Columbia Banff, 2016 joint work with Jeannette Janssen The push&pull rumour spreading protocol [Demers,
More informationChordal Graphs: Theory and Algorithms
Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also
More informationAlgorithmic Game Theory. Alexander Skopalik
Algorithmic Game Theory Alexander Skopalik Today 1. Strategic games (Normal form games) Complexity 2. Zero Sum Games Existence & Complexity Outlook, next week: Network Creation Games Guest lecture by Andreas
More informationLecture 5. Figure 1: The colored edges indicate the member edges of several maximal matchings of the given graph.
5.859-Z Algorithmic Superpower Randomization September 25, 204 Lecture 5 Lecturer: Bernhard Haeupler Scribe: Neil Shah Overview The next 2 lectures are on the topic of distributed computing there are lots
More informationMonochromatic loose-cycle partitions in hypergraphs
Monochromatic loose-cycle partitions in hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 27 Budapest, H-364, Hungary gyarfas.andras@renyi.mta.hu
More informationMathematics of networks. Artem S. Novozhilov
Mathematics of networks Artem S. Novozhilov August 29, 2013 A disclaimer: While preparing these lecture notes, I am using a lot of different sources for inspiration, which I usually do not cite in the
More informationThe universal triangle-free graph has finite big Ramsey degrees
The universal triangle-free graph has finite big Ramsey degrees Natasha Dobrinen University of Denver ASL, March 22, 2017 Dobrinen big Ramsey degrees University of Denver 1 / 59 Ramsey s Theorem Ramsey
More informationA Game-Theoretic Approach for Minimizing Delays in Autonomous Intersections
A Game-Theoretic Approach for Minimizing Delays in Autonomous Intersections Robert P. Adkins, David M. Mount, and Alice A. Zhang Abstract Traffic management systems of the near future will be able to exploit
More informationdoi: /j.ipl
doi: 101016/jipl201110015 A comment on pure-strategy Nash equilibria in competitive diffusion games Reiko Takehara a, Masahiro Hachimori a, Maiko Shigeno a,1, a Graduate School of Systems and Information
More informationA random triadic process
A random triadic process Dániel Korándi 1 Department of Mathematics ETH Zurich Zurich, Switzerland Yuval Peled 2 School of Computer Science and Engineering The Hebrew University of Jerusalem Jerusalem,
More informationCONNECTIVITY CHECK IN 3-CONNECTED PLANAR GRAPHS WITH OBSTACLES
CONNECTIVITY CHECK IN 3-CONNECTED PLANAR GRAPHS WITH OBSTACLES M. M. KANTÉ 1 B. COURCELLE 1 C. GAVOILLE 1 A. TWIGG 2 1 Université Bordeaux 1, LaBRI, CNRS. 2 Computer Laboratory, Cambridge University. Topological
More information6.856 Randomized Algorithms
6.856 Randomized Algorithms David Karger Handout #4, September 21, 2002 Homework 1 Solutions Problem 1 MR 1.8. (a) The min-cut algorithm given in class works because at each step it is very unlikely (probability
More informationOn Approximating Minimum Vertex Cover for Graphs with Perfect Matching
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching Jianer Chen and Iyad A. Kanj Abstract It has been a challenging open problem whether there is a polynomial time approximation algorithm
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationBayesian Networks, Winter Yoav Haimovitch & Ariel Raviv
Bayesian Networks, Winter 2009-2010 Yoav Haimovitch & Ariel Raviv 1 Chordal Graph Warm up Theorem 7 Perfect Vertex Elimination Scheme Maximal cliques Tree Bibliography M.C.Golumbic Algorithmic Graph Theory
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationMIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns
MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns This is a closed-book exam. You should have no material on your desk other than the exam itself and a pencil or pen.
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationSublinear Time and Space Algorithms 2016B Lecture 7 Sublinear-Time Algorithms for Sparse Graphs
Sublinear Time and Space Algorithms 2016B Lecture 7 Sublinear-Time Algorithms for Sparse Graphs Robert Krauthgamer 1 Approximating Average Degree in a Graph Input: A graph represented (say) as the adjacency
More informationTHE PRICE OF ANARCHY IN COOPERATIVE NETWORK CREATION GAMES
Symposium on Theoretical Aspects of Computer Science 2009 (Freiberg, Germany), pp. to appear www.stacs-conf.org THE PRICE OF ANARCHY IN COOPERATIVE NETWORK CREATION GAMES ERIK D. DEMAINE 1 AND MOHAMMADTAGHI
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationHow Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
More informationStreaming verification of graph problems
Streaming verification of graph problems Suresh Venkatasubramanian The University of Utah Joint work with Amirali Abdullah, Samira Daruki and Chitradeep Dutta Roy Outsourcing Computations We no longer
More informationThe Ordered Covering Problem
The Ordered Covering Problem Uriel Feige Yael Hitron November 8, 2016 Abstract We introduce the Ordered Covering (OC) problem. The input is a finite set of n elements X, a color function c : X {0, 1} and
More informationOn the Min-Max 2-Cluster Editing Problem
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 29, 1109-1120 (2013) On the Min-Max 2-Cluster Editing Problem LI-HSUAN CHEN 1, MAW-SHANG CHANG 2, CHUN-CHIEH WANG 1 AND BANG YE WU 1,* 1 Department of Computer
More informationChapter 8 DOMINATING SETS
Chapter 8 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationMAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS
MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS MANUEL FERNÁNDEZ, NICHOLAS SIEGER, AND MICHAEL TAIT Abstract. In 99, Bollobás and Frieze showed that the threshold for G n,p to contain a spanning
More informationGraphs and Discrete Structures
Graphs and Discrete Structures Nicolas Bousquet Louis Esperet Fall 2018 Abstract Brief summary of the first and second course. É 1 Chromatic number, independence number and clique number The chromatic
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science Algorithms For Inference Fall 2014
Suggested Reading: Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.438 Algorithms For Inference Fall 2014 Probabilistic Modelling and Reasoning: The Junction
More informationChapter 8 DOMINATING SETS
Distributed Computing Group Chapter 8 DOMINATING SETS Mobile Computing Summer 2004 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationPacking Edge-Disjoint Triangles in Given Graphs
Electronic Colloquium on Computational Complexity, Report No. 13 (01) Packing Edge-Disjoint Triangles in Given Graphs Tomás Feder Carlos Subi Abstract Given a graph G, we consider the problem of finding
More information1 Minimal Examples and Extremal Problems
MATH 68 Notes Combinatorics and Graph Theory II 1 Minimal Examples and Extremal Problems Minimal and extremal problems are really variations on the same question: what is the largest or smallest graph
More informationHow Bad is Selfish Routing?
How Bad is Selfish Routing? Tim Roughgarden and Éva Tardos Presented by Brighten Godfrey 1 Game Theory Two or more players For each player, a set of strategies For each combination of played strategies,
More informationComparing the strength of query types in property testing: The case of testing k-colorability
Comparing the strength of query types in property testing: The case of testing k-colorability Ido Ben-Eliezer Tali Kaufman Michael Krivelevich Dana Ron Abstract We study the power of four query models
More informationOn the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games
On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games Bruno Codenotti Daniel Štefankovič Abstract The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University, y http://cs224w.stanford.edu Due in 1 week: Oct 4 in class! The idea of the reaction papers is: To familiarize yourselves
More informationErdös-Rényi Graphs, Part 2
Graphs and Networks Lecture 3 Erdös-Rényi Graphs, Part 2 Daniel A. Spielman September 5, 2013 3.1 Disclaimer These notes are not necessarily an accurate representation of what happened in class. They are
More informationA Survey of Correlation Clustering
COMS E6998: Advanced Topics in Computational Learning Theory. Author: Hila Becker Date: May 5, 2005 A Survey of Correlation Clustering Abstract The problem of partitioning a set of data points into clusters
More informationAn expected polynomial time algorithm for coloring 2-colorable 3-graphs
An expected polynomial time algorithm for coloring 2-colorable 3-graphs Yury Person 1,2 Mathias Schacht 2 Institut für Informatik Humboldt-Universität zu Berlin Unter den Linden 6, D-10099 Berlin, Germany
More informationDistributed Coloring in. Kishore Kothapalli Department of Computer Science Johns Hopkins University Baltimore, MD USA
Distributed Coloring in Bit Rounds Kishore Kothapalli Department of Computer Science Johns Hopkins University Baltimore, MD USA Vertex Coloring Proper coloring Not a Proper coloring 1 Coloring a Cycle
More informationTruth, Lies, and Random Bits
Truth, Lies, and Random Bits Jared Saia University of New Mexico, Albuquerque, NM, USA January, 2015 The Searchers, 1956 Westerns Wide-open spaces Epic struggles Borrow from many sources Westerns
More informationDisjoint cycles intersecting a set of vertices
Disjoint cycles intersecting a set of vertices M. Pontecorvi, P. Wollan May 28, 2012 Abstract A classic theorem of Erdős and Pósa states that there exists a constant c such that for all positive integers
More informationAlgorithmic Game Theory - Introduction, Complexity, Nash
Algorithmic Game Theory - Introduction, Complexity, Nash Branislav Bošanský Czech Technical University in Prague branislav.bosansky@agents.fel.cvut.cz February 25, 2018 About This Course main topics of
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationMichał Dębski. Uniwersytet Warszawski. On a topological relaxation of a conjecture of Erdős and Nešetřil
Michał Dębski Uniwersytet Warszawski On a topological relaxation of a conjecture of Erdős and Nešetřil Praca semestralna nr 3 (semestr letni 2012/13) Opiekun pracy: Tomasz Łuczak On a topological relaxation
More informationModels of Network Formation. Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation Networked Life NETS 112 Fall 2017 Prof. Michael Kearns Roadmap Recently: typical large-scale social and other networks exhibit: giant component with small diameter sparsity
More informationScribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu
CS 267 Lecture 3 Shortest paths, graph diameter Scribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu Today we will talk about algorithms for finding shortest paths in a graph.
More informationMatchings, Ramsey Theory, And Other Graph Fun
Matchings, Ramsey Theory, And Other Graph Fun Evelyne Smith-Roberge University of Waterloo April 5th, 2017 Recap... In the last two weeks, we ve covered: What is a graph? Eulerian circuits Hamiltonian
More informationOnline Coloring Known Graphs
Online Coloring Known Graphs Magnús M. Halldórsson Science Institute University of Iceland IS-107 Reykjavik, Iceland mmh@hi.is, www.hi.is/ mmh. Submitted: September 13, 1999; Accepted: February 24, 2000.
More informationDynamics, Non-Cooperation, and Other Algorithmic Challenges in Peer-to-Peer Computing
Dynamics, Non-Cooperation, and Other Algorithmic Challenges in Peer-to-Peer Computing Stefan Schmid Distributed Computing Group Oberseminar TU München, Germany December 2007 Networks Neuron Networks DISTRIBUTED
More informationAn Introduction to Chromatic Polynomials
An Introduction to Chromatic Polynomials Julie Zhang May 17, 2018 Abstract This paper will provide an introduction to chromatic polynomials. We will first define chromatic polynomials and related terms,
More informationCombinatorial Gems. Po-Shen Loh. June 2009
Combinatorial Gems Po-Shen Loh June 2009 Although this lecture does not contain many offical Olympiad problems, the arguments which are used are all common elements of Olympiad problem solving. Some of
More informationTowards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling
Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling Aaron D. Jaggard DIMACS Rutgers University Joint work with Vijay Ramachandran (Colgate) and Rebecca
More informationCOMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)
COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small
More informationStreaming Algorithms for Matching Size in Sparse Graphs
Streaming Algorithms for Matching Size in Sparse Graphs Graham Cormode g.cormode@warwick.ac.uk Joint work with S. Muthukrishnan (Rutgers), Morteza Monemizadeh (Rutgers Amazon) Hossein Jowhari (Warwick
More informationDisjoint directed cycles
Disjoint directed cycles Noga Alon Abstract It is shown that there exists a positive ɛ so that for any integer k, every directed graph with minimum outdegree at least k contains at least ɛk vertex disjoint
More informationOn the finite big Ramsey degrees for the universal triangle-free graph: A progress report
On the finite big Ramsey degrees for the universal triangle-free graph: A progress report Natasha Dobrinen University of Denver Arctic Set Theory III, January 2017 Dobrinen big Ramsey numbers University
More informationComputing Pure Nash Equilibria in Symmetric Action Graph Games
Computing Pure Nash Equilibria in Symmetric Action Graph Games Albert Xin Jiang Kevin Leyton-Brown Department of Computer Science University of British Columbia {jiang;kevinlb}@cs.ubc.ca July 26, 2007
More informationIn this paper we consider probabilistic algorithms for that task. Each processor is equipped with a perfect source of randomness, and the processor's
A lower bound on probabilistic algorithms for distributive ring coloring Moni Naor IBM Research Division Almaden Research Center San Jose, CA 9510 Abstract Suppose that n processors are arranged in a ring
More informationClustering Using Graph Connectivity
Clustering Using Graph Connectivity Patrick Williams June 3, 010 1 Introduction It is often desirable to group elements of a set into disjoint subsets, based on the similarity between the elements in the
More informationA Game-Theoretic Framework for Congestion Control in General Topology Networks
A Game-Theoretic Framework for Congestion Control in General Topology SYS793 Presentation! By:! Computer Science Department! University of Virginia 1 Outline 2 1 Problem and Motivation! Congestion Control
More informationChoosing a Random Peer
Choosing a Random Peer Jared Saia University of New Mexico Joint Work with Valerie King University of Victoria and Scott Lewis University of New Mexico P2P problems Easy problems on small networks become
More informationIndependent dominating sets in graphs of girth five via the semi-random method
Independent dominating sets in graphs of girth five via the semi-random method Ararat Harutyunyan (Oxford), Paul Horn (Harvard), Jacques Verstraete (UCSD) March 12, 2014 Introduction: The semi-random method
More informationNash Equilibrium Load Balancing
Nash Equilibrium Load Balancing Computer Science Department Collaborators: A. Kothari, C. Toth, Y. Zhou Load Balancing A set of m servers or machines. A set of n clients or jobs. Each job can be run only
More informationNetwork Theory: Social, Mythological and Fictional Networks. Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao
Network Theory: Social, Mythological and Fictional Networks Math 485, Spring 2018 (Midterm Report) Christina West, Taylor Martins, Yihe Hao Abstract: Comparative mythology is a largely qualitative and
More informationLecture 22 - Oblivious Transfer (OT) and Private Information Retrieval (PIR)
Lecture 22 - Oblivious Transfer (OT) and Private Information Retrieval (PIR) Boaz Barak December 8, 2005 Oblivious Transfer We are thinking of the following situation: we have a server and a client (or
More informationApproximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks
Approximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks Thomas Erlebach Department of Computer Science University of Leicester, UK te17@mcs.le.ac.uk Ambreen Shahnaz Department of Computer
More information