arXiv subjects

O. Golinelli

Publications and source records attributed to O. Golinelli.

At least 19 recordsLinked to original sources

arXiv2007

Family of Commuting Operators for the Totally Asymmetric Exclusion Process

The algebraic structure underlying the totally asymmetric exclusion process is studied by using the Bethe Ansatz technique. From the properties of the algebra generated by the local jump operators, we explicitly construct the hierarchy of operators (called generalized hamiltonians) that commute with the Markov operator. The transfer matrix, which is the generating function of these operators, is shown to represent a discrete Markov process with long-range jumps. We give a general combinatorial formula for the connected hamiltonians obtained by taking the logarithm of the transfer matrix. This formula is proved using a symbolic calculation program for the first ten connected operators. Keywords: ASEP, Algebraic Bethe Ansatz. Pacs numbers: 02.30.Ik, 02.50.-r, 75.10.Pq.

cond-mat.stat-mech↗

arXiv2007

Connected Operators for the Totally Asymmetric Exclusion Process

We fully elucidate the structure of the hierarchy of the connected operators that commute with the Markov matrix of the Totally Asymmetric Exclusion Process (TASEP). We prove for the connected operators a combinatorial formula that was conjectured in a previous work. Our derivation is purely algebraic and relies on the algebra generated by the local jump operators involved in the TASEP. Keywords: Non-Equilibrium Statistical Mechanics, ASEP, Exact Results, Algebraic Bethe Ansatz.

cond-mat.stat-mech↗

arXiv2006

The asymmetric simple exclusion process: an integrable model for non-equilibrium statistical mechanics

The asymmetric simple exclusion process (ASEP) plays the role of a paradigm in non-equilibrium statistical mechanics. We review exact results for the ASEP obtained by Bethe ansatz and put emphasis on the algebraic properties of this model. The Bethe equations for the eigenvalues of the Markov matrix of the ASEP are derived from the algebraic Bethe ansatz. Using these equations we explain how to calculate the spectral gap of the model and how global spectral properties such as the existence of multiplets can be predicted. An extension of the Bethe ansatz leads to an analytic expression for the large deviation function of the current in the ASEP that satisfies the Gallavotti-Cohen relation. Finally, we describe some variants of the ASEP that are also solvable by Bethe ansatz. Keywords: ASEP, integrable models, Bethe ansatz, large deviations.

cond-mat.stat-mech↗

arXiv2006

Derivation of a Matrix Product Representation for the Asymmetric Exclusion Process from Algebraic Bethe Ansatz

We derive, using the algebraic Bethe Ansatz, a generalized Matrix Product Ansatz for the asymmetric exclusion process (ASEP) on a one-dimensional periodic lattice. In this Matrix Product Ansatz, the components of the eigenvectors of the ASEP Markov matrix can be expressed as traces of products of non-commuting operators. We derive the relations between the operators involved and show that they generate a quadratic algebra. Our construction provides explicit finite dimensional representations for the generators of this algebra.

cond-mat.stat-mech↗

arXiv2004

Spectral Degeneracies in the Totally Asymmetric Exclusion Process

We study the spectrum of the Markov matrix of the totally asymmetric exclusion process (TASEP) on a one-dimensional periodic lattice at ARBITRARY filling. Although the system does not possess obvious symmetries except translation invariance, the spectrum presents many multiplets with degeneracies of high order. This behaviour is explained by a hidden symmetry property of the Bethe Ansatz. Combinatorial formulae for the orders of degeneracy and the corresponding number of multiplets are derived and compared with numerical results obtained from exact diagonalisation of small size systems. This unexpected structure of the TASEP spectrum suggests the existence of an underlying large invariance group. Keywords: ASEP, Markov matrix, Bethe Ansatz, Symmetries.

cond-mat.stat-mech↗

arXiv2004

Hidden symmetries in the asymmetric exclusion process

We present a spectral study of the evolution matrix of the totally asymmetric exclusion process on a ring at half filling. The natural symmetries (translation, charge conjugation combined with reflection) predict only two fold degeneracies. However, we have found that degeneracies of higher order also exist and, as the system size increases, higher and higher orders appear. These degeneracies become generic in the limit of very large systems. This behaviour can be explained by the Bethe Ansatz and suggests the presence of hidden symmetries in the model. Keywords: ASEP, Markov matrix, symmetries, spectral degeneracies, Bethe Ansatz.

