Factor PD-Clustering

Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion. Factorial PD-clustering is based on Probabilistic Distance clustering (PD-clustering). PD-clustering is an iterative, distribution free, probabilistic, clustering method. Factor PD-clustering make a linear transformation of original variables into a reduced number of orthogonal ones using a common criterion with PD-Clustering. It is demonstrated that Tucker 3 decomposition allows to obtain this transformation. Factor PD-clustering makes alternatively a Tucker 3 decomposition and a PD-clustering on transformed data until convergence. This method could significantly improve the algorithm performance and allows to work with large dataset, to improve the stability and the robustness of the method

Generalised Bose-Einstein phase transition in large-mm component spin glasses

It is proposed to understand finite dimensional spin glasses using a $1/m$ expansion, where $m$ is the number of spin components. It is shown that this approach predicts a replica symmetric state in finite dimensions. The point about which the expansion is made, the infinite-$m$ limit, has been studied in the mean-field limit in detail and has a very unusual phase transition, rather similar to a Bose-Einstein phase transition but with $N^{2/5}$ macroscopically occupied low-lying states.Comment: 4 pages (plus a few lines), 3 figures. v2: minor error corrected. v3: numerics supplemented by analytical arguments, references added, figure of density of states adde

Chern-Simons theory of multi-component quantum Hall systems

The Chern-Simons approach has been widely used to explain fractional quantum Hall states in the framework of trial wave functions. In the present paper, we generalise the concept of Chern-Simons transformations to systems with any number of components (spin or pseudospin degrees of freedom), extending earlier results for systems with one or two components. We treat the density fluctuations by adding auxiliary gauge fields and appropriate constraints. The Hamiltonian is quadratic in these fields and hence can be treated as a harmonic oscillator Hamiltonian, with a ground state that is connected to the Halperin wave functions through the plasma analogy. We investigate several conditions on the coefficients of the Chern-Simons transformation and on the filling factors under which our model is valid. Furthermore, we discuss several singular cases, associated with symmetric states.Comment: 11 pages, shortened version, accepted for publication in Phys. Rev.

Optimal synchronization of directed complex networks

We study optimal synchronization of networks of coupled phase oscillators. We extend previous theory for optimizing the synchronization properties of undirected networks to the important case of directed networks. We derive a generalized synchrony alignment function that encodes the interplay between network structure and the oscillators' natural frequencies and serves as an objective measure for the network's degree of synchronization. Using the generalized synchrony alignment function, we show that a network's synchronization properties can be systematically optimized. This framework also allows us to study the properties of synchrony-optimized networks, and in particular, investigate the role of directed network properties such as nodal in- and out-degrees. For instance, we find that in optimally rewired networks the heterogeneity of the in-degree distribution roughly matches the heterogeneity of the natural frequency distribution, but no such relationship emerges for out-degrees. We also observe that a network's synchronization properties are promoted by a strong correlation between the nodal in-degrees and the natural frequencies of oscillators, whereas the relationship between the nodal out-degrees and the natural frequencies has comparatively little effect. This result is supported by our theory, which indicates that synchronization is promoted by a strong alignment of the natural frequencies with the left singular vectors corresponding to the largest singular values of the Laplacian matrix

Quantum process reconstruction based on mutually unbiased basis

We study a quantum process reconstruction based on the use of mutually unbiased projectors (MUB-projectors) as input states for a D-dimensional quantum system, with D being a power of a prime number. This approach connects the results of quantum-state tomography using mutually unbiased bases (MUB) with the coefficients of a quantum process, expanded in terms of MUB-projectors. We also study the performance of the reconstruction scheme against random errors when measuring probabilities at the MUB-projectors.Comment: 6 pages, 1 figur

Dynamic Effects Increasing Network Vulnerability to Cascading Failures

