Topological properties and fractal analysis of a recurrence network constructed from fractional Brownian motions

Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the average degree exponent 〈λ〉 increases first and then decreases with the increase of Hurst index H of the associated FBMs; the relationship between H and 〈λ〉 can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e., the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension 〈dB〉 of recurrence networks decreases with the Hurst index H of the associated FBMs, and their dependence approximately satisfies the linear formula 〈dB〉≈2-H, which means that the fractal dimension of the associated recurrence network is close to that of the graph of the FBM. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index H=0.5 possesses the strongest multifractality. In addition, the dependence relationships of the average information dimension 〈D(1)〉 and the average correlation dimension 〈D(2)〉 on the Hurst index H can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic and the fractal nature of the associated FBM series.

Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes

We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Distinct Biochemical and Topological Properties of the 31- and 27-Kilodalton Plasma Membrane Intrinsic Protein Subgroups from Red Beet1

Plasma membrane vesicles from red beet (Beta vulgaris L.) storage tissue contain two prominent major intrinsic protein species of 31 and 27 kD (X. Qi, C.Y Tai, B.P. Wasserman [1995] Plant Physiol 108: 387–392). In this study affinity-purified antibodies were used to investigate their localization and biochemical properties. Both plasma membrane intrinsic protein (PMIP) subgroups partitioned identically in sucrose gradients; however, each exhibited distinct properties when probed for multimer formation, and by limited proteolysis. The tendency of each PMIP species to form disulfide-linked aggregates was studied by inclusion of various sulfhydryl agents during tissue homogenization and vesicle isolation. In the absence of dithiothreitol and sulfhydryl reagents, PMIP27 yielded a mixture of monomeric and aggregated species. In contrast, generation of a monomeric species of PMIP31 required the addition of dithiothreitol, iodoacetic acid, or N-ethylmaleimide. Mixed disulfide-linked heterodimers between the PMIP31 and PMIP27 subgroups were not detected. Based on vectorial proteolysis of right-side-out vesicles with trypsin and hydropathy analysis of the predicted amino acid sequence derived from the gene encoding PMIP27, a topological model for a PMIP27 was established. Two exposed tryptic cleavage sites were identified from proteolysis of PMIP27, and each was distinct from the single exposed site previously identified in surface loop C of a PMIP31. Although the PMIP31 and PMIP27 species both contain integral proteins that appear to occur within a single vesicle population, these results demonstrate that each PMIP subgroup responds differently to perturbations of the membrane.

Topological analysis off charge density distribution in concomitant polymorphs of 3-acetylcoumarin, a case off packing polymorphism

