SEARCH · Searcharxiv

Results for “cond-mat.dis-nn”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18Linked to original sources

arXiv2018

Non-normality, reactivity, and intrinsic stochasticity in neural dynamics: a non-equilibrium potential approach

Intrinsic stochasticity can induce highly non-trivial effects on dynamical systems, including stochastic and coherence resonance, noise induced bistability, noise-induced oscillations, to name but a few. In this paper we revisit a mechanism first investigated in the context of neuroscience by which relatively small demographic (intrinsic) fluctuations can lead to the emergence of avalanching behavior in systems that are deterministically characterized by a single stable fixed point (up state). The anomalously large response of such systems to stochasticity stems (or is strongly associated with) the existence of a "non-normal" stability matrix at the deterministic fixed point, which may induce the system to be "reactive". Here, we further investigate this mechanism by exploring the interplay between non-normality and intrinsic (demographic) stochasticity, by employing a number of analytical and computational approaches. We establish, in particular, that the resulting dynamics in this type of systems cannot be simply derived from a scalar potential but, additionally, one needs to consider a curl flux which describes the essential non-equilibrium nature of this type of noisy non-normal systems. Moreover, we shed further light on the origin of the phenomenon, introduce the novel concept of "non-linear reactivity", and rationalize of the observed the value of the emerging avalanche exponents.

cond-mat.dis-nn↗

arXiv2021

Inhomogeneous asymmetric exclusion processes between two reservoirs : large deviations for the local empirical observables in the Mean-Field approximation

For a given inhomogeneous exclusion processes on $N$ sites between two reservoirs, the trajectories probabilities allow to identify the relevant local empirical observables and to obtain the corresponding rate function at Level 2.5. In order to close the hierarchy of the empirical dynamics that appear in the stationarity constraints, we consider the simplest approximation, namely the Mean-Field approximation for the empirical density of two consecutive sites, in direct correspondence with the previously studied Mean-Field approximation for the steady state. For a given inhomogeneous Totally Asymmetric model (TASEP), this Mean-Field approximation yields the large deviations for the joint distribution of the empirical density profile and of the empirical current around the mean-field steady state; the further explicit contraction over the current allows to obtain the large deviations of the empirical density profile alone. For a given inhomogeneous Asymmetric model (ASEP), the local empirical observables also involve the empirical activities of the links and of the reservoirs; the further explicit contraction over these activities yields the large deviations for the joint distribution of the empirical density profile and of the empirical current. The consequences for the large deviations properties of time-additive space-local observables are also discussed in both cases.

cond-mat.stat-mech↗

arXiv2024

Laplacian Renormalization Group: An introduction to heterogeneous coarse-graining

The renormalization group (RG) constitutes a fundamental framework in modern theoretical physics. It allows the study of many systems showing states with large-scale correlations and their classification in a relatively small set of universality classes. RG is the most powerful tool for investigating organizational scales within dynamic systems. However, the application of RG techniques to complex networks has presented significant challenges, primarily due to the intricate interplay of correlations on multiple scales. Existing approaches have relied on hypotheses involving hidden geometries and based on embedding complex networks into hidden metric spaces. Here, we present a practical overview of the recently introduced Laplacian Renormalization Group for heterogeneous networks. First, we present a brief overview that justifies the use of the Laplacian as a natural extension for well-known field theories to analyze spatial disorder. We then draw an analogy to traditional real-space renormalization group procedures, explaining how the LRG generalizes the concept of "Kadanoff supernodes" as block nodes that span multiple scales. These supernodes help mitigate the effects of cross-scale correlations due to small-world properties. Additionally, we rigorously define the LRG procedure in momentum space in the spirit of Wilson RG. Finally, we show different analyses for the evolution of network properties along the LRG flow following structural changes when the network is properly reduced.

cond-mat.stat-mech↗

arXiv2013

Reconstruction algorithm in compressed sensing based on maximum a posteriori estimation

We propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of l1-norm minimization using a standard linear programming algorithm is O(N^3). We show that this cost can be reduced to O(N^2) by applying the approach of posterior maximization. Furthermore, in principle, the algorithm from our approach is expected to achieve the widest successful reconstruction region, which is evaluated from theoretical argument. We also discuss the relation between the belief propagation-based reconstruction algorithm introduced in preceding works and our approach.

cs.IT↗

arXiv2013

Simplifying Generalized Belief Propagation on Redundant Region Graphs

The cluster variation method has been developed into a general theoretical framework for treating short-range correlations in many-body systems after it was first proposed by Kikuchi in 1951. On the numerical side, a message-passing approach called generalized belief propagation (GBP) was proposed by Yedidia, Freeman and Weiss about a decade ago as a way of computing the minimal value of the cluster variational free energy and the marginal distributions of clusters of variables. However the GBP equations are often redundant, and it is quite a non-trivial task to make the GBP iteration converges to a fixed point. These drawbacks hinder the application of the GBP approach to finite-dimensional frustrated and disordered systems. In this work we report an alternative and simple derivation of the GBP equations starting from the partition function expression. Based on this derivation we propose a natural and systematic way of removing the redundance of the GBP equations. We apply the simplified generalized belief propagation (SGBP) equations to the two-dimensional and the three-dimensional ferromagnetic Ising model and Edwards-Anderson spin glass model. The numerical results confirm that the SGBP message-passing approach is able to achieve satisfactory performance on these model systems. We also suggest that a subset of the SGBP equations can be neglected in the numerical iteration process without affecting the final results.

cs.IT↗

arXiv2013

Stability of topologically-protected quantum computing proposals as seen through spin glasses

Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding quantum bits and gates in topological properties of the hardware medium that are immune to noise that does not impact the entire system at once. There are different approaches to achieve topological stability or active error correction, ranging from quasiparticle braidings to spin models and topological color codes. The stability of these proposals against noise can be quantified by their error threshold. This figure of merit can be computed by mapping the problem onto complex statistical-mechanical spin-glass models with local disorder on nontrival lattices that can have many-body interactions and are sometimes described by lattice gauge theories. The error threshold for a given source of error then represents the point in the temperature-disorder phase diagram where a stable symmetry-broken phase vanishes. An overview of the techniques used to estimate the error thresholds is given, as well as a summary of recent results on the stability of different topologically-protected quantum computing schemes to different error sources.

cond-mat.dis-nn↗

arXiv2013

Packing hard spheres with short-range attraction in infinite dimension: Phase structure and algorithmic implications

We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits reentrancy of the liquid-glass transition line, two distinct glass states and a glass-to-glass transition, much similar to what has been previously obtained by Mode-Coupling Theory, numerical simulations and experiments. The presence of the phase reentrance implies that for a suitable choice of the intensity and attraction range, high-density sphere packings more compact than the one corresponding to pure hard-spheres can be constructed in polynomial time in the number of particles (at fixed, large d) for packing fractions smaller than 6.5 d 2^{-d}. Although our derivation is not a formal mathematical proof, we believe it meets the standards of rigor of theoretical physics, and at this level of rigor it provides a small improvement of the lower bound on the sphere packing problem.

cond-mat.dis-nn↗

arXiv2013

The hard-core model on random graphs revisited

We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random graphs with small and very large average degrees respectively are quite well understood, they yield qualitatively different results and our aim here is to reconciliate these two cases. We revisit results that can be obtained using the (heuristic) cavity method and show that it provides a closed-form conjecture for the exact density of the densest packing on random regular graphs with degree K>=20, and that for K>16 the nature of the phase transition is the same as for large K. This also shows that the hard-code model is the simplest mean-field lattice model for structural glasses and jamming.

cond-mat.dis-nn↗

arXiv2013

Performance of simulated annealing in p-spin glasses

We perform careful numerical simulations of slow Monte-Carlo annealings in the dense 3-body spin glass model and compare with the predictions from different theories: thresholds states, isocomplexity, following state. We conclude that while isocomplexity and following state both provide excellent agreement the numerical data, the influence of threshold states -- that is still the most commonly considered theory -- can be excluded from our data.

cond-mat.dis-nn↗

arXiv2013

Zeros of the partition function and dynamical singularities in spin-glass systems

