SearcharxivSearch

arXiv subjects

J. M. Luck

Publications and source records attributed to J. M. Luck.

At least 19 recordsLinked to original sources

Zeta-regularization and natural boundaries: Sums and products of integers and primes

Euler regularized the divergent product of all natural numbers and found beautiful formulas for regularized sums of integer powers of natural numbers. These derivations essentially relied on what is now called the zeta-regularization technique, although analytical continuation had not yet been invented. This classic method is however not applicable to the product of all primes, as the prime zeta function has a natural boundary along the imaginary axis. Mu\~noz Garc\'ia and P\'erez-Marco overcame this obstacle and evaluated the product of all primes to $4\pi^2$ by finding an appropriately regularized value of the derivative of the prime zeta function at the origin, lying on the natural boundary. We extend their approach in two novel directions. First, we show how to make sense of the sum of all primes. This regularization requires going a finite distance beyond the natural boundary. Second, we determine the regularized products of integers and primes in the nine imaginary quadratic fields where integers have a unique factorization into primes, and establish a general power-law relationship between products of integers and primes. Two well-known examples are Gauss and Eisenstein integers. The interest in this approach goes beyond number theory. In a variety of physical situations, the zeta-regularization technique is indeed not applicable because the relevant zeta function has a natural boundary.

math.NT

Regularized products of Gauss and Eisenstein integers and primes

