The organization of constituent network layers to multiplex networks has recently attracted a lot of attention. Here, we show empirical evidence for the existence of relations between the layers of real multiplex networks that go beyond degree correlations. These relations consist of correlations in hidden metric spaces that underlie the observed topology. We discuss the impact and applications of these relations for trans-layer link prediction, community detection, navigation, game theory, and especially for the robustness of multiplex networks against random failures and targeted attacks. We show that these relations lead to fundamentally new behaviors, which emphasizes the importance to consider organizational principles of multiplex networks beyond degree correlations in future research.
(Digital) networks and the science of complex systemsKolja Kleineberg
The document discusses complex systems and networks, focusing on digital networks. It describes how network models can help understand complex systems like the internet and financial networks. Digital networks have significant power to influence behaviors and spread information. While this power in a single network could be problematic, models show how diversity across multiple competing networks can allow for coexistence, though this is fragile. Sustaining diversity requires balancing viral and mass media influences.
Hidden geometric correlations in real multiplex networksKolja Kleineberg
Read the paper at http://www.nature.com/nphys/journal/vaop/ncurrent/full/nphys3812.html
Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are not random combinations of single network layers. Instead, they are organized in specific ways dictated by hidden geometric correlations between the layers. We find that these correlations are significant in different real multiplexes, and form a key framework for answering many important questions. Specifically, we show that these geometric correlations facilitate the definition and detection of multidimensional communities, which are sets of nodes that are simultaneously similar in multiple layers. They also enable accurate trans-layer link prediction, meaning that connections in one layer can be predicted by observing the hidden geometric space of another layer. And they allow efficient targeted navigation in the multilayer system using only local knowledge, outperforming navigation in the single layers only if the geometric correlations are sufficiently strong.
Collective navigation of complex networks: Participatory greedy routingKolja Kleineberg
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.
Geometric correlations in multiplexes and how they make them more robustKolja Kleineberg
This document discusses research on the structure and dynamics of multiplex networks. It begins by introducing the concept of multiplex networks, which have the same nodes existing across different network layers. It then discusses how degree correlations and geometric correlations between the positions of nodes in the hidden metric spaces underlying different network layers have been found in real multiplex systems. The document explores how these geometric correlations allow for applications like better identifying communities of nodes, improved link prediction between layers, and more efficient navigation across the network layers.
Is bigger always better? How local online social networks can outperform glob...Kolja Kleineberg
The overwhelming success of online social networks, the key actors in the cosmos of the Web
2.0, has reshaped human interactions on a worldwide scale. To help understand the fundamental
mechanisms which determine the fate of online social networks at the system level, we describe the
digital world as a complex ecosystem of interacting networks. In this paper, we discuss the impact
of heterogeneity in network fitnesses induced by competition between an international network,
such as Facebook, and local services.To this end, we construct a 1:1000 scale model of the digital
world, consisting of the 80 countries with the most Internet users. We show how inter-country social
ties induce increased fitness of the international network. Under certain conditions, this leads to
the extinction of local networks; whereas under different conditions, local networks can persist and
even dominate the international network completely. These findings provide new insights into the
possibilities for preserving digital diversity.
Towards a democratic, scalable, and sustainable digital futureKolja Kleineberg
The document discusses the need for a democratic, scalable, and sustainable digital future. It suggests that digital diversity is possible but fragile. Research shows that routing performance can be improved by using multiple networks simultaneously if they exhibit geometric correlations between node coordinates. Incentives like "Social Bitcoin" could sustain a diverse, decentralized digital world by rewarding users for routing information. The goal is for self-organization of the digital world to create a desirable future with robust digital diversity and efficient search/navigation.
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics Kolja Kleineberg
The document summarizes research on the hidden geometry of multiplex networks. It finds that real-world multiplex networks often have correlated geometric properties between network layers, with nodes maintaining similar radial and angular coordinates. This has implications like communities of nodes being similar across layers and hyperbolic distance in one layer predicting connections in another. A geometric multiplex model is introduced to generate realistic multiplex networks with tunable geometric correlations between layers.
Spatial patterns in evolutionary games on scale-free networks and multiplexesKolja Kleineberg
The document discusses evolutionary games on scale-free networks and multiplexes. It finds that cooperation can be sustained in metric clusters that form on scale-free networks. These metric clusters shield cooperators from surrounding defectors similar to spatial selection. The survival of metric clusters is favored when the network is less heterogeneous, has a higher clustering coefficient, and the clusters are larger. Similar clusters are also found for different games played on correlated multiplex networks.
(Digital) networks and the science of complex systemsKolja Kleineberg
The document discusses complex systems and networks, focusing on digital networks. It describes how network models can help understand complex systems like the internet and financial networks. Digital networks have significant power to influence behaviors and spread information. While this power in a single network could be problematic, models show how diversity across multiple competing networks can allow for coexistence, though this is fragile. Sustaining diversity requires balancing viral and mass media influences.
Hidden geometric correlations in real multiplex networksKolja Kleineberg
Read the paper at http://www.nature.com/nphys/journal/vaop/ncurrent/full/nphys3812.html
Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are not random combinations of single network layers. Instead, they are organized in specific ways dictated by hidden geometric correlations between the layers. We find that these correlations are significant in different real multiplexes, and form a key framework for answering many important questions. Specifically, we show that these geometric correlations facilitate the definition and detection of multidimensional communities, which are sets of nodes that are simultaneously similar in multiple layers. They also enable accurate trans-layer link prediction, meaning that connections in one layer can be predicted by observing the hidden geometric space of another layer. And they allow efficient targeted navigation in the multilayer system using only local knowledge, outperforming navigation in the single layers only if the geometric correlations are sufficiently strong.
Collective navigation of complex networks: Participatory greedy routingKolja Kleineberg
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.
Geometric correlations in multiplexes and how they make them more robustKolja Kleineberg
This document discusses research on the structure and dynamics of multiplex networks. It begins by introducing the concept of multiplex networks, which have the same nodes existing across different network layers. It then discusses how degree correlations and geometric correlations between the positions of nodes in the hidden metric spaces underlying different network layers have been found in real multiplex systems. The document explores how these geometric correlations allow for applications like better identifying communities of nodes, improved link prediction between layers, and more efficient navigation across the network layers.
Is bigger always better? How local online social networks can outperform glob...Kolja Kleineberg
The overwhelming success of online social networks, the key actors in the cosmos of the Web
2.0, has reshaped human interactions on a worldwide scale. To help understand the fundamental
mechanisms which determine the fate of online social networks at the system level, we describe the
digital world as a complex ecosystem of interacting networks. In this paper, we discuss the impact
of heterogeneity in network fitnesses induced by competition between an international network,
such as Facebook, and local services.To this end, we construct a 1:1000 scale model of the digital
world, consisting of the 80 countries with the most Internet users. We show how inter-country social
ties induce increased fitness of the international network. Under certain conditions, this leads to
the extinction of local networks; whereas under different conditions, local networks can persist and
even dominate the international network completely. These findings provide new insights into the
possibilities for preserving digital diversity.
Towards a democratic, scalable, and sustainable digital futureKolja Kleineberg
The document discusses the need for a democratic, scalable, and sustainable digital future. It suggests that digital diversity is possible but fragile. Research shows that routing performance can be improved by using multiple networks simultaneously if they exhibit geometric correlations between node coordinates. Incentives like "Social Bitcoin" could sustain a diverse, decentralized digital world by rewarding users for routing information. The goal is for self-organization of the digital world to create a desirable future with robust digital diversity and efficient search/navigation.
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics Kolja Kleineberg
The document summarizes research on the hidden geometry of multiplex networks. It finds that real-world multiplex networks often have correlated geometric properties between network layers, with nodes maintaining similar radial and angular coordinates. This has implications like communities of nodes being similar across layers and hyperbolic distance in one layer predicting connections in another. A geometric multiplex model is introduced to generate realistic multiplex networks with tunable geometric correlations between layers.
Spatial patterns in evolutionary games on scale-free networks and multiplexesKolja Kleineberg
The document discusses evolutionary games on scale-free networks and multiplexes. It finds that cooperation can be sustained in metric clusters that form on scale-free networks. These metric clusters shield cooperators from surrounding defectors similar to spatial selection. The survival of metric clusters is favored when the network is less heterogeneous, has a higher clustering coefficient, and the clusters are larger. Similar clusters are also found for different games played on correlated multiplex networks.
Geometric correlations mitigate the extreme vulnerability of multiplex networ...Kolja Kleineberg
The document discusses how geometric correlations between layers in multiplex networks can mitigate their vulnerability to targeted attacks. It finds that while degree correlations provide some robustness to random failures, they do not prevent catastrophic cascades under targeted attacks. However, geometric or similarity correlations, which place similar nodes close together in an underlying metric space representing each layer, can significantly increase robustness to targeted attacks. This effect is demonstrated through a model incorporating such correlations, as well as analyses of real-world multiplex networks that exhibit stronger geometric correlations.
Towards controlling evolutionary dynamics through network geometry: some very...Kolja Kleineberg
The document discusses how network geometry can control evolutionary dynamics through the formation of cooperating clusters. It presents examples showing how the placement of initial cooperators in metric space clusters versus randomly can influence whether cooperation emerges in evolutionary games and navigation processes on networks. The author suggests that network geometry may allow active control of evolutionary dynamics by strategically placing control agents based on the underlying geometry.
Interplay between social influence and competitive strategical games in multi...Kolja Kleineberg
The document discusses the interplay between social influence and competitive strategic games on multiplex networks. It shows that an opinion dynamics model with pro-cooperation bias can transform a prisoner's dilemma game into a snowdrift game. Considering multiplex topology is important, as correlations between network layers can have an even bigger impact on cooperation than individual layer topologies alone. When similarity correlations are present between layers, cooperative clusters can form across both layers through self-organization.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
This document summarizes two presentations about community detection in social media networks. The first presentation discusses using edge content, like image tags, to help identify communities in networks. The second focuses on leveraging interaction intensities on Twitter to detect communities that form around certain events over time. Both aim to improve on traditional methods that only consider network structure.
Distribution of maximal clique size of theIJCNCJournal
Our primary objective in this paper is to study the distribution of the maximal clique size of the vertices in complex networks. We define the maximal clique size for a vertex as the maximum size of the clique that the vertex is part of and such a clique need not be the maximum size clique for the entire network. We determine the maximal clique size of the vertices using a modified version of a branch-and-bound based exact algorithm that has been originally proposed to determine the maximum size clique for an entire network graph. We then run this algorithm on two categories of complex networks: One category of networks capture the evolution of small-world networks from regular network (according to the well-known Watts-Strogatz model) and their subsequent evolution to random networks; we show that the distribution of
the maximal clique size of the vertices follows a Poisson-style distribution at different stages of the evolution of the small-world network to a random network; on the other hand, the maximal clique size of the vertices is observed to be in-variant and to be very close to that of the maximum clique size for the entire network graph as the regular network is transformed to a small-world network. The second category
of complex networks studied are real-world networks (ranging from random networks to scale-free networks) and we observe the maximal clique size of the vertices in five of the six real-world networks to follow a Poisson-style distribution. In addition to the above case studies, we also analyze the correlation between the maximal clique size and clustering coefficient as well as analyze the assortativity index of the
vertices with respect to maximal clique size and node degree.
This document discusses network science and graph theory. It begins by introducing the Human Disease Network, which connects diseases that share a common genetic origin. It then crossed disciplinary boundaries and was featured in various publications and exhibitions. The rest of the document discusses network representations as graphs, using the example of the Bridges of Königsberg problem solved by Euler in 1735. It introduces basic graph concepts like nodes, links, directed and undirected networks, and discusses how different systems can be represented by the same graph structure.
Clustering Methods and Community Detection with NetworkX. A slide deck for the NTU Complexity Science Winter School.
For the accompanying iPython Notebook, visit: http://github.com/eflegara/NetStruc
LCF is a temporal approach to link prediction in dynamic social networks. It proposes a new predictor called Latest Common Friend (LCF) that incorporates temporal aspects. Social networks are modeled as sequences of snapshots over time periods. Each edge is assigned a weight based on timestamp. LCF score for node pairs is the cumulative weight of their common friends, giving more weight to friends with later timestamps. LCF outperforms traditional predictors like Common Neighbor, Adamic-Adar and Jaccard coefficient on 8 real-world dynamic network datasets based on average AUC scores. Modeling networks temporally and weighting edges by timestamp allows LCF to better predict future links in dynamic social networks.
This document proposes a model for designing robust transportation networks that considers intelligent adversaries. It formulates the problem as a bi-objective game theoretic model involving three decision makers: the network designer, users, and adversary. The designer aims to minimize total system cost and vulnerability by investing in link capacity expansion. The adversary aims to maximize damage by disabling links. Users route choices are modeled at equilibrium. The model is formulated as a bi-level program where the designer and adversary make upper level decisions, and users make lower level routing choices based on the network state. The goal is to find solutions that minimize total system cost under normal and degraded network conditions considering the strategic decisions of all players.
Community detection algorithms are used to identify densely connected groups of nodes in networks. Modularity optimization is commonly used, which detects communities as groups of nodes with more connections within groups than expected by chance. Parameters like resolution affect results. Multilayer networks model systems with multiple network layers over nodes. Multilayer modularity generalizes modularity to multilayer networks. Community detection in multilayer networks provides insights into structures across data types and applications.
1. Basics of Social Networks
2. Real-world problem
3. How to construct graph from real-world problem?
4. What graph theory problem getting from real-world problem?
5. Graph type of Social Networks
6. Special properties in social graph
7. How to find communities and groups in social networks? (Algorithms)
8. How to interpret graph solution back to real-world problem?
Community detection from research papers (AAN dataset) using the algorithms:
K-Means
Louvain
Newman-Girvan
github link to code: https://goo.gl/CXej44
github link to project web page: http://goo.gl/7OOkhI
youtube link to video:https://goo.gl/SCpamf
dropbox link to ppt report video: https://goo.gl/cgACzU
Community Detection in Social Networks: A Brief OverviewSatyaki Sikdar
The document provides an overview of community detection in social networks. It discusses that networks are found everywhere where there are interactions between actors. It then motivates the importance of detecting communities by explaining that communities are groups of nodes that likely share properties and roles. Detecting communities has applications like improving recommendation systems and parallel computing. It also justifies the existence of communities in real networks using the concept of homophily where similar actors tend to connect. The document then discusses different approaches to detecting communities including Girvan-Newman algorithm based on edge betweenness and Louvain method which uses greedy modularity optimization.
Representation Learning on Graphs with Complex Structures
Invited talk, Deep Learning for Graphs and Structured Data Embedding Workshop
WWW2019, San Francisco, May 13, 2019
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
Interpretation of the biological knowledge using networks approachElena Sügis
This document discusses using biological networks to analyze and interpret biological knowledge. It begins with an overview of networks as tools to reduce complexity and integrate data. Key properties of networks are described, including nodes, edges, degree distribution, clustering coefficient, and centrality measures. Methods for analyzing networks like community detection and network motifs are also covered. The document emphasizes that biological networks must be analyzed and interpreted based on their properties and by mapping relevant biological data to provide meaningful insights.
The document compares DeepWalk and Node2Vec network embedding algorithms. DeepWalk learns representations by treating random walks as sentences, but cannot capture mixtures of homophily and structural equivalence. Node2Vec addresses this by introducing parameters p and q to control the walk's behavior between BFS and DFS, allowing it to explore neighborhoods more flexibly. The algorithm samples multiple random walks per node and learns embeddings by predicting contexts within those walks using Skip-Gram.
The document discusses N-gram graphs, which represent the proximity or co-occurrence of items in a text by modeling them as a graph. An N-gram graph is constructed by extracting n-grams from a text, determining their neighborhood based on a window size, and assigning edge weights based on co-occurrence frequencies. The document outlines the process for constructing N-gram graphs and describes their potential uses, including representing sets of items with a single graph, comparing graphs through clustering, and defining similarity measures between graphs. N-gram graphs aim to capture proximity information in a way that is domain-agnostic, allows different analysis levels, and can represent multiple texts with a single graph structure.
Massive parallelism with gpus for centrality ranking in complex networksijcsit
Many problems in Computer Science can be modelled using graphs. Evaluating node centrality in complex
networks, which can be considered equivalent to undirected graphs, provides an useful metric of the
relative importance of each node inside the evaluated network. The knowledge on which the most central
nodes are, has various applications, such as improving information spreading in diffusion networks. In this
case, most central nodes can be considered to have higher influence rates over other nodes in the network.
The main purpose in this work is developing a GPU based and massively parallel application so as to
evaluate the node centrality in complex networks using the Nvidia CUDA programming model. The main
contribution of this work is the strategies for the development of an algorithm to evaluate the node
centrality in complex networks using Nvidia CUDA parallel programming model. We show that the
strategies improves algorithm´s speed-up in two orders of magnitude on one NVIDIA Tesla k20 GPU
cluster node, when compared to the hybrid OpenMP/MPI algorithm version, running in the same cluster,
with 4 nodes 2 Intel(R) Xeon(R) CPU E5-2660 each, for radius zero
Geometric correlations mitigate the extreme vulnerability of multiplex networ...Kolja Kleineberg
The document discusses how geometric correlations between layers in multiplex networks can mitigate their vulnerability to targeted attacks. It finds that while degree correlations provide some robustness to random failures, they do not prevent catastrophic cascades under targeted attacks. However, geometric or similarity correlations, which place similar nodes close together in an underlying metric space representing each layer, can significantly increase robustness to targeted attacks. This effect is demonstrated through a model incorporating such correlations, as well as analyses of real-world multiplex networks that exhibit stronger geometric correlations.
Towards controlling evolutionary dynamics through network geometry: some very...Kolja Kleineberg
The document discusses how network geometry can control evolutionary dynamics through the formation of cooperating clusters. It presents examples showing how the placement of initial cooperators in metric space clusters versus randomly can influence whether cooperation emerges in evolutionary games and navigation processes on networks. The author suggests that network geometry may allow active control of evolutionary dynamics by strategically placing control agents based on the underlying geometry.
Interplay between social influence and competitive strategical games in multi...Kolja Kleineberg
The document discusses the interplay between social influence and competitive strategic games on multiplex networks. It shows that an opinion dynamics model with pro-cooperation bias can transform a prisoner's dilemma game into a snowdrift game. Considering multiplex topology is important, as correlations between network layers can have an even bigger impact on cooperation than individual layer topologies alone. When similarity correlations are present between layers, cooperative clusters can form across both layers through self-organization.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
This document summarizes two presentations about community detection in social media networks. The first presentation discusses using edge content, like image tags, to help identify communities in networks. The second focuses on leveraging interaction intensities on Twitter to detect communities that form around certain events over time. Both aim to improve on traditional methods that only consider network structure.
Distribution of maximal clique size of theIJCNCJournal
Our primary objective in this paper is to study the distribution of the maximal clique size of the vertices in complex networks. We define the maximal clique size for a vertex as the maximum size of the clique that the vertex is part of and such a clique need not be the maximum size clique for the entire network. We determine the maximal clique size of the vertices using a modified version of a branch-and-bound based exact algorithm that has been originally proposed to determine the maximum size clique for an entire network graph. We then run this algorithm on two categories of complex networks: One category of networks capture the evolution of small-world networks from regular network (according to the well-known Watts-Strogatz model) and their subsequent evolution to random networks; we show that the distribution of
the maximal clique size of the vertices follows a Poisson-style distribution at different stages of the evolution of the small-world network to a random network; on the other hand, the maximal clique size of the vertices is observed to be in-variant and to be very close to that of the maximum clique size for the entire network graph as the regular network is transformed to a small-world network. The second category
of complex networks studied are real-world networks (ranging from random networks to scale-free networks) and we observe the maximal clique size of the vertices in five of the six real-world networks to follow a Poisson-style distribution. In addition to the above case studies, we also analyze the correlation between the maximal clique size and clustering coefficient as well as analyze the assortativity index of the
vertices with respect to maximal clique size and node degree.
This document discusses network science and graph theory. It begins by introducing the Human Disease Network, which connects diseases that share a common genetic origin. It then crossed disciplinary boundaries and was featured in various publications and exhibitions. The rest of the document discusses network representations as graphs, using the example of the Bridges of Königsberg problem solved by Euler in 1735. It introduces basic graph concepts like nodes, links, directed and undirected networks, and discusses how different systems can be represented by the same graph structure.
Clustering Methods and Community Detection with NetworkX. A slide deck for the NTU Complexity Science Winter School.
For the accompanying iPython Notebook, visit: http://github.com/eflegara/NetStruc
LCF is a temporal approach to link prediction in dynamic social networks. It proposes a new predictor called Latest Common Friend (LCF) that incorporates temporal aspects. Social networks are modeled as sequences of snapshots over time periods. Each edge is assigned a weight based on timestamp. LCF score for node pairs is the cumulative weight of their common friends, giving more weight to friends with later timestamps. LCF outperforms traditional predictors like Common Neighbor, Adamic-Adar and Jaccard coefficient on 8 real-world dynamic network datasets based on average AUC scores. Modeling networks temporally and weighting edges by timestamp allows LCF to better predict future links in dynamic social networks.
This document proposes a model for designing robust transportation networks that considers intelligent adversaries. It formulates the problem as a bi-objective game theoretic model involving three decision makers: the network designer, users, and adversary. The designer aims to minimize total system cost and vulnerability by investing in link capacity expansion. The adversary aims to maximize damage by disabling links. Users route choices are modeled at equilibrium. The model is formulated as a bi-level program where the designer and adversary make upper level decisions, and users make lower level routing choices based on the network state. The goal is to find solutions that minimize total system cost under normal and degraded network conditions considering the strategic decisions of all players.
Community detection algorithms are used to identify densely connected groups of nodes in networks. Modularity optimization is commonly used, which detects communities as groups of nodes with more connections within groups than expected by chance. Parameters like resolution affect results. Multilayer networks model systems with multiple network layers over nodes. Multilayer modularity generalizes modularity to multilayer networks. Community detection in multilayer networks provides insights into structures across data types and applications.
1. Basics of Social Networks
2. Real-world problem
3. How to construct graph from real-world problem?
4. What graph theory problem getting from real-world problem?
5. Graph type of Social Networks
6. Special properties in social graph
7. How to find communities and groups in social networks? (Algorithms)
8. How to interpret graph solution back to real-world problem?
Community detection from research papers (AAN dataset) using the algorithms:
K-Means
Louvain
Newman-Girvan
github link to code: https://goo.gl/CXej44
github link to project web page: http://goo.gl/7OOkhI
youtube link to video:https://goo.gl/SCpamf
dropbox link to ppt report video: https://goo.gl/cgACzU
Community Detection in Social Networks: A Brief OverviewSatyaki Sikdar
The document provides an overview of community detection in social networks. It discusses that networks are found everywhere where there are interactions between actors. It then motivates the importance of detecting communities by explaining that communities are groups of nodes that likely share properties and roles. Detecting communities has applications like improving recommendation systems and parallel computing. It also justifies the existence of communities in real networks using the concept of homophily where similar actors tend to connect. The document then discusses different approaches to detecting communities including Girvan-Newman algorithm based on edge betweenness and Louvain method which uses greedy modularity optimization.
Representation Learning on Graphs with Complex Structures
Invited talk, Deep Learning for Graphs and Structured Data Embedding Workshop
WWW2019, San Francisco, May 13, 2019
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
Interpretation of the biological knowledge using networks approachElena Sügis
This document discusses using biological networks to analyze and interpret biological knowledge. It begins with an overview of networks as tools to reduce complexity and integrate data. Key properties of networks are described, including nodes, edges, degree distribution, clustering coefficient, and centrality measures. Methods for analyzing networks like community detection and network motifs are also covered. The document emphasizes that biological networks must be analyzed and interpreted based on their properties and by mapping relevant biological data to provide meaningful insights.
The document compares DeepWalk and Node2Vec network embedding algorithms. DeepWalk learns representations by treating random walks as sentences, but cannot capture mixtures of homophily and structural equivalence. Node2Vec addresses this by introducing parameters p and q to control the walk's behavior between BFS and DFS, allowing it to explore neighborhoods more flexibly. The algorithm samples multiple random walks per node and learns embeddings by predicting contexts within those walks using Skip-Gram.
The document discusses N-gram graphs, which represent the proximity or co-occurrence of items in a text by modeling them as a graph. An N-gram graph is constructed by extracting n-grams from a text, determining their neighborhood based on a window size, and assigning edge weights based on co-occurrence frequencies. The document outlines the process for constructing N-gram graphs and describes their potential uses, including representing sets of items with a single graph, comparing graphs through clustering, and defining similarity measures between graphs. N-gram graphs aim to capture proximity information in a way that is domain-agnostic, allows different analysis levels, and can represent multiple texts with a single graph structure.
Massive parallelism with gpus for centrality ranking in complex networksijcsit
Many problems in Computer Science can be modelled using graphs. Evaluating node centrality in complex
networks, which can be considered equivalent to undirected graphs, provides an useful metric of the
relative importance of each node inside the evaluated network. The knowledge on which the most central
nodes are, has various applications, such as improving information spreading in diffusion networks. In this
case, most central nodes can be considered to have higher influence rates over other nodes in the network.
The main purpose in this work is developing a GPU based and massively parallel application so as to
evaluate the node centrality in complex networks using the Nvidia CUDA programming model. The main
contribution of this work is the strategies for the development of an algorithm to evaluate the node
centrality in complex networks using Nvidia CUDA parallel programming model. We show that the
strategies improves algorithm´s speed-up in two orders of magnitude on one NVIDIA Tesla k20 GPU
cluster node, when compared to the hybrid OpenMP/MPI algorithm version, running in the same cluster,
with 4 nodes 2 Intel(R) Xeon(R) CPU E5-2660 each, for radius zero
Centrality Prediction in Mobile Social NetworksIJERA Editor
By analyzing evolving centrality roles using time dependent graphs, researchers may predict future centrality values. This may prove invaluable in designing efficient routing and energy saving strategies and have profound implications on evolving social behavior in dynamic social networks. In this paper, we propose a new method to predict centrality values of nodes in a dynamic environment. The proposed method is based on calculating the correlation between current and past measure of centrality for each corresponding node, which is used to form a composite vector to represent the given state of centralities. The performance of the proposed method is evaluated through simulated predictions on data sets from real mobile networks. Results indicate significantly low prediction error rate occurs, with a suitable implementation of the proposed method.
240401_JW_labseminar[LINE: Large-scale Information Network Embeddin].pptxthanhdowork
This document presents the LINE algorithm for embedding large-scale information networks. LINE aims to represent each network node in a low-dimensional space while preserving both first-order and second-order proximities. It defines objective functions to minimize the distance between the empirical and learned joint/conditional distributions. An edge sampling method is used to optimize the objective functions efficiently in large networks. Experiments on language, social, and citation networks demonstrate that LINE can scale to networks with millions of nodes and billions of edges while effectively preserving network structure.
Overlapping community detection in Large-Scale Networks using BigCLAM model b...Thang Nguyen
In this undergraduate thesis, I provide a general view of communities and its the real life applications. In recent years, with the rapid growth of network scale, it is a difficult task to detect overlapping communities in large-scale networks for state of the art methods. This method is implemented in the Apache Spark framework for its power in distributed parallel computation.
The main contributions of this work include:
Introduce BigCLAM models proposed by Yang and Leskovec (2013).
proposed a few methods convex optimization.
implemented BigCLAM in Apache Spark is evaluated as lightning-fast cluster computing to able detect community in the large-scale networks.
https://thangdnsf.github.io/research.html
Multiplex Networks: structure and dynamicsEmanuele Cozzo
This document discusses the formal representation and analysis of multiplex networks. It begins by introducing complex networks science and the concept of abstracting real-world systems as graphs to study structure and interactions. It then defines multiplex networks as networks with multiple types of interactions or relations between nodes that can be represented as multiple layer-graphs. The document provides formal definitions and representations of multiplex networks using concepts like participation graphs, layer-graphs, coupling graphs, and supra-adjacency matrices. It also discusses analyzing and coarse-graining multiplex networks through measures like structural metrics, walks, and quotient graphs.
Unmanned aerial vehicles (UAVs) have become very popular recently for both civil uses and potential commercial uses, such as law enforcement, crop survey, grocery delivery, and photographing, although they were mainly used for military purposes before. Researchers need the help of simulations when they design and test new protocols for UAV networks because simulations can be done for a network of a size
that a test bed can hardly approach. In the simulation of an UAV network it is important to choose a radio propagation model for the links in the network. We study the shadowing radio propagation model in this paper and compare it with the free space model, both of which are available in the ns2 network simulation package. We also show how the choice of the parameters of the shadowing model would impact on the
network performance of a UAV network.
Although unmanned aerial vehicles (UAVs) were mostly studied and used for military purposes before, they
have become very popular recently for both civil uses, such as law enforcement and crop survey, and for
potential commercial uses such as grocery delivery and Internet extension. Researchers investigating new
networking protocols for UAV networks usually need the help of simulations to test their protocol designs,
particularly when networks of large scales are desired in their tests. One choice that researchers need to
make in the simulation of UAV networks is the radio propagation model for the air links. In this paper we
compare the three radio propagation models that are available in the ns2 network simulation package and
investigate if the choice of one particular model would have a significant impact on the simulation results
for UAV networks.
This document summarizes a research paper that proposes a new cooperative channel load aware VoIP routing topology for 802.11 WLAN networks. It introduces the concept of cooperative channel transmitting technology for 802.11 WLAN networks and discusses some of the challenges in providing quality of service guarantees. It then presents a linear programming model and scheduling algorithm to implement cooperative channel transmissions while considering queue status and transitive node relationships to maximize throughput. Simulation results show that the proposed scheduling algorithm improves throughput and fairness compared to alternatives.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
k fault tolerance Mobile Adhoc Network under Cost Constraintsugandhasinghhooda
A network topology is a K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N X N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
This document summarizes a research article that proposes a novel method for implementing ternary Galois logic functions using three-dimensional lattice networks with carbon-based field emission devices. Specifically:
- It introduces a hierarchical design approach that utilizes carbon nanotubes and nano-apex fibers for controlled switching via field emission in three-dimensional lattice networks to realize multi-valued Galois functions concurrently.
- The document reviews fundamentals of ternary Shannon and Davio expansions that are used to formally synthesize the three-dimensional lattice networks. Joining rules are defined to realize non-symmetric functions using variable repetition.
- Carbon field emission devices are proposed to implement the basic controlled switch building block using nano
CONCURRENT TERNARY GALOIS-BASED COMPUTATION USING NANO-APEX MULTIPLEXING NIBS...VLSICS Design
Novel realizations of concurrent computations utilizing three-dimensional lattice networks and their
corresponding carbon-based field emission controlled switching is introduced in this article. The
formalistic ternary nano-based implementation utilizes recent findings in field emission and nano
applications which include carbon-based nanotubes and nanotips for three-valued lattice computing via
field-emission methods. The presented work implements multi-valued Galois functions by utilizing
concurrent nano-based lattice systems, which use two-to-one controlled switching via carbon-based field
emission devices by using nano-apex carbon fibers and carbon nanotubes that were presented in the first
part of the article. The introduced computational extension utilizing many-to-one carbon field-emission
devices will be further utilized in implementing congestion-free architectures within the third part of the
article. The emerging nano-based technologies form important directions in low-power compact-size
regular lattice realizations, in which carbon-based devices switch less-costly and more-reliably using
much less power than silicon-based devices. Applications include low-power design of VLSI circuits for
signal processing and control of autonomous robots.
This document summarizes a research paper that proposes CafRep, an adaptive congestion control protocol for delay-tolerant networks (DTNs). CafRep uses implicit heuristics based on contact and resource congestion to offload traffic from congested parts of the network to less congested areas. It also adaptively replicates messages at lower rates in different parts of the network with non-uniform congestion levels. The paper evaluates CafRep across three real mobility traces and shows it outperforms state-of-the-art DTN forwarding algorithms in maintaining high delivery rates while keeping low delays and packet loss, especially in congested networks.
The VISTA project aimed to integrate utility data from various UK organizations to improve coordination and reduce costs of street works. It developed methods for syntactically and semantically integrating heterogeneous utility data through a common data model and global thesaurus. Visualization techniques were also explored that incorporated uncertainty and were driven by an ontology. While the project proved the concept, further work is needed to develop the ontology and address implementation challenges regarding data currency, security, and impact on organizational systems.
Achieving Optimum Value of k in a K-fold Multicast Network with Buffer using ...cscpconf
Multicast network is widely used for effective communication, transmission and performance
optimizations of a network. In this paper, a new model has been developed to determine a
suitable value of the fold k of a k-fold multicast network under different traffic loads under
Poisson traffic with finite queue at each node. We have derived stationary distribution for the
network states and then derived expressions for the network throughput and the blocking
probability of the network. It has been found in this research work that the network throughput
increases very fast as we increase the fold number. However, at a certain value of the fold, the
blocking probability ceases to increase and it remains constant. We have also observed that as
the offered traffic is increased, the throughput also increases. Moreover, the system parameter k
is increased, the blocking probability decreases. However, after an optimum value of k, the
blocking probability remains constant for a particular value of the offered traffic. In fact, in this
paper, by evaluating the performance of a k-fold multicast network, our developed model improves the performance of a multicast network.
1. The document discusses supervised learning methods for link recommendation in co-authorship networks.
2. It compares algorithms like decision trees, naive Bayes, neural networks, random forests and bagging using metrics like AUC, precision, recall and F1-measure.
3. The experiments show that random forests and bagging outperform other methods, particularly when dealing with redundant features. The core size parameter k and time intervals also impact recommendation quality.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
1) The document analyzes the boundedness and domain of attraction of a fractional-order wireless power transfer (WPT) system.
2) It establishes a fractional-order piecewise affine model of the WPT system and derives sufficient conditions for boundedness using Lyapunov functions and inequality techniques.
3) The results provide a way to estimate the domain of attraction of the fractional-order WPT system and systems with periodically intermittent control.
Energy efficiency is one of the most critical issue in design of System on Chip. In Network On
Chip (NoC) based system, energy consumption is influenced dramatically by mapping of
Intellectual Property (IP) which affect the performance of the system. In this paper we test the
antecedently extant proposed algorithms and introduced a new energy proficient algorithm
stand for 3D NoC architecture. In addition a hybrid method has also been implemented using
bioinspired optimization (particle swarm optimization) technique. The proposed algorithm has
been implemented and evaluated on randomly generated benchmark and real life application
such as MMS, Telecom and VOPD. The algorithm has also been tested with the E3S benchmark
and has been compared with the existing algorithm (spiral and crinkle) and has shown better
reduction in the communication energy consumption and shows improvement in the
performance of the system. Comparing our work with spiral and crinkle, experimental result
shows that the average reduction in communication energy consumption is 19% with spiral and
17% with crinkle mapping algorithms, while reduction in communication cost is 24% and 21%
whereas reduction in latency is of 24% and 22% with spiral and crinkle. Optimizing our work
and the existing methods using bio-inspired technique and having the comparison among them
an average energy reduction is found to be of 18% and 24%.
Similar to Structure and dynamics of multiplex networks: beyond degree correlations (20)
Catastrophic instabilities in interacting networks and possible remediesKolja Kleineberg
The document discusses catastrophic instabilities that can occur in interacting networks and possible remedies. It describes how multiple online social networks can coexist but the system is fragile. It proposes that providing incentives for users to participate in less active networks could help sustain digital diversity and increase routing performance across networks. The document references several papers by the author studying interactions between networks, effects of latent geometric correlations, and how incentives may help mitigate vulnerabilities in multiplex systems.
Towards a democratic, scalable, and sustainable digital future (a complex sys...Kolja Kleineberg
The document discusses a complex systems perspective on achieving a democratic, scalable and sustainable digital future. It summarizes research showing that digital diversity is possible but fragile, and that routing performance improves when individuals are active across multiple networks. The key conclusion is that an appropriate incentive system using cryptocurrency to reward routing could help sustain digital diversity, increase routing performance, and lead to a robust decentralized digital world.
Re-inventing society in the digital age: Catastrophic instabilities in intera...Kolja Kleineberg
The document discusses catastrophic instabilities that can occur in interacting networks and possible remedies. It summarizes research showing that coexistence among competing online social networks is possible but fragile. It proposes that providing incentives for users to route information across multiple networks could help sustain digital diversity. The document also examines how hidden geometric correlations in real-world multiplex networks can mitigate vulnerabilities to failures or attacks.
Ecology 2.0: Coexistence and domination among interacting networksKolja Kleineberg
The overwhelming success of the web 2.0, with online social networks as key actors, has induced a paradigm shift in the nature of human interactions. The user-driven character of these services for the first time has allowed researchers to quantify large-scale social patterns. However, the mechanisms that determine the fate of networks at a system level are still poorly understood. For instance, the simultaneous existence of numerous digital services naturally raises the question under which conditions these services can coexist. In analogy to population dynamics, the digital world is forming a complex ecosystem of interacting networks whose fitnesses depend on their ability to attract and maintain users' attention, which constitutes a limited resource. In this paper, we introduce an ecological theory of the digital world which exhibits a stable coexistence of several networks as well as the domination of a single one, in contrast to the principle of competitive exclusion. Interestingly, our model also predicts that the most probable outcome is the coexistence of a moderate number of services, in agreement with empirical observations.
The overwhelming success of online social networks, the key actors in the cosmos of the Web 2.0, has reshaped human interactions on a worldwide scale. To understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we discuss the impact of heterogeneity in network intrinsic fitnesses induced by the competition between an international network, like Facebook, and local services. To this end, we construct a 1:1000 scale model of the digital world enclosing the 80 countries with most Internet users. We show how inter-country social ties induce an increased intrinsic fitness of the international network. Under certain conditions this leads to the extinction of local networks whereas under different conditions local networks can persist and even dominate the international network completely. These findings provide new insights into the possibilities to preserve digital diversity.
From the Evolution of Online Social Networks to Digital Ecology in a NutshellKolja Kleineberg
The overwhelming success of the web 2.0, with online social networks as key actors, has induced a paradigm shift in the nature of human interactions. The user-driven character of these services for the first time has allowed researchers to quantify large-scale social patterns. However, the mechanisms that determine the fate of networks at a system level are still poorly understood. For instance, the simultaneous existence of numerous digital services naturally raises the question under which conditions these services can coexist. In analogy to population dynamics, the digital world is forming a complex ecosystem of interacting networks whose fitnesses depend on their ability to attract and maintain users' attention, which constitutes a limited resource. In this paper, we introduce an ecological theory of the digital world which exhibits a stable coexistence of several networks as well as the domination of a single one, in contrast to the principle of competitive exclusion. Interestingly, our model also predicts that the most probable outcome is the coexistence of a moderate number of services, in agreement with empirical observations.
The overwhelming success of the web 2.0, with online social networks as key actors, has induced a paradigm shift in the nature of human interactions. The user-driven character of these services for the first time has allowed researchers to quantify large-scale social patterns. However, the mechanisms that determine the fate of networks at a system level are still poorly understood. For instance, the simultaneous existence of numerous digital services naturally raises the question under which conditions these services can coexist. In analogy to population dynamics, the digital world is forming a complex ecosystem of interacting networks whose fitnesses depend on their ability to attract and maintain users' attention, which constitutes a limited resource. In this paper, we introduce an ecological theory of the digital world which exhibits a stable coexistence of several networks as well as the domination of a single one, in contrast to the principle of competitive exclusion. Interestingly, our model also predicts that the most probable outcome is the coexistence of a moderate number of services, in agreement with empirical observations.
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
The use of Nauplii and metanauplii artemia in aquaculture (brine shrimp).pptxMAGOTI ERNEST
Although Artemia has been known to man for centuries, its use as a food for the culture of larval organisms apparently began only in the 1930s, when several investigators found that it made an excellent food for newly hatched fish larvae (Litvinenko et al., 2023). As aquaculture developed in the 1960s and ‘70s, the use of Artemia also became more widespread, due both to its convenience and to its nutritional value for larval organisms (Arenas-Pardo et al., 2024). The fact that Artemia dormant cysts can be stored for long periods in cans, and then used as an off-the-shelf food requiring only 24 h of incubation makes them the most convenient, least labor-intensive, live food available for aquaculture (Sorgeloos & Roubach, 2021). The nutritional value of Artemia, especially for marine organisms, is not constant, but varies both geographically and temporally. During the last decade, however, both the causes of Artemia nutritional variability and methods to improve poorquality Artemia have been identified (Loufi et al., 2024).
Brine shrimp (Artemia spp.) are used in marine aquaculture worldwide. Annually, more than 2,000 metric tons of dry cysts are used for cultivation of fish, crustacean, and shellfish larva. Brine shrimp are important to aquaculture because newly hatched brine shrimp nauplii (larvae) provide a food source for many fish fry (Mozanzadeh et al., 2021). Culture and harvesting of brine shrimp eggs represents another aspect of the aquaculture industry. Nauplii and metanauplii of Artemia, commonly known as brine shrimp, play a crucial role in aquaculture due to their nutritional value and suitability as live feed for many aquatic species, particularly in larval stages (Sorgeloos & Roubach, 2021).
Remote Sensing and Computational, Evolutionary, Supercomputing, and Intellige...University of Maribor
Slides from talk:
Aleš Zamuda: Remote Sensing and Computational, Evolutionary, Supercomputing, and Intelligent Systems.
11th International Conference on Electrical, Electronics and Computer Engineering (IcETRAN), Niš, 3-6 June 2024
Inter-Society Networking Panel GRSS/MTT-S/CIS Panel Session: Promoting Connection and Cooperation
https://www.etran.rs/2024/en/home-english/
ESA/ACT Science Coffee: Diego Blas - Gravitational wave detection with orbita...Advanced-Concepts-Team
Presentation in the Science Coffee of the Advanced Concepts Team of the European Space Agency on the 07.06.2024.
Speaker: Diego Blas (IFAE/ICREA)
Title: Gravitational wave detection with orbital motion of Moon and artificial
Abstract:
In this talk I will describe some recent ideas to find gravitational waves from supermassive black holes or of primordial origin by studying their secular effect on the orbital motion of the Moon or satellites that are laser ranged.
Authoring a personal GPT for your research and practice: How we created the Q...Leonel Morgado
Thematic analysis in qualitative research is a time-consuming and systematic task, typically done using teams. Team members must ground their activities on common understandings of the major concepts underlying the thematic analysis, and define criteria for its development. However, conceptual misunderstandings, equivocations, and lack of adherence to criteria are challenges to the quality and speed of this process. Given the distributed and uncertain nature of this process, we wondered if the tasks in thematic analysis could be supported by readily available artificial intelligence chatbots. Our early efforts point to potential benefits: not just saving time in the coding process but better adherence to criteria and grounding, by increasing triangulation between humans and artificial intelligence. This tutorial will provide a description and demonstration of the process we followed, as two academic researchers, to develop a custom ChatGPT to assist with qualitative coding in the thematic data analysis process of immersive learning accounts in a survey of the academic literature: QUAL-E Immersive Learning Thematic Analysis Helper. In the hands-on time, participants will try out QUAL-E and develop their ideas for their own qualitative coding ChatGPT. Participants that have the paid ChatGPT Plus subscription can create a draft of their assistants. The organizers will provide course materials and slide deck that participants will be able to utilize to continue development of their custom GPT. The paid subscription to ChatGPT Plus is not required to participate in this workshop, just for trying out personal GPTs during it.
Or: Beyond linear.
Abstract: Equivariant neural networks are neural networks that incorporate symmetries. The nonlinear activation functions in these networks result in interesting nonlinear equivariant maps between simple representations, and motivate the key player of this talk: piecewise linear representation theory.
Disclaimer: No one is perfect, so please mind that there might be mistakes and typos.
dtubbenhauer@gmail.com
Corrected slides: dtubbenhauer.com/talks.html
Immersive Learning That Works: Research Grounding and Paths ForwardLeonel Morgado
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
PPT on Direct Seeded Rice presented at the three-day 'Training and Validation Workshop on Modules of Climate Smart Agriculture (CSA) Technologies in South Asia' workshop on April 22, 2024.
Unlocking the mysteries of reproduction: Exploring fecundity and gonadosomati...AbdullaAlAsif1
The pygmy halfbeak Dermogenys colletei, is known for its viviparous nature, this presents an intriguing case of relatively low fecundity, raising questions about potential compensatory reproductive strategies employed by this species. Our study delves into the examination of fecundity and the Gonadosomatic Index (GSI) in the Pygmy Halfbeak, D. colletei (Meisner, 2001), an intriguing viviparous fish indigenous to Sarawak, Borneo. We hypothesize that the Pygmy halfbeak, D. colletei, may exhibit unique reproductive adaptations to offset its low fecundity, thus enhancing its survival and fitness. To address this, we conducted a comprehensive study utilizing 28 mature female specimens of D. colletei, carefully measuring fecundity and GSI to shed light on the reproductive adaptations of this species. Our findings reveal that D. colletei indeed exhibits low fecundity, with a mean of 16.76 ± 2.01, and a mean GSI of 12.83 ± 1.27, providing crucial insights into the reproductive mechanisms at play in this species. These results underscore the existence of unique reproductive strategies in D. colletei, enabling its adaptation and persistence in Borneo's diverse aquatic ecosystems, and call for further ecological research to elucidate these mechanisms. This study lends to a better understanding of viviparous fish in Borneo and contributes to the broader field of aquatic ecology, enhancing our knowledge of species adaptations to unique ecological challenges.
4. Introduction Multiplex geometry Applications and implications Summary & outlook
Multiplex networks can describe interdependencies
between different networked systems
Several networking layers
4
5. Introduction Multiplex geometry Applications and implications Summary & outlook
Multiplex networks can describe interdependencies
between different networked systems
Several networking layers
Same nodes exist in different
layers
4
6. Introduction Multiplex geometry Applications and implications Summary & outlook
Multiplex networks can describe interdependencies
between different networked systems
Several networking layers
Same nodes exist in different
layers
One-to-one mapping between
nodes in different layers
4
7. Introduction Multiplex geometry Applications and implications Summary & outlook
Multiplex networks can describe interdependencies
between different networked systems
Several networking layers
Same nodes exist in different
layers
One-to-one mapping between
nodes in different layers
Typical features: Edge overlap
& degree-degree correlations
& and one more!
Degree correlations and overlap have been studied extensively:
Nature Physics 8, 40–48 (2011); Phys. Rev. E 92, 032805 (2015); Phys. Rev.
Lett. 111, 058702 (2013); Phys. Rev. E 88, 052811 (2013); ...
4
9. Introduction Multiplex geometry Applications and implications Summary & outlook
Hidden metric spaces underlying real complex networks
provide a fundamental explanation of their observed topologies
Nature Physics 5, 74–80 (2008)
6
10. Introduction Multiplex geometry Applications and implications Summary & outlook
Hidden metric spaces underlying real complex networks
provide a fundamental explanation of their observed topologies
We can infer the coordinates of nodes embedded in
hidden metric spaces by inverting models.
6
11. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1
p(κ) ∝ κ−γ
7
12. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1
p(κ) ∝ κ−γ
r = 1
1+
[
d(θ,θ′)
µκκ′
]1/T
PRL 100, 078701
8
13. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1 H2
p(κ) ∝ κ−γ ri = R − 2 ln κi
κmin
r = 1
1+
[
d(θ,θ′)
µκκ′
]1/T
PRL 100, 078701
9
14. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1 H2
p(κ) ∝ κ−γ
ρ(r) ∝ e
1
2
(γ−1)(r−R)
r = 1
1+
[
d(θ,θ′)
µκκ′
]1/T
PRL 100, 078701
10
15. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1 H2
p(κ) ∝ κ−γ
ρ(r) ∝ e
1
2
(γ−1)(r−R)
r = 1
1+
[
d(θ,θ′)
µκκ′
]1/T p(xij) = 1
1+e
xij−R
2T
PRL 100, 078701 PRE 82, 036106
11
16. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic geometry emerges from Newtonian model
and similarity × popularity optimization in growing networks
S1 H2 growing
p(κ) ∝ κ−γ
ρ(r) ∝ e
1
2
(γ−1)(r−R) t = 1, 2, 3 . . .
r = 1
1+
[
d(θ,θ′)
µκκ′
]1/T p(xij) = 1
1+e
xij−R
2T
mins∈[1...t−1] s · ∆θst
PRL 100, 078701 PRE 82, 036106 Nature 489, 537–540
12
17. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic maps of complex networks:
Poincaré disk
Nature Communications 1, 62 (2010)
Polar coordinates:
ri : Popularity (degree)
θi : Similarity
Distance:
xij = cosh−1
(cosh ri cosh rj
− sinh ri sinh rj cos ∆θij)
Connection probability:
p(xij) =
1
1 + e
xij−R
2T
13
18. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic maps of complex networks:
Poincaré disk
Internet IPv6 topology
Polar coordinates:
ri : Popularity (degree)
θi : Similarity
Distance:
xij = cosh−1
(cosh ri cosh rj
− sinh ri sinh rj cos ∆θij)
Connection probability:
p(xij) =
1
1 + e
xij−R
2T
13
19. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic maps of complex networks:
Poincaré disk
Internet IPv6 topology
Polar coordinates:
ri : Popularity (degree)
θi : Similarity
Distance:
xij = cosh−1
(cosh ri cosh rj
− sinh ri sinh rj cos ∆θij)
Connection probability:
p(xij) =
1
1 + e
xij−R
2T
13
20. Introduction Multiplex geometry Applications and implications Summary & outlook
Hyperbolic maps of complex networks:
Poincaré disk
Internet IPv6 topology
Polar coordinates:
ri : Popularity (degree)
θi : Similarity
Distance:
xij = cosh−1
(cosh ri cosh rj
− sinh ri sinh rj cos ∆θij)
Connection probability:
p(xij) =
1
1 + e
xij−R
2T
13
22. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
15
23. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
15
24. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
15
25. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
15
26. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
Uncorrelated
15
27. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
Uncorrelated Correlated
15
28. Introduction Multiplex geometry Applications and implications Summary & outlook
Metric spaces underlying different layers
of real multiplexes could be correlated
Uncorrelated Correlated
Are there metric correlations in real multiplexes,
and what is the impact?
15
29. Introduction Multiplex geometry Applications and implications Summary & outlook
Radial and angular coordinates are correlated
between different layers in many real multiplexes
Degreecorrelations
Random superposition
of constituent layers
16
30. Introduction Multiplex geometry Applications and implications Summary & outlook
Radial and angular coordinates are correlated
between different layers in many real multiplexes
Degreecorrelations
Random superposition
of constituent layers
16
31. Introduction Multiplex geometry Applications and implications Summary & outlook
Radial and angular coordinates are correlated
between different layers in many real multiplexes
Degreecorrelations
Random superposition
of constituent layers
What is the impact of the discovered geometric
correlations?
16
33. Introduction Multiplex geometry Applications and implications Summary & outlook
Sets of nodes simultaneously similar in both layers
are overabundant in real systems
Real system
0
π
2 π
θ1
0
π
2 π
θ2
100
200
Reshuffled
0
π
2 π
θ1
0
π
2 π
θ2
100
200
18
34. Introduction Multiplex geometry Applications and implications Summary & outlook
Sets of nodes simultaneously similar in both layers
are overabundant in real systems
Real system
0
π
2 π
θ1
0
π
2 π
θ2
100
200
Reshuffled
0
π
2 π
θ1
0
π
2 π
θ2
100
200
Angular correlations are related to
multidimensional communities.
18
36. Introduction Multiplex geometry Applications and implications Summary & outlook
Distance between pairs of nodes in one layer is
an indicator of the connection probability in another layer
Hyperbolic distance in IPv4
Connectionprob.inIPv6
P(2|1)
0 5 10 15 20 25 30 35 40
10-4
10-3
10-2
10-1
100
20
37. Introduction Multiplex geometry Applications and implications Summary & outlook
Distance between pairs of nodes in one layer is
an indicator of the connection probability in another layer
Hyperbolic distance in IPv4
Connectionprob.inIPv6
P(2|1)
0 5 10 15 20 25 30 35 40
10-4
10-3
10-2
10-1
100
Pran(2|1)
20
38. Introduction Multiplex geometry Applications and implications Summary & outlook
Distance between pairs of nodes in one layer is
an indicator of the connection probability in another layer
Hyperbolic distance in IPv4
Connectionprob.inIPv6
P(2|1)
0 5 10 15 20 25 30 35 40
10-4
10-3
10-2
10-1
100
Pran(2|1)
Geometric correlations enable precise trans-layer
link prediction.
20
40. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
22
41. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
22
42. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
22
43. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
22
44. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
22
45. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual greedy routing allows efficient navigation
using several network layers and metric spaces
[Credits: Marian Boguna]
Forward message
to contact closest
to target in metric
space
Delivery fails
if message runs into
a loop (define
success rate P)
Messages switch
layers if contact has
a closer neighbor in
another layer
22
46. Introduction Multiplex geometry Applications and implications Summary & outlook
Geometric correlations determine the improvement of
mutual greedy routing by increasing the number of layers
Mi�ga�on factor: Number
of failed message deliveries
compared to single layer
case reduced by a constant
factor
0.0 0.2 0.4 0.6 0.8 1.0
0.0
0.2
0.4
0.6
0.8
1.0
0.80
0.82
0.84
0.86
0.88
0.90
P
0.0 0.2 0.4 0.6 0.8 1.0
0.0
0.2
0.4
0.6
0.8
1.0
0.980
0.985
0.990
0.995
P
Angular correla�ons
Radialcorrela�ons
Angular correla�ons
Radialcorrela�ons
T = 0.8 T = 0.1
23
48. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual percolation is a proxy of the vulnerability
of the system against random failures
Mutually connected component (MCC) is largest fraction of nodes
connected by a path in every layer using only nodes in the
component
25
49. Introduction Multiplex geometry Applications and implications Summary & outlook
Mutual percolation is a proxy of the vulnerability
of the system against random failures
Mutually connected component (MCC) is largest fraction of nodes
connected by a path in every layer using only nodes in the
component
Radial or angular correlations mitigate catastrophic
failure cascades in mutual percolation.
25
50. Introduction Multiplex geometry Applications and implications Summary & outlook
In real systems failures may not always be random,
but the result of targeted attacks
Targeted attacks:
- Rank nodes according to Ki = max(k
(1)
i , k
(2)
i ) (k
(j)
i degree in
layer j = 1, 2)
- Remove nodes with higher Ki first (undo ties at random)
- Reevaluate Ki’s after each removal
a)
bcd
c) d)b)
26
51. Introduction Multiplex geometry Applications and implications Summary & outlook
Strength of geometric correlations predicts robustness
of real multiplexes against targeted attacks
Model Geometric corr. & robustness
Angular correla�ons (NMI)
Robustnessrealvsreshuffled()
arXiv:1702.02246
27
52. Introduction Multiplex geometry Applications and implications Summary & outlook
Strength of geometric correlations predicts robustness
of real multiplexes against targeted attacks
Model Geometric corr. & robustness
Angular correla�ons (NMI)
Robustnessrealvsreshuffled()
arXiv:1702.02246
Only geometric correlations mitigate extreme
vulnerability against targeted attacks.
27
54. Introduction Multiplex geometry Applications and implications Summary & outlook
Geometric correlations can lead to the formation
of coherent patterns among different layers
γ
β
GN
ON
+T+S
C D
Layer 1: Evolutionary games
Stag Hunt, Prisoner’s Dilemma
& imitation dynamics
Layer 2: Social influence
Voter model & bias towards
cooperation
Coupling: at each timestep, with probability
(1 − γ) perform respective dynamics in each layer
γ nodes copy their state from one layer to the other
29
55. Introduction Multiplex geometry Applications and implications Summary & outlook
Geometric correlations give rise to metastable state
of high polarization between groups of different strategies
1
2
1
2
3 3
Game layer Opinion layer
1 1
22
3 3
Game Opinion
30
57. Introduction Multiplex geometry Applications and implications Summary & outlook
Constituent network layers of real multiplexes
exhibit significant hidden geometric correlationsFrameworkResultBasis
Implications
Network
geometry
Networks embedded
in hyperbolic space
Useful maps of
complex systems
Structure governed by
joint hidden geometry
Perfect navigation,
increase robustness, ...
Importance to consider
geometric correlations
Geometric correlations
between layers
Nat. Phys. 12, 1076–1081
Connection probability
depends on distance
Multiplexes not random
combinations of layers
Multiplex
geometry
Geometric correlations
induce new behavior
PRE 82, 036106 arXiv:1702.02246
32
58. Introduction Multiplex geometry Applications and implications Summary & outlook
Constituent network layers of real multiplexes
exhibit significant hidden geometric correlationsFrameworkResultBasis
Implications
Network
geometry
Networks embedded
in hyperbolic space
Useful maps of
complex systems
Structure governed by
joint hidden geometry
Perfect navigation,
increase robustness, ...
Importance to consider
geometric correlations
Geometric correlations
between layers
Nat. Phys. 12, 1076–1081
Connection probability
depends on distance
Multiplexes not random
combinations of layers
Multiplex
geometry
Geometric correlations
induce new behavior
PRE 82, 036106 arXiv:1702.02246
32
59. Introduction Multiplex geometry Applications and implications Summary & outlook
Constituent network layers of real multiplexes
exhibit significant hidden geometric correlationsFrameworkResultBasis
Implications
Network
geometry
Networks embedded
in hyperbolic space
Useful maps of
complex systems
Structure governed by
joint hidden geometry
Perfect navigation,
increase robustness, ...
Importance to consider
geometric correlations
Geometric correlations
between layers
Nat. Phys. 12, 1076–1081
Connection probability
depends on distance
Multiplexes not random
combinations of layers
Multiplex
geometry
Geometric correlations
induce new behavior
PRE 82, 036106 arXiv:1702.02246
32
60. References:
»Hidden geometric correlations in real multiplex networks«
Nat. Phys. 12, 1076–1081 (2016)
K-K. Kleineberg, M. Boguñá, M. A. Serrano, F. Papadopoulos
»Geometric correlations mitigate the extreme vulnerability of multiplex
networks against targeted attacks«
arXiv:1702.02246 (2017)
K-K. Kleineberg, L. Buzna, F. Papadopoulos, M. Boguñá, M. A. Serrano
»Interplay between social influence and competitive strategical games
in multiplex networks«
arXiv:1702.05952 (2017)
R. Amato, A. Díaz-Guilera, K-K. Kleineberg
Kaj Kolja Kleineberg:
• kkleineberg@ethz.ch
• @KoljaKleineberg
• koljakleineberg.wordpress.com
61. References:
»Hidden geometric correlations in real multiplex networks«
Nat. Phys. 12, 1076–1081 (2016)
K-K. Kleineberg, M. Boguñá, M. A. Serrano, F. Papadopoulos
»Geometric correlations mitigate the extreme vulnerability of multiplex
networks against targeted attacks«
arXiv:1702.02246 (2017)
K-K. Kleineberg, L. Buzna, F. Papadopoulos, M. Boguñá, M. A. Serrano
»Interplay between social influence and competitive strategical games
in multiplex networks«
arXiv:1702.05952 (2017)
R. Amato, A. Díaz-Guilera, K-K. Kleineberg
Kaj Kolja Kleineberg:
• kkleineberg@ethz.ch
• @KoljaKleineberg ← Slides & Model (soon)
• koljakleineberg.wordpress.com
62. References:
»Hidden geometric correlations in real multiplex networks«
Nat. Phys. 12, 1076–1081 (2016)
K-K. Kleineberg, M. Boguñá, M. A. Serrano, F. Papadopoulos
»Geometric correlations mitigate the extreme vulnerability of multiplex
networks against targeted attacks«
arXiv:1702.02246 (2017)
K-K. Kleineberg, L. Buzna, F. Papadopoulos, M. Boguñá, M. A. Serrano
»Interplay between social influence and competitive strategical games
in multiplex networks«
arXiv:1702.05952 (2017)
R. Amato, A. Díaz-Guilera, K-K. Kleineberg
Kaj Kolja Kleineberg:
• kkleineberg@ethz.ch
• @KoljaKleineberg ← Slides & Model (soon)
• koljakleineberg.wordpress.com ← Slides & Model