Complex Contact Network of Patients at the Beginning of an Epidemic Outbreak: An Analysis Based on 1218 COVID-19 Cases in China

The spread of viruses essentially occurs through the interaction and contact between people, which is closely related to the network of interpersonal relationships. Based on the epidemiological investigations of 1218 COVID-19 cases in eight areas of China, we use text analysis, social network analysis and visualization methods to construct a dynamic contact network of the epidemic. We analyze the corresponding demographic characteristics, network indicators, and structural characteristics of this network. We found that more than 65% of cases are likely to be infected by a strong relationship, and nearly 40% of cases have family members infected at the same time. The overall connectivity of the contact network is low, but there are still some clustered infections. In terms of the degree distribution, most cases’ degrees are concentrated between 0 and 2, which is relatively low, and only a few ones have a higher degree value. The degree distribution also conforms to the power law distribution, indicating the network is a scale-free network. There are 17 cases with a degree greater than 10, and these cluster infections are usually caused by local transmission. The first implication of this research is we find that the COVID-19 spread is closely related to social structures by applying computational sociological methods for infectious disease studies; the second implication is to confirm that text analysis can quickly visualize the spread trajectory at the beginning of an epidemic.

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

Percolation phase transition in weight-dependent random connection models

We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the weight and position of the points, we form an edge between any pair of points independently with a probability depending on the two weights of the points and their distance. Preference is given to short edges and connections to vertices with large weights. We characterize the parameter regime where there is a non-trivial percolation phase transition and show that it depends not only on the power-law exponent of the degree distribution but also on a geometric model parameter. We apply this result to characterize robustness of age-based spatial preferential attachment networks.

Random intersection graphs with communities

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of communities and individuals, where these communities may overlap. We generalize the model, allowing for arbitrary community structures within the communities. In our new model, communities may overlap, and they have their own internal structure described by arbitrary finite community graphs. Our model turns out to be tractable. We analyze the overlapping structure of the communities, show local weak convergence (including convergence of subgraph counts), and derive the asymptotic degree distribution and the local clustering coefficient.

Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction

Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties. This network is constructed by a deterministic procedure of consequentially splitting a triangle into smaller and smaller triangles. In this paper, a similar construction based on the consequential splitting of tetragons and other polygons with an even number of edges is presented. The suggested procedure is stochastic and results in the ensemble of planar scale-free graphs. In the limit of a large number of splittings, the degree distribution of the graph converges to a true power law with an exponent, which is smaller than three in the case of tetragons and larger than three for polygons with a larger number of edges. It is shown that it is possible to stochastically mix tetragon-based and hexagon-based constructions to obtain an ensemble of graphs with a tunable exponent of degree distribution. Other possible planar generalizations of the Apollonian procedure are also briefly discussed.

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs

The computational complexity of the VertexCover problem has been studied extensively. Most notably, it is NP-complete to find an optimal solution and typically NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on many real-world networks the run time to solve VertexCover is way smaller than even the best known FPT-approaches can explain. We link these observations to two properties that are observed in many real-world networks, namely a heterogeneous degree distribution and high clustering. To formalize these properties and explain the observed behavior, we analyze how a branch-and-reduce algorithm performs on hyperbolic random graphs, which have become increasingly popular for modeling real-world networks. In fact, we are able to show that the VertexCover problem on hyperbolic random graphs can be solved in polynomial time, with high probability. The proof relies on interesting structural properties of hyperbolic random graphs. Since these predictions of the model are interesting in their own right, we conducted experiments on real-world networks showing that these properties are also observed in practice.

On the brain networks organization of individuals with high versus average fluid intelligence: a combined DTI and MEG study

The neural underpinning of human fluid intelligence (Gf) has gathered a large interest in the scientific community. Nonetheless, previous research did not provide a full understanding of such intriguing topic. Here, we studied the structural (from diffusion tensor imaging, DTI) and functional (from magnetoencephalography (MEG) resting state) connectivity in individuals with high versus average Gf scores. Our findings showed greater values in the brain areas degree distribution and higher proportion of long-range anatomical connections for high versus average Gfs. Further, the two groups presented different community structures, highlighting the structural and functional integration of the cingulate within frontal subnetworks of the brain in high Gfs. These results were consistently observed for structural connectivity and functional connectivity of delta, theta and alpha. Notably, gamma presented an opposite pattern, showing more segregation and lower degree distribution and connectivity in high versus average Gfs. Our study confirmed and expanded previous perspectives and knowledge on the small-worldness of the brain. Further, it complemented the widely investigated structural brain network of highly intelligent individuals with analyses on fast-scale functional networks in five frequency bands, highlighting key differences in the integration and segregation of information flow between slow and fast oscillations in groups with different Gf.

Efficient Laplacian spectral density computations for networks with arbitrary degree distributions

The network Laplacian spectral density calculation is critical in many fields, including physics, chemistry, statistics, and mathematics. It is highly computationally intensive, limiting the analysis to small networks. Therefore, we present two efficient alternatives: one based on the network’s edges and another on the degrees. The former gives the exact spectral density of locally tree-like networks but requires iterative edge-based message-passing equations. In contrast, the latter obtains an approximation of the spectral density using only the degree distribution. The computational complexities are 𝒪(|E|log(n)) and 𝒪(n), respectively, in contrast to 𝒪(n3) of the diagonalization method, where n is the number of vertices and |E| is the number of edges.

Robust, Universal Tree Balance Indices

Balance indices that quantify the symmetry of branching events and the compactness of trees are widely used to compare evolutionary processes or tree-generating algorithms. Yet existing indices have important shortcomings, including that they are unsuited to the tree types commonly used to describe the evolution of tumours, microbial populations, and cell lines. The contributions of this article are twofold. First, we define a new class of robust, universal tree balance indices. These indices take a form similar to Colless’ index but account for node sizes, are defined for trees with any degree distribution, and enable more meaningful comparison of trees with different numbers of leaves. Second, we show that for bifurcating and all other full m-ary cladograms (in which every internal node has the same out-degree), one such Colless-like index is equivalent to the normalised reciprocal of Sackin’s index. Hence we both unify and generalise the two most popular existing tree balance indices. Our indices are intrinsically normalised and can be computed in linear time. We conclude that these more widely applicable indices have potential to supersede those in current use.