We provide heuristic computations \`a la Euler of the regularized infinite products of Gauss and Eisenstein integers and primes. Our approach, yielding explicit expressions, is inspired by the work by Mu\~noz Garc\'ia and P\'erez-Marco, who evaluated the product of all natural primes to $4\pi^2$.

math.NT

A renewal approach to configurational entropy in one dimension

We introduce a novel approach, inspired from the theory of renewal processes, to determine the configurational entropy of ensembles of constrained configurations of particles on the one-dimensional lattice. The proposed method can deal with all local rules involving only the lengths of clusters of occupied and empty sites. Within this scope, this method is both more systematic and easier to implement than the transfer-matrix approach. It is illustrated in detail on the $k$-mer deposition model and on ensembles of trapped Rydberg atoms with blockade range $b$.

cond-mat.stat-mech

Jamming and metastability in one dimension: from the kinetically constrained Ising chain to the Riviera model

The Ising chain with kinetic constraints provides many examples of totally irreversible zero-temperature dynamics leading to metastability with an exponentially large number of attractors. In most cases, the constrained zero-temperature dynamics can be mapped onto a model of random sequential adsorption. We provide a brief didactic review, based on the example of the constrained Glauber-Ising chain, of the exact results on the dynamics of these models and on their attractors that have been obtained by means of the above mapping. The Riviera model introduced recently by Puljiz et al. behaves similarly to the kinetically constrained Ising chains. This totally irreversible deposition model however does not enjoy the shielding property characterising models of random sequential adsorption. It can therefore neither be mapped onto such a model nor (in all likelihood) be solved by analytical means. We present a range of novel results on the attractors of the Riviera model, obtained by means of an exhaustive enumeration for smaller systems and of extensive simulations for larger ones, and put these results in perspective with the exact ones which are available for kinetically constrained Ising chains.

cond-mat.stat-mech

On multidimensional record patterns

Multidimensional record patterns are random sets of lattice points defined by means of a recursive stochastic construction. The patterns thus generated owe their richness to the fact that the construction is not based on a total order, except in one dimension, where usual records in sequences of independent random variables are recovered. We derive many exact results on the statistics of multidimensional record patterns on finite samples drawn on hypercubic lattices in any dimension $D$. The most detailed analysis concerns the two-dimensional situation, where we also investigate the distribution of the landing position of the record point which is closest to the origin. Asymptotic expressions for the full distribution and the moments of the number of records on large hypercubic samples are also obtained. The latter distribution is related to that of the largest of $D$ standard Gaussian variables.

cond-mat.stat-mech

Parrondo games as disordered systems

Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the millennium. The common setting of these Parrondo games is that two rules, $A$ and $B$, are played at discrete time steps, following either a periodic pattern or an aperiodic one, be it deterministic or random. These games can be mapped onto 1D random walks. In capital-dependent games, the probabilities of moving right or left depend on the walker's position modulo some integer $K$. In history-dependent games, each step is correlated with the $Q$ previous ones. In both cases the gain identifies with the velocity of the walker's ballistic motion, which depends non-linearly on model parameters, allowing for the possibility of Parrondo's paradox. Calculating the gain involves products of non-commuting Markov matrices, which are somehow analogous to the transfer matrices used in the physics of 1D disordered systems. Elaborating upon this analogy, we study a paradigmatic Parrondo game of each class in the neutral situation where each rule, when played alone, is fair. The main emphasis of this systematic approach is on the dependence of the gain on the remaining parameters and, above all, on the game, i.e., the rule pattern, be it periodic or aperiodic, deterministic or random. One of the most original sides of this work is the identification of weak-contrast regimes for capital-dependent and history-dependent Parrondo games, and a detailed quantitative investigation of the gain in the latter scaling regimes.

cond-mat.stat-mech

Coverage fluctuations in theater models

We introduce the theater model, which is the simplest variant of directed random sequential adsorption in one dimension with point source and steric interactions. Particles enter sequentially an initially empty row of $L$ sites and adsorb irreversibly at randomly chosen places. If two particles occupy adjacent sites, they prevent further particles from passing them. A jammed configuration without available empty sites is eventually reached. More generally, we investigate the class of models parametrized by $b$, the number of consecutive particles needed to form a blockage. We show analytically that the occupations of different sites in jammed configurations exhibit long-range correlations obeying scaling laws, for all integers $b\ge2$, so that the total number of particles grows as a subextensive power of $L$, with exponent $(b-1)/b$, and keeps fluctuating even for very large systems. The exactly known relative number variance measuring this lack of self-averaging is maximal for the theater model {\it stricto sensu} ($b=2$). In the special case where $b=1$, so that each adsorbed particle is a blockage, the model can be mapped onto the statistics of records in sequences of random variables and of cycles in random permutations. A two-sided variant of the model is also considered. In both situations the number of particles grows only logarithmically with $L$, and it is self-averaging.

cond-mat.stat-mech

Scaling laws for weakly disordered 1D flat bands

We investigate Anderson localization on various 1D structures having flat bands. The main focus is on the scaling laws obeyed by the localization length at weak disorder in the vicinity of flat-band energies. A careful distinction is made between situations where the scaling functions are universal (i.e., depend on the disorder distribution only through its width) and where they keep depending on the full shape of the disorder distribution, even in the weak-disorder scaling regime. Three examples are analyzed in detail. On the stub chain, one central flat band is isolated from two lateral dispersive ones. The localization length remains microscopic at weak disorder and exhibits disorder-specific features. On the pyrochlore ladder, the two flat bands are tangent to a dispersive one. The localization length diverges with exponent 1/2 and a non-universal scaling law, whose dependence on the disorder distribution is predicted analytically. On the diamond chain, a central flat band intersects two symmetric dispersive ones. The localization length exhibits two successive scaling regimes, diverging first with exponent 4/3 and a universal law, and then (i.e., further away from the pristine flat band) with exponent 1 and a non-universal law. Both scaling functions are also derived by analytical means.

cond-mat.mes-hall

Quantum return probability of a system of $N$ non-interacting lattice fermions

We consider $N$ non-interacting fermions performing continuous-time quantum walks on a one-dimensional lattice. The system is launched from a most compact configuration where the fermions occupy neighboring sites. We calculate exactly the quantum return probability (sometimes referred to as the Loschmidt echo) of observing the very same compact state at a later time $t$. Remarkably, this probability depends on the parity of the fermion number -- it decays as a power of time for even $N$, while for odd $N$ it exhibits periodic oscillations modulated by a decaying power law. The exponent also slightly depends on the parity of $N$, and is roughly twice smaller than what it would be in the continuum limit. We also consider the same problem, and obtain similar results, in the presence of an impenetrable wall at the origin constraining the particles to remain on the positive half-line. We derive closed-form expressions for the amplitudes of the power-law decay of the return probability in all cases. The key point in the derivation is the use of Mehta integrals, which are limiting cases of the Selberg integral.

cond-mat.mes-hall

Equilibration properties of small quantum systems: further examples

It has been proposed to investigate the equilibration properties of a small isolated quantum system by means of the matrix of asymptotic transition probabilities in some preferential basis. The trace $T$ of this matrix measures the degree of equilibration of the system prepared in a typical state of the preferential basis. This quantity may vary between unity (ideal equilibration) and the dimension $N$ of the Hilbert space (no equilibration at all). Here we analyze several examples of simple systems where the behavior of $T$ can be investigated by analytical means. We first study the statistics of $T$ when the Hamiltonian governing the dynamics is random and drawn from a distribution invariant under the group U$(N)$ or O$(N)$. We then investigate a quantum spin $S$ in a tilted magnetic field making an arbitrary angle with the preferred quantization axis, as well as a tight-binding particle on a finite electrified chain. The last two cases provide examples of the interesting situation where varying a system parameter -- such as the tilt angle or the electric field -- through some scaling regime induces a continuous transition from good to bad equilibration properties.

cond-mat.mes-hall

How the fittest compete for leadership: A tale of tails

We investigate how leaders emerge as a consequence of the competitive dynamics between coupled papers in a model citation network. Every paper is allocated an initial fitness depending on its intrinsic quality. Its fitness then evolves dynamically as a consequence of the competition between itself and all the other papers in the field. It picks up citations as a result of this adaptive dynamics, becoming a leader if it has the highest citation count at a given time. Extensive analytical and numerical investigations of this model suggest the existence of a universal phase diagram, divided into regions of weak and strong coupling. In the former, we find an `extended' and rather structureless distribution of citation counts among many fit papers; leaders are not necessarily those with the maximal fitness at any given time. By contrast, the strong-coupling region is characterised by a strongly hierarchical distribution of citation counts, that are `localised' among only a few extremely fit papers, and exhibit strong history-to-history fluctuations, as a result of the complex dynamics among papers in the tail of the fitness distribution.