We study cascading failures in networks using a dynamical flow model based on simple conservation and distribution laws to investigate the impact of transient dynamics caused by the rebalancing of loads after an initial network failure (triggering event). It is found that considering the flow dynamics may imply reduced network robustness compared to previous static overload failure models. This is due to the transient oscillations or overshooting in the loads, when the flow dynamics adjusts to the new (remaining) network structure. We obtain {\em upper} and {\em lower} limits to network robustness, and it is shown that {\it two} time scales $\tau$ and $\tau_0$, defined by the network dynamics, are important to consider prior to accurately addressing network robustness or vulnerability. The robustness of networks showing cascading failures is generally determined by a complex interplay between the network topology and flow dynamics, where the ratio $\chi=\tau/\tau_0$ determines the relative role of the two of them.Comment: 4 pages Latex, 4 figure

Anomalous suppression of the shot noise in a nanoelectromechanical system

In this paper we report a relaxation-induced suppression of the noise for a single level quantum dot coupled to an oscillator with incoherent dynamics in the sequential tunneling regime. It is shown that relaxation induces qualitative changes in the transport properties of the dot, depending on the strength of the electron-phonon coupling and on the applied voltage. In particular, critical thresholds in voltage and relaxation are found such that a suppression below 1/2 of the Fano factor is possible. Additionally, the current is either enhanced or suppressed by increasing relaxation, depending on bias being greater or smaller than the above threshold. These results exist for any strength of the electron-phonon coupling and are confirmed by a four states toy model.Comment: 7 pages, 7 eps figures, submitted to PRB; minor changes in the introductio

The Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary

We consider the dimer-monomer problem for the rectangular lattice. By mapping the problem into one of close-packed dimers on an extended lattice, we rederive the Tzeng-Wu solution for a single monomer on the boundary by evaluating a Pfaffian. We also clarify the mathematical content of the Tzeng-Wu solution by identifying it as the product of the nonzero eigenvalues of the Kasteleyn matrix.Comment: 4 Pages to appear in the Physical Review E (2006

Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices

The family of Vicsek fractals is one of the most important and frequently-studied regular fractal classes, and it is of considerable interest to understand the dynamical processes on this treelike fractal family. In this paper, we investigate discrete random walks on the Vicsek fractals, with the aim to obtain the exact solutions to the global mean first-passage time (GMFPT), defined as the average of first-passage time (FPT) between two nodes over the whole family of fractals. Based on the known connections between FPTs, effective resistance, and the eigenvalues of graph Laplacian, we determine implicitly the GMFPT of the Vicsek fractals, which is corroborated by numerical results. The obtained closed-form solution shows that the GMFPT approximately grows as a power-law function with system size (number of all nodes), with the exponent lies between 1 and 2. We then provide both the upper bound and lower bound for GMFPT of general trees, and show that leading behavior of the upper bound is the square of system size and the dominating scaling of the lower bound varies linearly with system size. We also show that the upper bound can be achieved in linear chains and the lower bound can be reached in star graphs. This study provides a comprehensive understanding of random walks on the Vicsek fractals and general treelike networks.Comment: Definitive version accepted for publication in Physical Review

On a new conformal functional for simplicial surfaces

We introduce a smooth quadratic conformal functional and its weighted version $$W_2=\sum_e \beta^2(e)\quad W_{2,w}=\sum_e (n_i+n_j)\beta^2(e),$$ where $\beta(e)$ is the extrinsic intersection angle of the circumcircles of the triangles of the mesh sharing the edge $e=(ij)$ and $n_i$ is the valence of vertex $i$. Besides minimizing the squared local conformal discrete Willmore energy $W$ this functional also minimizes local differences of the angles $\beta$. We investigate the minimizers of this functionals for simplicial spheres and simplicial surfaces of nontrivial topology. Several remarkable facts are observed. In particular for most of randomly generated simplicial polyhedra the minimizers of $W_2$ and $W_{2,w}$ are inscribed polyhedra. We demonstrate also some applications in geometry processing, for example, a conformal deformation of surfaces to the round sphere. A partial theoretical explanation through quadratic optimization theory of some observed phenomena is presented.Comment: 14 pages, 8 figures, to appear in the proceedings of "Curves and Surfaces, 8th International Conference", June 201