Algorithm for parametric community detection in networks.

Modularity maximization is extensively used to detect communities in complex networks. It has been shown, however, that this method suffers from a resolution limit: Small communities may be undetectable in the presence of larger ones even if they are very dense. To alleviate this defect, various modifications of the modularity function have been proposed as well as multiresolution methods.

Comment on "Evolutionary method for finding communities in bipartite networks".

In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E 83, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the discovery of maximum modularity partitions of the node set into communities in unipartite, bipartite, and directed networks.

Locally optimal heuristic for modularity maximization of networks.

Community detection in networks based on modularity maximization is currently done with hierarchical divisive or agglomerative as well as partitioning heuristics, hybrids, and, in a few papers, exact algorithms. We consider here the case of hierarchical networks in which communities should be detected and propose a divisive heuristic which is locally optimal in the sense that each of the successive bipartitions is done in a provably optimal way. This heuristic is compared with the spectral-based hierarchical divisive heuristic of Newman [Proc.

Traditional First Nations birthing practices: interviews with elders in Northwestern Ontario.

Objectives: Traditionally, First Nations maternity care was provided by community-based midwives trained through apprenticeship. Obstetrical practices and beliefs were integrated to provide holistic care. The Sioux Lookout Meno Ya Win Health Centre has a mandate to be a centre of excellence for Aboriginal health care.

Column generation algorithms for exact modularity maximization in networks.

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev.

Loops and multiple edges in modularity maximization of networks.

The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loops and multiple edges. However, the applications usually correspond to simple graphs. These graphs are compared to a null model where the degree distribution is maintained but edges are placed at random.

Edge ratio and community structure in networks.

A hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of community in the weak sense of Radicchi [Proc. Natl.

Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees.

Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees.

Identification of all steady states in large networks by logical analysis.

The goal of generalized logical analysis is to model complex biological systems, especially so-called regulatory systems, such as genetic networks. This theory is mainly characterized by its capacity to find all the steady states of a given system and the functional positive and negative circuits, which generate multistationarity and a cycle in the state sequence graph, respectively. So far, this has been achieved by exhaustive enumeration, which severely limits the size of the systems that can be analysed.

A survey and new results on computer enumeration of polyhex and fusene hydrocarbons.

After a short historic review, we briefly describe a new algorithm for constructive enumeration of polyhex and fusene hydrocarbons. In this process our algorithm also enumerates isomers and symmetry groups of molecules (which implies enumeration of enantiomers). Contrary to previous methods often based on the boundary code or its variants (which records orientation of edges along the boundary) or on the DAST code, which uses a rigid dualist graph (whose vertices are associated with faces and edges with adjacency between them), the proposed algorithm proceeds in two phases.

Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index.

Recently, Araujo and De la Peña gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramification index of trees. They also gave bounds for the connectivity index of chemical graphs as a function of this index for maximal subgraphs which are trees and the cyclomatic number of the graphs. The ramification index of a tree is first shown to be equal to the number of pending vertices minus 2.