Ferromagnetic ordering in graphs with arbitrary degree distribution

We present a detailed study of the phase diagram of the Ising model in random graphs with arbitrary degree distribution. By using the replica method we compute exactly the value of the critical temperature and the associated critical exponents as a function of the minimum and maximum degree, and the degree distribution characterizing the graph. As expected, there is a ferromagnetic transition provided < \infty. However, if the fourth moment of the degree distribution is not finite then non-trivial scaling exponents are obtained. These results are analyzed for the particular case of power-law distributed random graphs.Comment: 9 pages, 1 figur

Number of loops of size h in growing scale-free networks

The hierarchical structure of scale-free networks has been investigated focusing on the scaling of the number $N_h(t)$ of loops of size h as a function of the system size. In particular we have found the analytic expression for the scaling of $N_h(t)$ in the Barab\'asi-Albert (BA) scale-free network. We have performed numerical simulations on the scaling law for $N_h(t)$ in the BA network and in other growing scale free networks, such as the bosonic network (BN) and the aging nodes (AN) network. We show that in the bosonic network and in the aging node network the phase transitions in the topology of the network are accompained by a change in the scaling of the number of loops with the system size.Comment: 4 pages, 3 figure

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.Comment: 23 pages, 8 figure

Bond tests on clay bricks and natural stone masonry externally bonded with frp

Nowadays, the solution of durability problems of existing buildings has a key role in civil engineering, in which there is an ever-increasing need for building restorations. Over the past 50 years, there is a growing interest in a new composite material, fibre-reinforced polymer (FRP), suitable for increasing the resistance and the stability of existing buildings and, consequently, for extending their service life. In this context, the effectiveness of the strengthening system is related to the bond behaviour that is influenced by several parameters such as bond length, the stiffness of the reinforcement, the mechanical properties of the substrate, environmental conditions, etc. This paper aims to analyse the main experimental results from shear tests performed on two kinds of masonry substrates and different types of FRP reinforcements. The purpose is to highlight the role played by many parameters to the bond behaviour of these systems: the mechanical properties of substrates; the stiffness of reinforcements; the type of supports (i.e., unit or masonry unit). The obtained experimental results underlined that the specimens realised with masonry unit show an increase in debonding load and different stress transfer mechanisms along the bonded length with respect to the specimens with a unit substrate. The analysis of the data revealed that the presence of mortar joints cannot be neglected because it influences the interface global performance

A Backtracking-Based Algorithm for Computing Hypertree-Decompositions

Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tractability of the encoded computation problem. Many NP-hard decision and computation problems are known to be tractable on instances whose structure corresponds to hypergraphs of bounded hypertree-width. Intuitively, the smaller the hypertree-width, the faster the computation problem can be solved. In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations have shown that det-k-decomp significantly outperforms opt-k-decomp, the only exact hypertree decomposition algorithm so far. Even compared to the best heuristic algorithm, we obtained competitive results as long as the hypergraphs are not too large.Comment: 19 pages, 6 figures, 3 table

A search for magnetic fields on central stars in planetary nebulae

One of the possible mechanisms responsible for the panoply of shapes in planetary nebulae is the presence of magnetic fields that drive the ejection of ionized material during the proto-planetary nebula phase. Therefore, detecting magnetic fields in such objects is of key importance for understanding their dynamics. Still, magnetic fields have not been detected using polarimetry in the central stars of planetary nebulae. Circularly polarized light spectra have been obtained with the Focal Reducer and Low Dispersion Spectrograph at the Very Large Telescope of the European Southern Observatory and the Intermediate dispersion Spectrograph and Imaging System at the William Herschel Telescope. Nineteen planetary nebulae spanning very different morphology and evolutionary stages have been selected. Most of central stars have been observed at different rotation phases to point out evidence of magnetic variability. In this paper, we present the result of two observational campaigns aimed to detect and measure the magnetic field in the central stars of planetary nebulae on the basis of low resolution spectropolarimetry. In the limit of the adopted method, we can state that large scale fields of kG order are not hosted on the central star of planetary nebulae.Comment: Paper accepted to be published in Astronomy and Astrophysics on 20/01/201

Mean-Field and Anomalous Behavior on a Small-World Network

We use scaling results to identify the crossover to mean-field behavior of equilibrium statistical mechanics models on a variant of the small world network. The results are generalizable to a wide-range of equilibrium systems. Anomalous scaling is found in the width of the mean-field region, as well as in the mean-field amplitudes. Finally, we consider non-equilibrium processes.Comment: 4 pages, 0 figures; reference adde

Ku & C Band solid state switch matrix for satellite payloads using LTCC multilayer substrate

This paper describes the design and development of Ku and C band solid state switch matrix for multimedia satellite payloads. The design, through the use of advanced packaging techniques, allows significant savings on mass and volume with respect to traditional electromechanical switches while guaranteeing a comparable reliability