Network Analysis Resources & Updates
3.05K subscribers
792 photos
163 files
1.11K links
Are you seeking assistance or eager to collaborate?
Don't hesitate to dispatch your insights, inquiries, proposals, promotions, bulletins, announcements, and more to our channel overseer. We're all ears!

Contact: @Questioner2
Download Telegram
🎞 Network models

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Barabasi-Albert model. Preferential attachement. Time evolition of node degrees. Node degree distribution. Average path length and clustering coefficient. Small world model. Watts-Strogats model. Transition from ragular to random. Clustering coefficient and ave path lenght.

πŸ“½ Watch

πŸ“‘ Lecture

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
πŸ‘1
🎞 Statistical analysis of networks

πŸ’₯Free recorded Lecture by Prof. Gesine Reinert in University of Oxford.

πŸ’₯Networks have become increasingly popular as representations of complex data. How can we make sense of such data? The first class will cover some network summaries and some parametric models for networks, while the second class concerns statistical inference using these network summaries as well as parametric models. We shall also cover some nonparametric ideas.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Network-Based Modeling of Complex Systems

πŸ’₯Free recorded Lecture by Dr. Fatena El-Masri from QuantCon 2018

πŸ’₯This talk, titled Network-based Modeling of Complex Systems, with Applications to Cascading and Contagion Events in Networks, looks at how network-based modeling can be used to analyze cascading and contagious events in financial networks. Dr. El-Masri’s research started with the simulation of 63 million records to determine the network and dynamic connectivity between different banks. This connectivity is determined by transforming the adjacency matrix for the data using Python. The agent-based model is then applied using dynamic modeling and validated using real data. The results are then implemented using network-based modeling for complex financial institutions to discover the cascading and contagious event behavior in the networks.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Node centrality and ranking on networks

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Node centrality metrics, degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. Katz status index. Directed graphs. PageRank, Perron-Frobenius theorem and algorithm convergence. Power iterations. Hubs and Authorites. HITS algorithm.

πŸ“½ Watch

πŸ“‘ Lecture

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture #centrality
πŸ‘1
🎞 Structural properties of networks

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Structural and regular equivalence. Similarity metrics. Correlation coefficient and cosine similarity. Assortative mixing and homophily. Modularity. Assortativity coefficient. Mixing by node degree. Assortative and disassortative networks. Cohesive subgroups. Graph cliques. k-cores decomposition.

πŸ“½ Watch

πŸ“‘ Lecture

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
πŸ‘1
🎞 Introduction to Brain Network Analysis

πŸ’₯Free recorded Lecture by Dr. Johann D. Kruschwitz.

πŸ’₯Graph Theoretical Modelling of Brain Connectivity.

πŸ“½ Watch: part1 part2

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture #Brain
🎞 Graph partitioning.

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Graph density. Graph pertitioning. Min cut, ratio cut, normalized and quotient cuts metrics. Spectral graph partitioning (normalized cut). Direct (spectral) modularity maximization. Multilevel recursive partitioning

πŸ“½ Watch

πŸ“‘ Lecture

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Network communities.

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Network communities. Edge Betweenness. Newman-Girvin algorithm. Community detection algorithms. Overlapping communities. Clique percolation method. Heuristic methods. Fast community unfolding. Random walk based methods. Walktrap.

πŸ“½ Watch

πŸ“‘ Lecture

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Epidemics on networks

πŸ’₯Free recorded Lecture by Prof. Leonid Zhukov, Ilya Makarov.

πŸ’₯Spread of epidemics on network. SI, SIS, SIR network models. Epidemic threshold. Simulations of infection propagation on networks

πŸ“½ Watch: part1 part2

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Graph Mining

πŸ’₯Free recorded Lecture

πŸ’₯Graph Mining is the set of tools and techniques used to analyze the properties of real-world graphs, predict how the structure and properties of a given graph might affect some application, develop models that can generate realistic graphs that match the patterns found in real-world graphs of interest etc

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Using NetLogo: Complex Problem Solving in Networks

πŸ’₯Free recorded Lecture