Detailed investigation of the charge density distribution in concomitant polymorphs of 3-acetylcoumarin in terms of experimental and theoretical densities shows significant differences in the intermolecular features when analyzed based on the topological properties via the quantum theory of atoms in molecules. The two forms, triclinic and monoclinic (Form A and Form B), pack in the crystal lattice via weak C-H---O and C-H---pi interactions. Form A results in a head-to-head molecular stack, while Form B generates a head-to-tail stack. Form A crystallizes in PI (Z' = 2) and Form B crystallizes in P2(1)/n (Z = 1). The electron density maps of the polymorphs demonstrate the differences in the nature of the charge density distribution in general. The charges derived from experimental and theoretical analysis show significant differences with respect to the polymorphic forms. The molecular dipole moments differ significantly for the two forms. The lattice energies evaluated at the HF and DFT (B3LYP) methods with 6-31G** basis set for the two forms clearly suggest that Form A is the thermodynamically stable form as compared to Form B. Mapping of electrostatic potential over the molecular surface shows dominant variations in the electronegative region, which bring out the differences between the two forms.

Topological phases, Majorana modes and quench dynamics in a spin ladder system

We explore the salient features of the `Kitaev ladder', a two-legged ladder version of the spin-1/2 Kitaev model on a honeycomb lattice, by mapping it to a one-dimensional fermionic p-wave superconducting system. We examine the connections between spin phases and topologically non-trivial phases of non-interacting fermionic systems, demonstrating the equivalence between the spontaneous breaking of global Z(2) symmetry in spin systems and the existence of isolated Majorana modes. In the Kitaev ladder, we investigate topological properties of the system in different sectors characterized by the presence or absence of a vortex in each plaquette of the ladder. We show that vortex patterns can yield a rich parameter space for tuning into topologically non-trivial phases. We introduce and employ a new topological invariant for explicitly determining the presence of zero energy Majorana modes at the boundaries of such phases. Finally, we discuss dynamic quenching between topologically non-trivial phases in the Kitaev ladder and, in particular, the post-quench dynamics governed by tuning through a quantum critical point.

Intermolecular interactions, charge-density distribution and the electrostatic properties of pyrazinamide anti-TB drug molecule: an experimental and theoretical charge-density study

An experimental charge-density analysis of pyrazinamide (a first line antitubercular drug) was performed using high-resolution X-ray diffraction data (sin theta/lambda)(max) = 1.1 angstrom(-1)] measured at 100 (2) K. The structure was solved by direct methods using SHELXS97 and refined by SHELXL97. The total electron density of the pyrazinamide molecule was modeled using the Hansen-Coppens multipole formalism implemented in the XD software. The topological properties of electron density determined from the experiment were compared with the theoretical results obtained from CRYSTAL09 at the B3LYP/6-31G** level of theory. The crystal structure was stabilized by N-H center dot center dot center dot N and N-H center dot center dot center dot O hydrogen bonds, in which the N3-H3B center dot center dot center dot N1 and N3-H3A center dot center dot center dot O1 interactions form two types of dimers in the crystal. Hirshfeld surface analysis was carried out to analyze the intermolecular interactions. The fingerprint plot reveals that the N center dot center dot center dot H and O center dot center dot center dot H hydrogen-bonding interactions contribute 26.1 and 18.4%, respectively, of the total Hirshfeld surface. The lattice energy of the molecule was calculated using density functional theory (B3LYP) methods with the 6-31G** basis set. The molecular electrostatic potential of the pyrazinamide molecule exhibits extended electronegative regions around O1, N1 and N2. The existence of a negative electrostatic potential (ESP) region just above the upper and lower surfaces of the pyrazine ring confirm the pi-electron cloud.

Topological structure of the many vortices solution in Jackiw-Pi model

By using the gauge potential decomposition, we discuss the self-dual equation and its solution in Jackiw-Pi model. We obtain a new concrete self-dual equation and find relationship between Chern-Simons vortices solution and topological number which is determined by Hopf indices and Brouwer degrees of Psi-mapping. To show the meaning of topological number we give several figures with different topological numbers. In order to investigate the topological properties of many vortices, we use five parameters (two positions, one scale, one phase per vortex and one charge of each vortex) to describe each vortex in many vortices solutions in Jackiw-Pi model. For many vortices, we give three figures with different topological numbers to show the effect of the charge on the many vortices solutions. We also study the quantization of flux of those vortices related to the topological numbers in this case.

Topological constraints on scroll and spiral waves in excitable media

A conservation equation for topological charges of phase singularities (scroll and spiral waves) in excitable media is given. It provides some topological properties of scroll (spiral) waves: for example, the topological charge of the generated or annihilated spiral pair must be opposite. Additionally, we obtain another equation on scroll waves, which shows that singular filaments of scroll waves occur on a set of one-dimensional curves which may be either closed loops or infinite lines.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Topological aspects of the human protein interaction network

It is currently widely accepted that the understanding of complex cell functions depends on an integrated network theoretical approach and not on an isolated view of the different molecular agents. Aim of this thesis was the examination of topological properties that mirror known biological aspects by depicting the human protein network with methods from graph- and network theory. The presented network is a partial human interactome of 9222 proteins and 36324 interactions, consisting of single interactions reliably extracted from peer-reviewed scientific publications. In general, one can focus on intra- or intermodular characteristics, where a functional module is defined as "a discrete entity whose function is separable from those of other modules". It is found that the presented human network is also scale-free and hierarchically organised, as shown for yeast networks before. The interactome also exhibits proteins with high betweenness and low connectivity which are biologically analyzed and interpreted here as shuttling proteins between organelles (e.g. ER to Golgi, internal ER protein translocation, peroxisomal import, nuclear pores import/export) for the first time. As an optimisation for finding proteins that connect modules, a new method is developed here based on proteins located between highly clustered regions, rather than regarding highly connected regions. As a proof of principle, the Mediator complex is found in first place, the prime example for a connector complex. Focusing on intramodular aspects, the measurement of k-clique communities discriminates overlapping modules very well. Twenty of the largest identified modules are analysed in detail and annotated to known biological structures (e.g. proteasome, the NFκB-, TGF-β complex). Additionally, two large and highly interconnected modules for signal transducer and transcription factor proteins are revealed, separated by known shuttling proteins. These proteins yield also the highest number of redundant shortcuts (by calculating the skeleton), exhibit the highest numbers of interactions and might constitute highly interconnected but spatially separated rich-clubs either for signal transduction or for transcription factors. This design principle allows manifold regulatory events for signal transduction and enables a high diversity of transcription events in the nucleus by a limited set of proteins. Altogether, biological aspects are mirrored by pure topological features, leading to a new view and to new methods that assist the annotation of proteins to biological functions, structures and subcellular localisations. As the human protein network is one of the most complex networks at all, these results will be fruitful for other fields of network theory and will help understanding complex network functions in general.