physics.soc-ph

Quantum centipedes: collective dynamics of interacting quantum walkers

We consider the quantum centipede made of $N$ fermionic quantum walkers on the one-dimensional lattice interacting by means of the simplest of all hard-bound constraints: the distance between two consecutive fermions is either one or two lattice spacings. This composite quantum walker spreads ballistically, just as the simple quantum walk. However, because of the interactions between the internal degrees of freedom, the distribution of its center-of-mass velocity displays numerous ballistic fronts in the long-time limit, corresponding to singularities in the empirical velocity distribution. The spectrum of the centipede and the corresponding group velocities are analyzed by direct means for the first few values of $N$. Some analytical results are obtained for arbitrary $N$ by exploiting an exact mapping of the problem onto a free-fermion system. We thus derive the maximal velocity describing the ballistic spreading of the two extremal fronts of the centipede wavefunction, including its non-trivial value in the large-$N$ limit.

cond-mat.stat-mech

An investigation of equilibration in small quantum systems: the example of a particle in a 1D random potential

We investigate the equilibration of a small isolated quantum system by means of its matrix of asymptotic transition probabilities in a preferential basis. The trace of this matrix is shown to measure the degree of equilibration of the system launched from a typical state, from the standpoint of the chosen basis. This approach is substantiated by an in-depth study of the example of a tight-binding particle in one dimension. In the regime of free ballistic propagation, the above trace saturates to a finite limit, testifying good equilibration. In the presence of a random potential, the trace grows linearly with the system size, testifying poor equilibration in the insulating regime induced by Anderson localization. In the weak-disorder situation of most interest, a universal finite-size scaling law describes the crossover between the ballistic and localized regimes. The associated crossover exponent 2/3 is dictated by the anomalous band-edge scaling characterizing the most localized energy eigenstates.

cond-mat.stat-mech

Universality in survivor distributions: Characterising the winners of competitive dynamics

We investigate the survivor distributions of a spatially extended model of competitive dynamics in different geometries. The model consists of a deterministic dynamical system of individual agents at specified nodes, which might or might not survive the predatory dynamics: all stochasticity is brought in by the initial state. Every such initial state leads to a unique and extended pattern of survivors and non-survivors, which is known as an attractor of the dynamics. We show that the number of such attractors grows exponentially with system size, so that their exact characterisation is limited to only very small systems. Given this, we construct an analytical approach based on inhomogeneous mean-field theory to calculate survival probabilities for arbitrary networks. This powerful (albeit approximate) approach shows how universality arises in survivor distributions via a key concept -- the {\it dynamical fugacity}. Remarkably, in the large-mass limit, the survival probability of a node becomes independent of network geometry, and assumes a simple form which depends only on its mass and degree.

