M.E-CSE with networks
Prepared by
S.Santhosh (Admin)
Important questions
share it a link alone
Don't waste my hardwork and valuable time
Don't share as screenshot kind request
most viewed dept will get update at first So Dont screenshot and share
Unit 1
- (BFS) Algorithm, (SCC) Algorithm, (WCC) Algorithm.
- Rank Exponent R. Out-Degree Exponent O. Hop Plot Exponent H. Eigen Exponent E.
- "Go with the Winners" Algorithm. HyperANF Algorithm.
- Clustering Coefficient and Degeneracy, Degree Assortativity. Login Correlation.
Unit 2
- Finding overlapping communities, similarity between graph nodes
- counting triangles in graphs, neighborhood properties of graphs.
- Pregel paradigm and Apache Giraph graph processing system.
Unit 3
- Game theoretic models for network creation/ user behavior in social networks
- Cascading behavior, spreading, epidemics, heterogeneous social network mining
- Contagion, opinion formation, coordination and cooperation.
Unit 5
- Crawling. Storage. Indexing. Ranking. Google. Data Structures.
- Web Spam Pages Strength of Weak Ties, Detecting Communities in a Network. Girvan-Newman Algorithm.
- Modularity. Minimum Cut Trees. exact Betweenness Centrality. Approximate Betweenness Centrality.
Unit 4
- Decision Based Models of Cascade. Collective Action. Cascade Capacity.
- Probabilistic Models of Cascade. Branching Process.
- SIR Epidemic Model. SIS Epidemic Model, Transient Contact Network. Cascading in Twitter.
Don't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
PART-C
1.Compulsory Questions {a case study where the student will have to read and analyse the subject }mostly asked from unit 2, 5(OR) a situation given and you have to answer on your own
Unit 1
- (BFS) Algorithm, (SCC) Algorithm, (WCC) Algorithm.
- Rank Exponent R. Out-Degree Exponent O. Hop Plot Exponent H. Eigen Exponent E.
- "Go with the Winners" Algorithm. HyperANF Algorithm.
- Clustering Coefficient and Degeneracy, Degree Assortativity. Login Correlation.
- Finding overlapping communities, similarity between graph nodes
- counting triangles in graphs, neighborhood properties of graphs.
- Pregel paradigm and Apache Giraph graph processing system.
Unit 3
- Game theoretic models for network creation/ user behavior in social networks
- Cascading behavior, spreading, epidemics, heterogeneous social network mining
- Contagion, opinion formation, coordination and cooperation.
Unit 5
- Crawling. Storage. Indexing. Ranking. Google. Data Structures.
- Web Spam Pages Strength of Weak Ties, Detecting Communities in a Network. Girvan-Newman Algorithm.
- Modularity. Minimum Cut Trees. exact Betweenness Centrality. Approximate Betweenness Centrality.
Unit 4
- Decision Based Models of Cascade. Collective Action. Cascade Capacity.
- Probabilistic Models of Cascade. Branching Process.
- SIR Epidemic Model. SIS Epidemic Model, Transient Contact Network. Cascading in Twitter.
Don't share as screenshot -Stuff sector
**Very important questions are bolded and may be asked based on this topic
don't waste my hardwork and valuable time
Contact uS for more updates
*These questions are expected for the exams This may or may not be asked for exams All the best.... from admin Santhosh
Thanks for your love and support guys keep supporting and share let the Engineers know about Us and leave a comment below for better improvements If there is any doubt feel free to ask me I will clear if I can or-else I will say some solutions ..get me through WhatsApp for instant updates ~$tuff$£ctorSYllabuS
_Syllabus_
UNIT I
GRAPH THEORY AND STRUCTURE
Breadth First Search (BFS) Algorithm. Strongly Connected Components (SCC) Algorithm. Weakly Connected Components (WCC) Algorithm. First Set of Experiments-Degree Distributions. Second Set of Experiments-Connected Components. Third Set of Experiments-Number of Breadth First Searches. Rank Exponent R. Out-Degree Exponent O. Hop Plot Exponent H. Eigen Exponent E. Permutation Model. Random Graphs with Prescribed Degree Sequences. Switching Algorithms. Matching Algorithm. "Go with the Winners" Algorithm. HyperANF Algorithm. Iterative Fringe Upper Bound (iFUB) Algorithm. Spid. Degree Distribution. Path Length. Component Size. Clustering Coefficient and Degeneracy. Friends-of-Friends. Degree Assortativity. Login Correlation.
UNIT II
SOCIAL NETWORK GRAPH ANALYSIS
Social network exploration/ processing and properties: Finding overlapping communities, similarity between graph nodes, counting triangles in graphs, neighborhood properties of graphs. Pregel paradigm and Apache Giraph graph processing system.
UNIT III
INFORMATION DIFFUSION IN SOCIAL NETWORKS
Strategic network formation: game theoretic models for network creation/ user behavior in social networks. Information diffusion in graphs: Cascading behavior, spreading, epidemics, heterogeneous social network mining, influence maximization, outbreak detection. Opinion analysis on social networks: Contagion, opinion formation, coordination and cooperation.
UNIT IV
CASCADING IN SOCIAL NETWORKS
Cascading in Social Networks. Decision Based Models of Cascade. Collective Action. Cascade Capacity. Co-existence of Behaviours. Cascade Capacity with Bilinguality. Probabilistic Models of Cascade. Branching Process. Basic Reproductive Number. SIR Epidemic Model. SIS Epidemic Model. SIRS Epidemic Model. Transient Contact Network. Cascading in Twitter.
UNIT V
LINK ANALYSIS & COMMUNITY DETECTION
Search Engine. Crawling. Storage. Indexing. Ranking. Google. Data Structures. Crawling. Searching. Web Spam Pages Strength of Weak Ties. Triadic Closure. Detecting Communities in a Network. Girvan-Newman Algorithm. Modularity. Minimum Cut Trees. Tie Strengths in Mobile Communication Network. Exact Betweenness Centrality. Approximate Betweenness Centrality.