cond-mat.stat-mech↗

arXiv2004

Spectral gap of the totally asymmetric exclusion process at arbitrary filling

We calculate the spectral gap of the Markov matrix of the totally asymmetric simple exclusion process (TASEP) on a ring of L sites with N particles. Our derivation is simple and self-contained and extends a previous calculation that was valid only for half-filling. We use a special property of the Bethe equations for TASEP to reformulate them as a one-body problem. Our method is closely related to the one used to derive exact large deviation functions of the TASEP.

cond-mat.stat-mech↗

arXiv2003

Bethe Ansatz calculation of the spectral gap of the asymmetric exclusion process

We present a new derivation of the spectral gap of the totally asymmetric exclusion process on a half-filled ring of size L by using the Bethe Ansatz. We show that, in the large L limit, the Bethe equations reduce to a simple transcendental equation involving the polylogarithm, a classical special function. By solving that equation, the gap and the dynamical exponent are readily obtained. Our method can be extended to a system with an arbitrary density of particles. Keywords: ASEP, Bethe Ansatz, Dynamical Exponent, Spectral Gap.

cond-mat.stat-mech↗

arXiv2003

Statistics of delta peaks in the spectral density of large random trees

We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo simulations, we have numerical estimations of the heights of peaks. In the large tree limit, the sum of their heights is 0.19173 +- 0.00005. Moreover all associated eigenvectors are strictly localized on a finite number of nodes. The rest of the spectral density is a function which vanishes at all positions of peaks, which are a dense subset of real numbers: so this function is almost everywhere discontinuous. Keywords: random tree, spectral density, density of states, adjacency matrix, localization, delta peak.

cond-mat.dis-nn↗

arXiv2002

Core percolation in random graphs: a critical phenomena analysis

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the "core". In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the number of isolated vertices and the number of vertices and edges in the core. We show that a second order phase transition occurs at "alpha = e = 2.718...": below the transition, the core is small but above the transition, it occupies a finite fraction of the initial graph. The finite size scaling properties are then studied numerically in detail in the critical region, and we propose a consistent set of critical exponents, which does not coincide with the set of standard percolation exponents for this model. We clarify several aspects in combinatorial optimization and spectral properties of the adjacency matrix of random graphs. Key words: random graphs, leaf removal, core percolation, critical exponents, combinatorial optimization, finite size scaling, Monte-Carlo.

cond-mat.stat-mech↗

arXiv2001

Exactly solvable model with two conductor-insulator transitions driven by impurities

We present an exact analysis of two conductor-insulator transitions in the random graph model. The average connectivity is related to the concentration of impurities. The adjacency matrix of a large random graph is used as a hopping Hamiltonian. Its spectrum has a delta peak at zero energy. Our analysis is based on an explicit expression for the height of this peak, and a detailed description of the localized eigenvectors and of their contribution to the peak. Starting from the low connectivity (high impurity density) regime, one encounters an insulator-conductor transition for average connectivity 1.421529... and a conductor-insulator transition for average connectivity 3.154985.... We explain the spectral singularity at average connectivity e=2.718281... and relate it to another enumerative problem in random graph theory, the minimal vertex cover problem.

cond-mat.stat-mech↗

arXiv2001

Random incidence matrices: moments of the spectral density

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the eigenvalue distribution as explicit polynomials in N and p. For large N and fixed p the spectrum contains a large eigenvalue at Np and a semi-circle of "small" eigenvalues. For large N and fixed average connectivity pN (dilute or sparse random matrices limit), we show that the spectrum always contains a discrete component. An anomaly in the spectrum near eigenvalue 0 for connectivity close to e=2.72... is observed. We develop recursion relations to compute the moments as explicit polynomials in pN. Their growth is slow enough so that they determine the spectrum. The extension of our methods to the Laplacian matrix is given in Appendix. Keywords: random graphs, random matrices, sparse matrices, incidence matrices spectrum, moments

