Related papers: Some comments on the structure of the best known n…
How to determine the community structure of complex networks is an open question. It is critical to establish the best strategies for community detection in networks of unknown structure. Here, using standard synthetic benchmarks, we show…
The increasing interest in complex networks research has been a consequence of several intrinsic features of this area, such as the generality of the approach to represent and model virtually any discrete system, and the incorporation of…
We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007…
In this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack…
This paper is an extensive survey of literature on complex network communities and clustering. Complex networks describe a widespread variety of systems in nature and society especially systems composed by a large number of highly…
We analyze random resistor networks through a study of lattice Green's functions in arbitrary dimensions. We develop a systematic disorder perturbation expansion to describe the weak disorder regime of such a system. We use this formulation…
Food webs have been found to exhibit remarkable motif profiles, patterns in the relative prevalences of all possible three-species sub-graphs, and this has been related to ecosystem properties such as stability and robustness. Analysing 46…
Precisely quantifying the heterogeneity or disorder of a network system is very important and desired in studies of behavior and function of the network system. Although many degree-based entropies have been proposed to measure the…
Previous work identifying depth-optimal $n$-channel sorting networks for $9\leq n \leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper…
Safety critical systems strongly require the quality aspects of artificial intelligence including explainability. In this paper, we analyzed a trained network to extract features which mainly contribute the inference. Based on the analysis,…
In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing…
All dynamical systems of biological interest--be they food webs, regulation of genes, or contacts between healthy and infectious individuals--have complex network structure. Wigner's semicircular law and Girko's circular law describe the…
Recently there has been a dramatic increase in the performance of recognition systems due to the introduction of deep architectures for representation learning and classification. However, the mathematical reasons for this success remain…
In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal.…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
One of the great challenges of modern science is to faithfully model, and understand, matter at a wide range of scales. Starting with atoms, the vastness of the space of possible configurations poses a formidable challenge to any simulation…
Deep neural networks drive the success of natural language processing. A fundamental property of language is its compositional structure, allowing humans to systematically produce forms for new meanings. For humans, languages with more…
Optimal gap sequences in Shellsort, defined as gap sequences having the minimised maximum number of comparisons for a fixed number of pairwise distinct elements, are found by minimax search in reduced permutational spaces, namely Bad…
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a…
We present a novel way to characterize the structure of complex networks by studying the statistical properties of the trajectories of random walks over them. We consider time series corresponding to different properties of the nodes…