We study spin-glass systems characterized by continuous occurrence of singularities. The theory of Lee-Yang zeros is used to find the singularities. By using the replica method in mean-field systems, we show that two-dimensional distributions of zeros of the partition function in a complex parameter plane are characteristic feature of random systems. The results of several models indicate that the concept of chaos in the spin-glass state is different from that of the replica symmetry breaking. We discuss that a chaotic phase at imaginary temperature is different from the spin-glass phase and is accessible by quantum dynamics in a quenching protocol.

cond-mat.stat-mech↗

arXiv2011

Eigenvalue repulsion estimates and some applications for the one-dimensional Anderson model

We show that the spacing between eigenvalues of the discrete 1D Hamiltonian with arbitrary potentials which are bounded, and with Dirichlet or Neumann Boundary Conditions is bounded away from zero. We prove an explicit lower bound, given by $Ce^{-bN}$, where $N$ is the lattice size, and $C$ and $b$ are some finite constants. In particular, the spectra of such Hamiltonians have no degenerate eigenvalues. As applications we show that to leading order in the coupling, the solution of a nonlinearly perturbed Anderson model in one-dimension (on the lattice) remains exponentially localized, in probability and average sense for initial conditions given by a unique eigenfunction of the linear problem. We also bound the derivative of the eigenfunctions of the linear Anderson model with respect to a potential change.

cond-mat.dis-nn↗

arXiv2013

Flux conservation in coherent backscattering and weak localisation of light

The standard theoretical description of coherent backscattering, accord- ing to which maximally crossed diagrams accounting for interference between counter- propagating path amplitudes are added on top of the incoherent background, violates the fundamental condition of flux conservation. In contrast to predictions of previous theories, we show that including maximally crossed diagrams with one additional scat- tering event does not restore flux conservation. Instead, we propose that the latter is recovered when treating the effects of coherent backscattering and weak localisation in a unified framework. On the basis of this framework, we demonstrate explicitly flux conservation in leading order of the weak disorder parameter 1/(kl).

cond-mat.dis-nn↗

arXiv2013

Entropy landscape of solutions in the binary perceptron problem

The statistical picture of the solution space for a binary perceptron is studied. The binary perceptron learns a random classification of input random patterns by a set of binary synaptic weights. The learning of this network is difficult especially when the pattern (constraint) density is close to the capacity, which is supposed to be intimately related to the structure of the solution space. The geometrical organization is elucidated by the entropy landscape from a reference configuration and of solution-pairs separated by a given Hamming distance in the solution space. We evaluate the entropy at the annealed level as well as replica symmetric level and the mean field result is confirmed by the numerical simulations on single instances using the proposed message passing algorithms. From the first landscape (a random configuration as a reference), we see clearly how the solution space shrinks as more constraints are added. From the second landscape of solution-pairs, we deduce the coexistence of clustering and freezing in the solution space.

cond-mat.dis-nn↗

arXiv2013

Bose-Einstein condensation in a minimal inhomogeneous system

We study the effects of repulsive interaction and disorder on Bosons in a two-site Bose-Hubbard system, which provides a simple model of the dirty boson problem. By comparison with exact numerical results, we demonstrate how a straightforward application of the Bogoliubov approximation fails even to deliver a qualitatively correct picture: It wrongly predicts an increase of the condensate depletion due to disorder. We show that, in the presence of disorder, the noncommutative character of the condensate operator has to be retained for a correct description of the system.

cond-mat.quant-gas↗

arXiv2014

Universal statistics of longest lasting records of random walks and Lévy flights