πŸ’₯How do revolutions emerge without anyone expecting them? How did social norms about same sex marriage change more rapidly than anyone anticipated? Why do some social innovations take off with relative ease, while others struggle for years without spreading? More generally, what are the forces that control the process of social evolution –from the fashions that we wear, to our beliefs about religious tolerance, to our ideas about the process of scientific discovery and the best ways to manage complex research organizations? The social world is complex and full of surprises. Our experiences and intuitions about the social world as individuals are often quite different from the behaviors that we observe emerging in large societies. Even minor changes to the structure of a social network - changes that are unobservable to individuals within those networks - can lead to radical shifts in the spread of new ideas and behaviors through a population. These β€œinvisible” mathematical properties of social networks have powerful implications for the ways that teams solve problems, the social norms that are likely to emerge, and even the very future of our society. This course condenses the last decade of cutting-edge research on these topics into six modules. Each module provides an in-depth look at a particular research puzzle -with a focus on agent-based models and network theories of social change -and provides an interactive computational model for you try out and to use for making your own explorations! Learning objectives - after this course, students will be able to... - explain how computer models are used to study challenging social problems - describe how networks are used to represent the structure of social relationships - show how individual actions can lead to unintended collective behaviors - provide concrete examples of how social networks can influence social change - discuss how diffusion processes can explain the growth social movements, changes in cultural norms, and the success of team problem solving

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture #NetLogo
🎞 Introduction to Graph Computing

πŸ’₯Free recorded Lecture by Prof. Yadong Li

πŸ’₯Graph computing is an innovative technology that allows developers to build applications and systems as directed acyclic graphs (DAGs). Graph computing offers generic solutions to some of the most fundamental challenges in enterprise computing such as scalability, transparency and lineage. In this workshop, we survey the available graph computing tools in Julia, then walk through a few hands-on examples of building real world applications and systems using graph computing.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture #GraphComputing
🎞 Modeling epidemics on complex networks

πŸ’₯Free recorded Lecture in Department of Computer Science IIL Ropar

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Complex Networks, Simple Rules

πŸ’₯Free recorded Lecture

πŸ’₯Complex networks are all around us, and they can be generated by simple mechanisms. Understanding what kinds of networks can be produced by following simple rules is therefore of great importance. We investigate this issue by studying the dynamics of extremely simple systems where are `writer' moves around a network, and modifies it in a way that depends upon the writer's surroundings. Each vertex in the network has three edges incident upon it, which are colored red, blue and green.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Complex networks of time-series: what does it reveal more than local interactions?

πŸ’₯Free recorded Lecture by Amirhossein Shirazi, IFISC (UIB-CSIC)

πŸ’₯There is a huge literature about extracting the interaction network of these systems in molecular biology, neuroscience and economy. Although this approach invigorates these disciplines to deal with large data, it usually focuses on microscopic results. In this presentation, I will suggest some holistic approaches towards the analysis of these networks, based on two examples: medical words network evolution and stock market network near the crisis. Finally, I will try to connect the measured global indicators to dynamics of the system, using the idea of symmetry breaking in the spin glass models.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 The Structure of Complex Networks: Scale-Free and Small-World Random Graphs

πŸ’₯Free recorded Lecture by Remco van der Hofstad

πŸ’₯In this
lecture for a broad audience, we describe a few real-world networks and some of their empirical properties. We also describe the effectiveness of abstract network modeling in terms of graphs and how real-world networks can be modeled, as well as how these models help us to give sense to the empirical findings. We continue by discussing some random graph models for real-world networks and their properties, as well as their merits and flaws as network models. We conclude by discussing the implications of some of the empirical findings on information diffusion and competition on such networks.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture
🎞 Graph-Powered Machine Learning

πŸ’₯Free recorded Lecture

πŸ’₯Many powerful Machine Learning algorithms are based on graphs, e.g., Page Rank (Pregel), Recommendation Engines (collaborative filtering), text summarization, and other NLP tasks. Also, the recent developments with Graph Neural Networks connect the worlds of Graphs and Machine Learning even further.
Considering data pre-processing and feature engineering which are both vital tasks in Machine Learning Pipelines extends this relationship across the entire ecosystem. In this session, we will investigate the entire range of Graphs and Machine Learning with many practical exercises.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #Lecture #Machine_Learning
🎞 Network theory questions

πŸ’₯Free recorded lectures.

πŸ’₯Complete lectures on network analysis.

πŸ“½ Watch

πŸ“²Channel: @ComplexNetworkAnalysis

#video #lecture #Graph #Network