q-bio.QM

Interacting quantum walkers: Two-body bosonic and fermionic bound states

We investigate the dynamics of bound states of two interacting particles, either bosons or fermions, performing a continuous-time quantum walk on a one-dimensional lattice. We consider the situation where the distance between both particles has a hard bound, and the richer situation where the particles are bound by a smooth confining potential. The main emphasis is on the velocity characterizing the ballistic spreading of these bound states, and on the structure of the asymptotic distribution profile of their center-of-mass coordinate. The latter profile generically exhibits many internal fronts.

cond-mat.mes-hall

Unusual electronic properties of clean and disordered zigzag graphene nanoribbons

We revisit the problem of electron transport in clean and disordered zigzag graphene nanoribbons, and expose numerous hitherto unknown peculiar properties of these systems at zero energy, where both sublattices decouple because of chiral symmetry. For clean ribbons, we give a quantitative description of the unusual power-law dispersion of the central energy bands and of its main consequences, including the strong divergence of the density of states near zero energy, and the vanishing of the transverse localization length of the corresponding edge states. In the presence of off-diagonal disorder, which respects the lattice chiral symmetry, all zero-energy localization properties are found to be anomalous. Recasting the problem in terms of coupled Brownian motions enables us to derive numerous asymptotic results by analytical means. In particular the typical conductance $g_N$ of a disordered sample of width $N$ and length $L$ is shown to decay as $\exp(-C_Nw\sqrt{L})$, for arbitrary values of the disorder strength $w$, while the relative variance of $\ln g_N$ approaches a non-trivial constant $K_N$. The dependence of the constants $C_N$ and $K_N$ on the ribbon width $N$ is predicted. From the mere viewpoint of the transfer-matrix formalism, zigzag ribbons provide a case study with many unusual features. The transfer matrix describing propagation through one unit cell of a clean ribbon is not diagonalizable at zero energy. In the disordered case, we encounter non-trivial random matrix products such that all Lyapunov exponents vanish identically.

cond-mat.mes-hall

Slow synaptic dynamics in a network: from exponential to power-law forgetting

We investigate a mean-field model of interacting synapses on a directed neural network. Our interest lies in the slow adaptive dynamics of synapses, which are driven by the fast dynamics of the neurons they connect. Cooperation is modelled from the usual Hebbian perspective, while competition is modelled by an original polarity-driven rule. The emergence of a critical manifold culminating in a tricritical point is crucially dependent on the presence of synaptic competition. This leads to a universal $1/t$ power-law relaxation of the mean synaptic strength along the critical manifold and an equally universal $1/\sqrt{t}$ relaxation at the tricritical point, to be contrasted with the exponential relaxation that is otherwise generic. In turn, this leads to the natural emergence of long- and short-term memory from different parts of parameter space in a synaptic network, which is the most novel and important result of our present investigations.

cond-mat.dis-nn

Survival of classical and quantum particles in the presence of traps

We present a detailed comparison of the motion of a classical and of a quantum particle in the presence of trapping sites, within the framework of continuous-time classical and quantum random walk. The main emphasis is on the qualitative differences in the temporal behavior of the survival probabilities of both kinds of particles. As a general rule, static traps are far less efficient to absorb quantum particles than classical ones. Several lattice geometries are successively considered: an infinite chain with a single trap, a finite ring with a single trap, a finite ring with several traps, and an infinite chain and a higher-dimensional lattice with a random distribution of traps with a given density. For the latter disordered systems, the classical and the quantum survival probabilities obey a stretched exponential asymptotic decay, albeit with different exponents. These results confirm earlier predictions, and the corresponding amplitudes are evaluated. In the one-dimensional geometry of the infinite chain, we obtain a full analytical prediction for the amplitude of the quantum problem, including its dependence on the trap density and strength.

cond-mat.stat-mech