Statistical Physics of Irregular Low-Density Parity-Check Codes

Low-density parity-check codes with irregular constructions have been recently shown to outperform the most advanced error-correcting codes to date. In this paper we apply methods of statistical physics to study the typical properties of simple irregular codes. We use the replica method to find a phase transition which coincides with Shannon's coding bound when appropriate parameters are chosen. The decoding by belief propagation is also studied using statistical physics arguments; the theoretical solutions obtained are in good agreement with simulations. We compare the performance of irregular with that of regular codes and discuss the factors that contribute to the improvement in performance.Comment: 20 pages, 9 figures, revised version submitted to JP

Enskog Theory for Polydisperse Granular Mixtures. I. Navier-Stokes order Transport

A hydrodynamic description for an $s$-component mixture of inelastic, smooth hard disks (two dimensions) or spheres (three dimensions) is derived based on the revised Enskog theory for the single-particle velocity distribution functions. In this first portion of the two-part series, the macroscopic balance equations for mass, momentum, and energy are derived. Constitutive equations are calculated from exact expressions for the fluxes by a Chapman-Enskog expansion carried out to first order in spatial gradients, thereby resulting in a Navier-Stokes order theory. Within this context of small gradients, the theory is applicable to a wide range of restitution coefficients and densities. The resulting integral-differential equations for the zeroth- and first-order approximations of the distribution functions are given in exact form. An approximate solution to these equations is required for practical purposes in order to cast the constitutive quantities as algebraic functions of the macroscopic variables; this task is described in the companion paper.Comment: 36 pages, to be published in Phys. Rev.

Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels

Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under LDPC network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and the symmetric and asymmetric interference channels. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases.Comment: 25 pages, 7 figure

Pre-harvesting biomass burning for sugarcane crop: comparing emission factors for realist results.

Abstract: In Brazil, burning of residues as an agricultural practice occurs mainly in sugarcane cultivation, which accounts for about 98% of greenhouse gas emissions resulting from the burning of agricultural waste. Emission factors for this specific agricultural management practice came from the combustion processes, were the emission of non-CO2 gases CH4, CO, NOx and N2O were recorded, and the emission rates for these gases depend on the type of biomass and burning conditions. In the combustion with flame phase, N2O and NOx gases are generated, and CO and CH4 gases are formed under burning conditions with a predominance of flame. Thus, the use of specific emission factors for sugarcane, within the Brazilian context, in National Inventories is more appropriate than the use of default emission factors, in addition to increasing the level of refinement of emission estimates. In this context, this work aims to present a comparative analysis of the emission estimates of the non- CO2, CO and NOX gases, using the default emission factors presented in the IPCC Guidelines (2006) and those proposed by França et al. [4], for São Paulo State as a test area

Medium Modification of The Pion-Pion Interaction at Finite Density

We discuss medium modifications of the unitarized pion-pion interaction in the nuclear medium. We incorporate both the effects of chiral symmetry restoration and the influence of collective nuclear pionic modes originating from the p-wave coupling of the pion to delta-hole configurations. We show in particular that the dropping of the sigma meson mass significantly enhances the low energy structure created by the in-medium collective pionic modes.Comment: 26 pages, 7 figures included, Latex fil

Bilinear R-parity violation with flavor symmetry

Bilinear R-parity violation (BRPV) provides the simplest intrinsically supersymmetric neutrino mass generation scheme. While neutrino mixing parameters can be probed in high energy accelerators, they are unfortunately not predicted by the theory. Here we propose a model based on the discrete flavor symmetry $A_4$ with a single R-parity violating parameter, leading to (i) correct Cabbibo mixing given by the Gatto-Sartori-Tonin formula, and a successful unification-like b-tau mass relation, and (ii) a correlation between the lepton mixing angles $\theta_{13}$ and $\theta_{23}$ in agreement with recent neutrino oscillation data, as well as a (nearly) massless neutrino, leading to absence of neutrinoless double beta decay.Comment: 16 pages, 3 figures. Extended version, as published in JHE

Experimental Verification of the Gapless Point in the SS=1 Antiferromagnetic Bond Alternating Chain

Susceptibility and high field magnetization measurements have been performed on powder samples of an $S$=1 bond alternating chain compound [\{Ni(333-tet)($\mu$-N$_3$)\}$_n$](ClO$_4$)$_n$ (333-tet=tetraamine N,N'-bis(3-aminopropyl)-1,3-propanediamine). As the temperature is decreased, the susceptibility exhibits a round maximum at around 120 K and decreases gradually down to 10 K, and then falls down rapidly with a logarithmic curvature which is behavior of the susceptibility of a gapless or a nearly gapless antiferromagnetic chain. Magnetization up to 50 T at 1.4 K shows no or a very small gap in this compound. We have carried out numerical calculations for the $S$=1 antiferromagnetic bond alternating chain with various alternating ratios $\alpha$ and obtained a very good agreement between experiments and calculations for $\alpha$=0.6. We verify experimentally that the gapless point exists around $\alpha$=0.6.Comment: 12 pages, 4 Postscript figures, uses REVTE

A moment based approach to the dynamical solution of the Kuramoto model

We examine the dynamics of the Kuramoto model with a new analytical approach. By defining an appropriate set of moments the dynamical equations can be exactly closed. We discuss some applications of the formalism like the existence of an effective Hamiltonian for the dynamics. We also show how this approach can be used to numerically investigate the dynamical behavior of the model without finite size effects.Comment: 6 pages, 5 figures, Revtex file, to appear in J. Phys.

A parametric integer programming algorithm for bilevel mixed integer programs

We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader's variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case it yields a ``better than fully polynomial time'' approximation scheme with running time polynomial in the logarithm of the relative precision. For the pure integer case where the leader's variables are integer, and hence optimal solutions are guaranteed to exist, we present two algorithms which run in polynomial time when the total number of variables is fixed.Comment: 11 page