cond-mat.stat-mech↗

arXiv2000

On the kernel of tree incidence matrices

We study the height of the delta peak at 0 in the spectrum of random tree incidence matrices. We show that the average fraction of the spectrum occupied by the eigenvalue 0 in a large random tree is asymptotic to 2x-1 = 0.1342865808195677459999... where x is the unique real root of x = exp(-x). For finite trees, we give a closed form, a generating function, and an asymptotic estimate for the sequence 1,0,3,8,135,1164,21035,.... of the total multiplicity of the eigenvalue 0 in the set of n^{n-2} tree incidence matrices of size n>0.

cond-mat.stat-mech↗

arXiv2000

Meanders: Exact Asymptotics

We conjecture that meanders are governed by the gravitational version of a c=-4 two-dimensional conformal field theory, allowing for exact predictions for the meander configuration exponent α=\sqrt{29}(\sqrt{29}+\sqrt{5})/12, and the semi-meander exponent {\barα}=1+\sqrt{11}(\sqrt{29}+\sqrt{5})/24. This result follows from an interpretation of meanders as pairs of fully packed loops on a random surface, described by two c=-2 free fields. The above values agree with recent numerical estimates. We generalize these results to a score of meandric numbers with various geometries and arbitrary loop fugacities.

cond-mat.stat-mech↗

arXiv1999

A Monte-Carlo study of meanders

We study the statistics of meanders, i.e. configurations of a road crossing a river through "n" bridges, and possibly winding around the source, as a toy model for compact folding of polymers. We introduce a Monte-Carlo method which allows us to simulate large meanders up to n = 400. By performing large "n" extrapolations, we give asymptotic estimates of the connectivity per bridge R = 3.5018(3), the configuration exponent gamma = 2.056(10), the winding exponent nu = 0.518(2) and other quantities describing the shape of meanders. Keywords : folding, meanders, Monte-Carlo, tree

cond-mat.stat-mech↗

arXiv1999

Une methode Monte-Carlo pour les meandres sur ordinateur parallele

Pour modeliser le repliement compact d'un polymere, on etudie la statistique des meandres, definis comme configurations d'un circuit automobile traversant n fois une riviere. Grace a une methode Monte-Carlo adaptee a un ordinateur massivement parallele, les meandres sont simules jusqu'a la taille n=400. Le comportement asymptotique du denombrement et de l'enroulement moyen des meandres sont presentes.

cond-mat.stat-mech↗

arXiv1998

Incommensurability in the magnetic excitations of the bilinear-biquadratic spin-1 chain

We study the magnetic excitation spectrum of the S=1 quantum Heisenberg spin chain with Hamiltonian : H = sum_i cos(theta) S_i S_i+1 + sin(theta) (S_i S_i+1)^2. We focus on the range -pi/4 < theta < +pi/4 where the spin chain is in the gapped Haldane phase. The excitation spectrum and static structure factor is studied using direct Lanczos diagonalization of small systems and density-matrix renormalization group techniques combined with the single-mode approximation. The magnon dispersion has a minimum at q=pi until a critical value theta_c = 0.38 is reached at which the curvature (velocity) vanishes. Beyond this point, which is distinct from the VBS point and the Lifshitz point, the minimum lies at an incommensurate value that goes smoothly to 2pi/3 when theta approaches pi/4, the Lai-Sutherland point. The mode remains isolated from the other states: there is no evidence of spinon deconfinement before the point theta =+pi/4. These findings explain recent observation of the magnetization curve M approx (H -H_c)^1/4 for theta =theta_c.

cond-mat.str-el↗

arXiv1997

Phases of random antiferromagnetic spin-1 chains

We formulate a real-space renormalization scheme that allows the study of the effects of bond randomness in the Heisenberg antiferromagnetic spin-1 chain. There are four types of bonds that appear during the renormalization flow. We implement numerically the decimation procedure. We give a detailed study of the probability distributions of all these bonds in the phases that occur when the strength of the disorder is varied. Approximate flow equations are obtained in the weak-disorder regime as well as in the strong disorder case where the physics is that of the random singlet phase.

cond-mat.str-el↗