π 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
π₯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
YouTube
Lecture 4. Network models.
Network Science 2021 @ HSE
http://www.leonidzhukov.net/hse/2021/networks/
http://www.leonidzhukov.net/hse/2021/networks/
π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
π₯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
YouTube
Statistical analysis of networks - Professor Gesine Reinert, 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β¦
π 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
π₯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
YouTube
Network-Based Modeling of Complex Systems 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β¦
π 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
π₯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
YouTube
Lecture 5. Node centrality and ranking on networks.
Network Science 2021 @ HSE
http://www.leonidzhukov.net/hse/2021/networks/
http://www.leonidzhukov.net/hse/2021/networks/
π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
π₯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
YouTube
Lecture 6. Structural properties of networks
Network Science 2021 @ HSE
http://www.leonidzhukov.net/hse/2021/networks/
http://www.leonidzhukov.net/hse/2021/networks/
π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
π₯Free recorded Lecture by Dr. Johann D. Kruschwitz.
π₯Graph Theoretical Modelling of Brain Connectivity.
π½ Watch: part1 part2
π²Channel: @ComplexNetworkAnalysis
#video #Lecture #Brain
YouTube
Introduction to Brain Network Analysis - Part 1/2.
Introduction to Brain Network Analysis - Part 1/2. Graph Theoretical Modelling of Brain Connectivity. Concepts and Workflow. GraphVar by Dr. Johann D. Kruschwitz.
π 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
π₯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
YouTube
Lecture 7. Graph partitioning algorithms.
Network Science 2021 @ HSE
http://www.leonidzhukov.net/hse/2021/networks/
http://www.leonidzhukov.net/hse/2021/networks/
π 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
π₯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
YouTube
Lecture8. Community detection
Network Science 2021 @ HSE
π 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
π₯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
YouTube
Lecture9. Epidemics on networks I
Network Science 2021 @ HSE
π 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
π₯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
YouTube
Graph Mining
Graph Mining, Used Applications, Methods for finding frequent sub graph and Apriori based approach are included.
Graph Mining is the set of tools and techniques used to analyze the properties of real-world graphs, predict how the structure and propertiesβ¦
Graph Mining is the set of tools and techniques used to analyze the properties of real-world graphs, predict how the structure and propertiesβ¦
π 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
π₯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
Coursera
6.5 Using NetLogo: Complex Problem Solving in Networks - Problem Solving in Networks | Coursera
Video created by University of Pennsylvania for the ...
π 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
π₯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
YouTube
Introduction to Graph Computing | JuliaCon 2022 | 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β¦
π Modeling epidemics on complex networks
π₯Free recorded Lecture in Department of Computer Science IIL Ropar
π½ Watch
π²Channel: @ComplexNetworkAnalysis
#video #Lecture
π₯Free recorded Lecture in Department of Computer Science IIL Ropar
π½ Watch
π²Channel: @ComplexNetworkAnalysis
#video #Lecture
YouTube
Modeling epidemics on complex networks
π Multi-agent models in complex networks
π₯Free recorded Lecture by Pablo Balenzuela (University of Buenos Aires, Argentina)
π½ Watch: part1 part2 part3 part4
π²Channel: @ComplexNetworkAnalysis
#video #Lecture
π₯Free recorded Lecture by Pablo Balenzuela (University of Buenos Aires, Argentina)
π½ Watch: part1 part2 part3 part4
π²Channel: @ComplexNetworkAnalysis
#video #Lecture
YouTube
Multi-agent models in complex networks (1 o 4)
Preparatory School for StatPhys 2019
July 1-5, 2019
Introduction to nonlinear dynamics
Speaker:
Pablo Balenzuela (University of Buenos Aires, Argentina)
More informations: https://www.ictp-saifr.org/preparatory-school-for-statphys-2019/
July 1-5, 2019
Introduction to nonlinear dynamics
Speaker:
Pablo Balenzuela (University of Buenos Aires, Argentina)
More informations: https://www.ictp-saifr.org/preparatory-school-for-statphys-2019/
π2
π 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
π₯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
π₯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
YouTube
Complex networks of time-series: what does it reveal more than local interactions?
- By: Amirhossein Shirazi, IFISC (UIB-CSIC)
- Date: 2015-09-24 14:30:00
- Description: In many complex systems, the only observable variables are the time-series and event-series of their components. There is a huge literature about extracting the interactionβ¦
- Date: 2015-09-24 14:30:00
- Description: In many complex systems, the only observable variables are the time-series and event-series of their components. There is a huge literature about extracting the interactionβ¦
π 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
π₯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
YouTube
Remco van der Hofstad - The Structure of Complex Networks: Scale-Free and Small-World Random Graphs
Abstract:
Many phenomena in the real world can be phrased in terms of networks. Examples include the World-Wide Web, social interactions and Internet, but also the interaction patterns between proteins, food webs and citation networks.
Many large-scale networksβ¦
Many phenomena in the real world can be phrased in terms of networks. Examples include the World-Wide Web, social interactions and Internet, but also the interaction patterns between proteins, food webs and citation networks.
Many large-scale networksβ¦
π 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
π₯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
YouTube
Graph-Powered Machine Learning
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β¦
π Network Analysis
π₯Free recorded lectures
πΉ(1) Theory and Concept
πΉ(2) Practice Using igraph and Gephi
π½ Watch: part1 part2
π²Channel: @ComplexNetworkAnalysis
#video #lecture #Gephi #igraph
π₯Free recorded lectures
πΉ(1) Theory and Concept
πΉ(2) Practice Using igraph and Gephi
π½ Watch: part1 part2
π²Channel: @ComplexNetworkAnalysis
#video #lecture #Gephi #igraph
YouTube
Network Analysis (1) Theory and Concept
This video is for the Network analysis and visualization workshop organized at the Virtual Annual Conference of Comparative and International Education Society 2020 (vCIES 2020) in April 2020.
This lecture is designed for beginners to learn from conceptβ¦
This lecture is designed for beginners to learn from conceptβ¦
π3π1