A common feature of many networks is the presence of communities, or groups of relatively densely connected nodes with sparse connections between groups. An understanding of community structures could enable the netwo...
详细信息
We study the behavior of the eigenvectors associated with the smallest eigenvalues of the Laplacian matrix of temporal networks. We consider the multilayer representation of temporal networks, i.e., a set of networks ...
详细信息
We study the behavior of the eigenvectors associated with the smallest eigenvalues of the Laplacian matrix of temporal networks. We consider the multilayer representation of temporal networks, i.e., a set of networks linked through ordinal interconnected layers. We analyze the Laplacian matrix, known as supra-Laplacian, constructed through the supraadjacency matrix associated with the multilayer formulation of temporal networks, using a constant block Jacobi model which has closed-form solution. To do this, we assume that the interlayer weights are perturbations of the Kronecker sum of the separate adjacency matrices forming the temporal network. Thus we investigate the properties of the eigenvectors associated with the smallest eigenvalues (close to zero) of the supra-Laplacian matrix. Using arguments of perturbation theory, we show that these eigenvectors can be approximated by linear combinations of the zero eigenvectors of the individual time layers. This finding is crucial in reconsidering and generalizing the role of the Fielder vector in supra-Laplacian matrices.
This article distinguishes between clique family subgroups and communities in a crisis response network. Then, we examine the way organizations interacted to achieve a common goal by employing community analysis of an...
详细信息
This article distinguishes between clique family subgroups and communities in a crisis response network. Then, we examine the way organizations interacted to achieve a common goal by employing community analysis of an epidemic response network in Korea in 2015. The results indicate that the network split into two groups: core response communities in one group and supportive functional communities in the other. The core response communities include organizations across government jurisdictions, sectors, and geographic locations. Other communities are confined geographically, homogenous functionally, or both. We also find that whenever intergovernmental relations were present in communities, the member connectivity was low, even if intersectoral relations appeared together within them.
Homophily is the principle whereby “similarity breeds connections.” We give a quantitative formulation of this principle within networks. Given a network and a labeled partition of its vertices, the vector indexed b...
详细信息
Homophily is the principle whereby “similarity breeds connections.” We give a quantitative formulation of this principle within networks. Given a network and a labeled partition of its vertices, the vector indexed by each class of the partition, whose entries are the number of edges of the subgraphs induced by the corresponding classes, is viewed as the observed outcome of the random vector described by picking labeled partitions at random among labeled partitions whose classes have the same cardinalities as the given one. This is the recently introduced random coloring model for network homophily. In this perspective, the value of any homophily score Θ, namely, a nondecreasing real-valued function in the sizes of subgraphs induced by the classes of the partition, evaluated at the observed outcome, can be thought of as the observed value of a random variable. Consequently, according to the score Θ, the input network is homophillic at the significance level α whenever the one-sided tail probability of observing a value of Θ at least as extreme as the observed one is smaller than α. Since, as we show, even approximating α is an NP-hard problem, we resort to classical tails inequality to bound α from above. These upper bounds, obtained by specializing Θ, yield a class of quantifiers of network homophily. Computing the upper bounds requires the knowledge of the covariance matrix of the random vector, which was not previously known within the random coloring model. In this paper we close this gap. Interestingly, the matrix depends on the input partition only through the cardinalities of its classes and depends on the network only through its degrees. Furthermore all the covariances have the same sign, and this sign is a graph invariant. Plugging this structure into the bounds yields a meaningful, easy to compute class of indices for measuring network homophily. As demonstrated in real-world network applications, these indices are effective and reliable, and may lead to d
We present a probabilistic generative model and efficient algorithm to model reciprocity in directed networks. Unlike other methods that address this problem such as exponential random graphs, it assigns latent variab...
详细信息
We present a probabilistic generative model and efficient algorithm to model reciprocity in directed networks. Unlike other methods that address this problem such as exponential random graphs, it assigns latent variables as community memberships to nodes and a reciprocity parameter to the whole network rather than fitting order statistics. It formalizes the assumption that a directed interaction is more likely to occur if an individual has already observed an interaction towards her. It provides a natural framework for relaxing the common assumption in network generative models of conditional independence between edges, and it can be used to perform inference tasks such as predicting the existence of an edge given the observation of an edge in the reverse direction. Inference is performed using an efficient expectation-maximization algorithm that exploits the sparsity of the network, leading to an efficient and scalable implementation. We illustrate these findings by analyzing synthetic and real data, including social networks, academic citations, and the Erasmus student exchange program. Our method outperforms others in both predicting edges and generating networks that reflect the reciprocity values observed in real data, while at the same time inferring an underlying community structure. We provide an open-source implementation of the code online.
A complete understanding of the brain requires an integrated description of the numerous scales and levels of neural organization. This means studying the interplay of genes and synapses, but also the relation between...
详细信息
A complete understanding of the brain requires an integrated description of the numerous scales and levels of neural organization. This means studying the interplay of genes and synapses, but also the relation between the structure and dynamics of the whole brain, which ultimately leads to different types of behavior, from perception to action, while asleep or awake. Yet multiscale brain modeling is challenging, in part because of the difficulty to simultaneously access information from multiple scales and levels. While some insight has been gained on the role of specific microcircuits on the generation of macroscale brain activity, a comprehensive characterization of how changes occurring at one scale or level can have an impact on other ones remains poorly understood. Recent efforts to address this gap include the development of new frameworks originating mostly from network science and complex systems theory. These theoretical contributions provide a powerful framework to analyze and model interconnected systems exhibiting interactions within and between different layers of information. Recent advances for the characterization of the multiscale brain organization in terms of structure-function, oscillation frequencies, and temporal evolution are presented. Efforts are reviewed on the multilayer network properties underlying the physics of higher-order organization of neuronal assemblies, as well as on the identification of multimodal network-based biomarkers of brain pathologies such as Alzheimer’s disease. This Colloquium concludes with a perspective discussion of how recent results from multilayer network theory, involving generative modeling, controllability, and machine learning, could be adopted to address new questions in modern physics and neuroscience.
In semisupervised communitydetection, the membership of a set of revealed nodes is known in addition to the graph structure and can be leveraged to achieve better inference accuracies. While previous works investigat...
详细信息
In semisupervised communitydetection, the membership of a set of revealed nodes is known in addition to the graph structure and can be leveraged to achieve better inference accuracies. While previous works investigated the case where the revealed nodes are selected at random, this paper focuses on correlated subsets leading to atypically high accuracies. In the framework of the dense stochastic block model, we employ statistical physics methods to derive a large deviation analysis of the number of these rare subsets, as characterized by their free energy. We find theoretical evidence of a nonmonotonic relationship between reconstruction accuracy and the free energy associated to the posterior measure of the inference problem. We further discuss possible implications for active learning applications in communitydetection.
We analyze the recovery of different roles in a network modeled by a directed graph, based on the so-called Neighborhood Pattern Similarity approach. Our analysis uses results from random matrix theory to show that, w...
详细信息
We analyze the recovery of different roles in a network modeled by a directed graph, based on the so-called Neighborhood Pattern Similarity approach. Our analysis uses results from random matrix theory to show that, when assuming that the graph is generated as a particular stochastic block model with Bernoulli probability distributions for the different blocks, then the recovery is asymptotically correct when the graph has a sufficiently large dimension. Under these assumptions there is a sufficient gap between the dominant and dominated eigenvalues of the similarity matrix, which guarantees the asymptotic correct identification of the number of different roles. We also comment on the connections with the literature on stochastic block models, including the case of probabilities of order log(n)/n where n is the graph size. We provide numerical experiments to assess the effectiveness of the method when applied to practical networks of finite size.
Online social networks (OSNs) have become one of the most popular platforms where people communicate by sharing contents and personal information. The interactions performed by the users allow to identify the homophil...
详细信息
We present a Markov chain Monte Carlo scheme based on merges and splits of groups that is capable of efficiently sampling from the posterior distribution of network partitions, defined according to the stochastic bloc...
详细信息
We present a Markov chain Monte Carlo scheme based on merges and splits of groups that is capable of efficiently sampling from the posterior distribution of network partitions, defined according to the stochastic block model (SBM). We demonstrate how schemes based on the move of single nodes between groups systematically fail at correctly sampling from the posterior distribution even on small networks, and how our merge-split approach behaves significantly better, and improves the mixing time of the Markov chain by several orders of magnitude in typical cases. We also show how the scheme can be straightforwardly extended to nested versions of the SBM, yielding asymptotically exact samples of hierarchical network partitions.
暂无评论