Planting trees in random graphs (and finding them back)

Slides:



Advertisements
Similar presentations
Week 4 – Random Graphs Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Advertisements

“From my sixth year, I had a perfect mania for drawing every object that I saw. When I had reached my fiftieth year, I had published a vast quantity of.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Spectrum Based RLA Detection Spectral property : the eigenvector entries for the attacking nodes,, has the normal distribution with mean and variance bounded.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
GS 540 week 6. HMM basics Given a sequence, and state parameters: – Each possible path through the states has a certain probability of emitting the sequence.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
Common Properties of Real Networks. Erdős-Rényi Random Graphs.
2. Attacks on Anonymized Social Networks. Setting A social network Edges may be private –E.g., “communication graph” The study of social structure by.
Bayesian Networks Alan Ritter.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
Machine Learning CUNY Graduate Center Lecture 21: Graphical Models.
Information Networks Power Laws and Network Models Lecture 3.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
第十讲 概率图模型导论 Chapter 10 Introduction to Probabilistic Graphical Models
1 Inferring structure to make substantive conclusions: How does it work? Hypothesis testing approaches: Tests on deviances, possibly penalised (AIC/BIC,
1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
CS774. Markov Random Field : Theory and Application Lecture 02
Dynamic Random Graph Modelling and Applications in the UK 2001 Foot-and-Mouth Epidemic Christopher G. Small Joint work with Yasaman Hosseinkashi, Shoja.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
J. Hwang, T. He, Y. Kim Presented by Shan Gao. Introduction  Target the scenarios where attackers announce phantom nodes.  Phantom node  Fake their.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
1 Use graphs and not pure logic Variables represented by nodes and dependencies by edges. Common in our language: “threads of thoughts”, “lines of reasoning”,
The Structure of Scientific Collaboration Networks by M. E. J. Newman CMSC 601 Paper Summary Marie desJardins January 27, 2009.
Xiaowei Ying, Kai Pan, Xintao Wu, Ling Guo Univ. of North Carolina at Charlotte SNA-KDD June 28, 2009, Paris, France Comparisons of Randomization and K-degree.
Exploiting Input Features for Controlling Tunable Approximate Programs Sherry Zhou Department of electronic engineering Tsinghua University.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Outline Introduction State-of-the-art solutions Equi-Truss Experiments
EE327 Final Representation Qianyang Peng F
Network (graph) Models
Cohesive Subgraph Computation over Large Graphs
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
New Characterizations in Turnstile Streams with Applications
COMPLEXITY THEORY IN PRACTICE
Computing and Compressive Sensing in Wireless Sensor Networks
Sequential Algorithms for Generating Random Graphs
Complex Networks: Connectivity and Functionality
Graph Theory and Algorithm 02
Graph Analysis with Node Differential Privacy
Community detection in graphs
Exact Inference Continued
MST in Log-Star Rounds of Congested Clique
Structural graph parameters Part 2: A hierarchy of parameters
Random Graph Models of large networks
The Watts-Strogatz model
Resolution Limit in Community Detection
Chi Zhang, Yang Song and Yuguang Fang
Discrete Event Simulation - 4
Peer-to-Peer and Social Networks Fall 2017
CASE − Cognitive Agents for Social Environments
Graph Operations And Representation
Luoyi Fu, Xinbing Wang, P. R. Kumar
geometric representations of graphs
On the effect of randomness on planted 3-coloring models
Markov Random Fields Presented by: Vladan Radosavljevic.
3.3 Network-Centric Community Detection
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
5.4 T-joins and Postman Problems
Modelling and Searching Networks Lecture 5 – Random graphs
Modelling and Searching Networks Lecture 6 – PA models
Network Science: A Short Introduction i3 Workshop
Discrete Mathematics and its Applications Lecture 5 – Random graphs
Network Models Michael Goodrich Some slides adapted from:
Discrete Mathematics and its Applications Lecture 6 – PA models
Advanced Topics in Data Mining Special focus: Social Networks
Constructing a m-connected k-Dominating Set in Unit Disc Graphs
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

Planting trees in random graphs (and finding them back) Laurent Massoulié Joint work with Ludovic Stephan & Don Towsley

Inference problems with planted structure Classical examples community detection, planted clique detection, planted dense subgraph detection Typical Objectives -Detection (planted structure present or not) -Recovery (estimation of planted structure) Recurring phenomena  3 regimes, or phases: -Information-Theoretic impossibility -Computational hardness though IT-feasible -Computationally easy  Boundary phases the same for both detection and reconstruction

‘Network Security’ scenario Attackers may be “plotting” or not Plotting  communications among them Goals: -Infer from observed communication graph whether attack under way (detection) -If attack detected, identify attackers (reconstruction)

Model Erdös-Rényi graph Under attack: augmented by tree on nodes chosen uniformly at random Focus on simplest tree i.e. path

Outline Phase diagram for paths Other trees

Sparse phase

First moment method: no K-path in G under  poly-time detection and reconstruction

The argument for undetectability Likelihood ratio between distributions without and with attack,

The argument for undetectability Likelihood ratio between distributions without and with attack,

Bounding Markov chain

The argument for detectability, Too many edges under Counts of small connected components enable consistent estimation of Arguments hold for any connected K-graph, not just lines and trees

The argument for reconstruction impossibility Optimal overlap between estimated and planted path: Maximum a Posteriori, i.e. nodes on largest number of K-paths

The argument for reconstruction impossibility “Lures”: can construct confounding segment s.t.

More generally: construct T symmetric paths

Other trees: stars Stars hard to hide! Threshold at Detection and reconstruction easy: inspection of degrees

D-trees

Conclusions Phase diagram for line detection & reconstruction -No computationally hard phase -Reconstruction impossible, by presence of too many copies of planted structure Planted subgraphs beyond cliques & dense subgraphs: -Phase diagram for D-regular trees? More general planted graphs? -What triggers hard phases?

Thanks!