We study the record statistics of random walks after $n$ steps, $x_0, x_1,\ldots, x_n$, with arbitrary symmetric and continuous distribution $p(η)$ of the jumps $η_i = x_i - x_{i-1}$. We consider the age of the records, i.e. the time up to which a record survives. Depending on how the age of the current last record is defined, we propose three distinct sequences of ages (indexed by $α$ = I, II, III) associated to a given sequence of records. We then focus on the longest lasting record, which is the longest element among this sequence of ages. To characterize the statistics of these longest lasting records, we compute: (i) the probability that the record of the longest age is broken at step $n$, denoted by $Q^α(n)$, which we call the probability of record breaking and: (ii) the duration of the longest lasting record, $\ell_{\max}^α(n)$. We show that both $Q^α(n)$ and the full statistics of $\ell_{\max}^α(n)$ are universal, i.e. independent of the jump distribution $p(η)$. We compute exactly the large $n$ asymptotic behaviors of $Q^α(n)$ as well as $\langle \ell_{\max}^α(n)\rangle$ (when it exists) and show that each case gives rise to a different universal constant associated to random walks (including Lévy flights). While two of them appeared before in the excursion theory of Brownian motion, for which we provide here a simpler derivation, the third case gives rise to a non-trivial new constant $C^{\rm III} = 0.241749 \ldots$ associated to the records of random walks. Other observables characterizing the ages of the records, exhibiting an interesting universal behavior, are also discussed.

cond-mat.stat-mech↗

arXiv2018

Strong Disorder Real-Space Renormalization for the Many-Body-Localized phase of random Majorana models

For the Many-Body-Localized phase of random Majorana models, a general Strong Disorder Real-Space Renormalization procedure known as RSRG-X [D. Pekker, G. Refael, E. Altman, E. Demler and V. Oganesyan, Phys. Rev. X 4, 011052 (2014)] is described to produce the whole set of excited states, via the iterative construction of the Local Integrals of Motion (LIOMs). The RG rules are then explicitly derived for arbitrary quadratic Hamiltonians (free-fermions models) and for the Kitaev chain with local interactions involving even numbers of consecutive Majorana fermions. The emphasis is put on the advantages of the Majorana language over the usual quantum spin language to formulate unified RSRG-X rules.

cond-mat.dis-nn↗

arXiv2014

Analytical estimates of the locations of phase transition points in the ground state for the bimodal Ising spin glass model in two dimensions

We analytically estimate the locations of phase transition points in the ground state for the $\pm J$ random bond Ising model with asymmetric bond distributions on the square lattice. We propose and study the percolation transitions for two types of bond shared by two non-frustrated plaquettes. The present method indirectly treats the sizes of clusters of correlated spins for the ferromagnetic and spin glass orders. We find two transition points. The first transition point is the phase transition point for the ferromagnetic order, and the location is obtained as $p_c^{(1)} \approx 0.895 \, 399 \, 54$ as the solution of $[p^2 + 3 (1-p)^2 ]^2 \, p^3 - \frac{1}{2} = 0$. The second transition point is the phase transition point for the spin glass order, and the location is obtained as $p_c^{(2)} = \frac{1}{4} [2 + \sqrt{2 (\sqrt{5} - 1)}] \approx 0.893 \, 075 \, 69$. Here, $p$ is the ferromagnetic bond concentration, and $1 - p$ is the antiferromagnetic bond concentration. The obtained locations are reasonably close to the previously estimated locations. This study suggests the presence of the intermediate phase between $p_c^{(1)}$ and $p_c^{(2)}$; however, since the present method produces remarkable values but has no mathematical proof for accuracy yet, no conclusions are drawn in this article about the presence of the intermediate phase.

cond-mat.dis-nn↗

arXiv2012

Magnetocapacitance without magnetism

A substantial magnetodielectric effect is often an indication of coupled magnetic and elastic order, such as is found in the multiferroics. However, it has recently been shown that magnetism is not necessary to produce either a magnetoresistance or a magnetocapacitance when the material is inhomogeneous [M. M. Parish and P. B. Littlewood, Phys. Rev. Lett. 101, 166602 (2008)]. Here, we will investigate the characteristic magnetic-field-dependent dielectric response of such an inhomogeneous system using exact calculations and numerical simulations of conductor-dielectric composites. In particular, we will show that even simple conductor-dielectric layers exhibit a magnetocapacitance, and thus random bulk inhomogeneities are not a requirement for this effect. Indeed, this work essentially provides a natural generalisation of the Maxwell-Wagner effect to finite magnetic field. We will also discuss how this phenomenon has already been observed experimentally in some materials.

cond-mat.dis-nn↗