Increasing entanglement through engineered disorder in the random Ising chain

The ground-state entanglement entropy between block of sites in the random Ising chain is studied by means of the Von Neumann entropy. We show that in presence of strong correlations between the disordered couplings and local magnetic fields the entanglement increases and becomes larger than in the ordered case. The different behavior with respect to the uncorrelated disordered model is due to the drastic change of the ground state properties. The same result holds also for the random three-state quantum Potts model.

Detecting Anomalies in Graphs with Numeric Labels

This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-related examples and validated with experiments on a physical Access Control database. Quantitative analysis shows that in the upper range of anomaly thresholds, Yagada detects twice as many anomalies as the best-performing numeric discretization algorithm. Qualitative evaluation shows that the detected anomalies are meaningful, representing a com- bination of structural irregularities and numerical outliers.

Combined antenna and localized plasmon resonance in Raman scattering from Random arrays of silver-coated, vertically aligned multiwalled carbon nanotubes

The electric field enhancement associated with detailed structure within novel optical antenna nanostructures is modeled using the surface integral equation technique in the context of surface-enhanced Raman scattering (SERS). The antennae comprise random arrays of vertically aligned, multi-walled carbon nanotubes dressed with highly granular Ag. Different types of "hot-spot" underpinning the SERS are identified, but contrasting characteristics are revealed. Those at the outer edges of the Ag grains are antenna driven with field enhancement amplified in antenna antinodes while intergrain hotspots are largely independent of antenna activity. Hot-spots between the tops of antennae leaning towards each other also appear to benefit from antenna amplification.

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

A comparative analysis of multidimensional features of objects resembling sets of graphs

In the present paper, we introduce a notion of a style representing abstract, complex objects having characteristics that can be represented as structured objects. Furthermore, we provide some mathematical properties of such styles. As a main result, we present a novel approach to perform a meaningful comparative analysis of such styles by defining and using graph-theoretic measures. We compare two styles by comparing the underlying feature sets representing sets of graph structurally. To determine the structural similarity between the underlying graphs, we use graph similarity measures that are computationally efficient. More precisely, in order to compare styles, we map each feature set to a so-called median graph and compare the resulting median graphs. As an application, we perform an experimental study to compare special styles representing sets of undirected graphs and present numerical results thereof. (C) 2007 Elsevier Inc. All rights reserved.

Topological mappings between graphs, trees and generalized trees

We present novel topological mappings between graphs, trees and generalized trees that means between structured objects with different properties. The two major contributions of this paper are, first, to clarify the relation between graphs, trees and generalized trees, a graph class recently introduced. Second, these transformations provide a unique opportunity to transform structured objects into a representation that might be beneficial for a processing, e.g., by machine learning techniques for graph classification. (c) 2006 Elsevier Inc. All rights reserved.

Comparing large graphs efficiently by margins of feature vectors

Measuring the structural similarity of graphs is a challenging and outstanding problem. Most of the classical approaches of the so-called exact graph matching methods are based on graph or subgraph isomorphic relations of the underlying graphs. In contrast to these methods in this paper we introduce a novel approach to measure the structural similarity of directed and undirected graphs that is mainly based on margins of feature vectors representing graphs. We introduce novel graph similarity and dissimilarity measures, provide some properties and analyze their algorithmic complexity. We find that the computational complexity of our measures is polynomial in the graph size and, hence, significantly better than classical methods from, e.g. exact graph matching which are NP-complete. Numerically, we provide some examples of our measure and compare the results with the well-known graph edit distance. (c) 2006 Elsevier Inc. All rights reserved.

Susceptibility of VLDL to oxidation in patients on regular haemodialysis

Oxidation of VLDL in vitro increases macrophage uptake and promotes foam cell formation, and the dyslipidaemia of chronic renal failure is characterised by an increase in VLDL. However, little information is available with regard to the susceptibility of VLDL to oxidation in patients at increased risk of atherosclerosis. We have therefore assessed the composition and susceptibility to oxidation of VLDL from haemodialysis patients anti control subjects. VLDL from haemodialysis patients contained increased lipid hydroperoxides (81.6 +/- 12.6 versus 16.1 +/- 3.4 nmol/mg protein, P

Random neighbor sandpile model with constrained total energy

We propose as energy-constrained sandpile model with random neighbors. The critical behavior of the model is in the same universality class as the mean-field self-organized criticality sandpile. The critical energy E-c depends on the number of neighbors n of each site, but the various exponents do not. For n = 6, we got that E-c = 0.4545; and a self-similar structure of the energy distribution function with five major peaks is also observed. This is a natural result of system dynamics and the way the system is disturbed.

Universality and self-similarity of an energy-constrained sandpile model with random neighbors

We study an energy-constrained sandpile model with random neighbors. The critical behavior of the model is in the same universality class as the mean-field self-organized criticality sandpile. The critical energy E-c depends on the number of neighbors n for each site, but the various exponents are independent of n. A self-similar structure with n-1 major peaks is developed for the energy distribution p(E) when the system approaches its stationary state. The avalanche dynamics contributes to the major peaks appearing at E-Pk = 2k/(2n - 1) with k = 1,2,...,n-1, while the fine self-similar structure is a natural result of the way the system is disturbed. [S1063-651X(99)10307-6].