Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “cond-mat.stat-mech”

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 109 records · Page 6Linked to original sources
arXiv2009

Fractal Analysis of Discharge Current Fluctuations

We use the multifractal detrended fluctuation analysis (MF-DFA) to study the electrical discharge current fluctuations in plasma and show that it has multifractal properties and behaves as a weak anti-correlated process. Comparison of the MF-DFA results for the original series with those for the shuffled and surrogate series shows that correlation of the fluctuations is responsible for multifractal nature of the electrical discharge current.

cond-mat.stat-mech↗
arXiv2009

The emergence of the electrostatic field as a Feynman sum in random tilings with holes

We consider random lozenge tilings on the triangular lattice with holes $Q_1,...,Q_n$ in some fixed position. For each unit triangle not in a hole, consider the average orientation of the lozenge covering it. We show that the scaling limit of this discrete field is the electrostatic field obtained when regarding each hole $Q_i$ as an electrical charge of magnitude equal to the difference between the number of unit triangles of the two different orientations inside $Q_i$. This is then restated in terms of random surfaces, yielding the result that the average over surfaces with prescribed height at the union of the boundaries of the holes is, in the scaling limit, a sum of helicoids.

math-ph↗
arXiv2007

Steady-State Chemotactic Response in E. coli

The bacterium E. coli maneuvers itself to regions with high chemoattractant concentrations by performing two stereotypical moves: `runs', in which it moves in near straight lines, and `tumbles', in which it does not advance but changes direction randomly. The duration of each move is stochastic and depends upon the chemoattractant concentration experienced in the recent past. We relate this stochastic behavior to the steady-state density of a bacterium population, and we derive the latter as a function of chemoattractant concentration. In contrast to earlier treatments, here we account for the effects of temporal correlations and variable tumbling durations. A range of behaviors obtains, that depends subtly upon several aspects of the system - memory, correlation, and tumbling stochasticity in particular.

q-bio.CB↗
arXiv2008

Tackling master equations with a flux loop transform

A procedure is introduced which allows to represent the dynamics of a non-equilibrium system violating detailed balance by its steady state loop fluxes. It is shown that detailed balance is restored in this representation, such that the non-equilibrium steady state follows a simple Boltzmann distribution. A novel algorithm for the construction of the steady state densities naturally emerges, as well as an expression for a 'free energy' functional which attains a minimum in the steady state.

cond-mat.stat-mech↗
arXiv2007

Higher derivative free energy terms and interfacial curvatures

High derivative terms do not play a major role in field theories because of the associated complexity and inherent difficulty in connecting these terms to physically measurable quantities. A role for higher derivative terms is analyzed for the case of field theories used to describe phase separated systems. In these theories, higher derivative terms are directly connected to an interfacial free energy which contains the mean and the Gaussian curvature and are shown to determine explicitly the shape of the interface.

cond-mat.soft↗
arXiv2007

Upper Bound of Relative Error of Random Ball Coverage for Calculating Fractal Network Dimension

Least box number coverage problem for calculating dimension of fractal networks is a NP-hard problem. Meanwhile, the time complexity of random ball coverage for calculating dimension is very low. In this paper we strictly present the upper bound of relative error for random ball coverage algorithm. We also propose twice-random ball coverage algorithm for calculating network dimension. For many real-world fractal networks, when the network diameter is sufficient large, the relative error upper bound of this method will tend to 0. In this point of view, given a proper acceptable error range, the dimension calculation is not a NP-hard problem, but P problem instead.

cond-mat.stat-mech↗
arXiv2007

Superbosonization

We give a constructive proof for the superbosonization formula for invariant random matrix ensembles, which is the supersymmetry analog of the theory of Wishart matrices. Formulas are given for unitary, orthogonal and symplectic symmetry, but worked out explicitly only for the orthogonal case. The method promises to become a powerful tool for investigating the universality of spectral correlation functions for a broad class of random matrix ensembles of non-Gaussian type.

cond-mat.stat-mech↗
arXiv2008

RNA Secondary Structures: Complex Statics and Glassy Dynamics

Models for RNA secondary structures (the topology of folded RNA) without pseudo knots are disordered systems with a complex state-space below a critical temperature. Hence, a complex dynamical (glassy) behavior can be expected, when performing Monte Carlo simulation. Interestingly, in contrast to most other complex systems, the ground states and the density of states can be computed in polynomial time exactly using transfer matrix methods. Hence, RNA secondary structure is an ideal model to study the relation between static/thermodynamic properties and dynamics of algorithms. Also they constitute an ideal benchmark system for new Monte Carlo methods. Here we considered three different recent Monte Carlo approaches: entropic sampling using flat histograms, optimized-weights ensembles, and ParQ, which estimates the density of states from transition matrices. These methods were examined by comparing the obtained density of states with the exact results. We relate the complexity seen in the dynamics of the Monte Carlo algorithms to static properties of the phase space by studying the correlations between tunneling times, sampling errors, amount of meta-stable states and degree of ultrametricity at finite temperature.

cond-mat.dis-nn↗
arXiv2007

Inhomogeneous charge ordering of a spinless fermionic system on the Bethe lattice

We show that a system of spinless Fermi particles, localized on the sites of the Bethe lattice with coordination number z and interacting through a repulsive nearest-neighbor interaction, exhibits a phase transition to a charge-ordered state. The phase diagram in the n-T plane is derived. Relevant thermodynamic quantities, such as the free energy, the specific heat, the entropy and the compressibility are analyzed in detail.

cond-mat.str-el↗
arXiv2007

Exact solution of the extended Hubbard model in the atomic limit on the Bethe Lattice

We study the phase diagram at finite temperature of a system of Fermi particles on the sites of the Bethe lattice with coordination number z and interacting through onsite U and nearest-neighbor V interactions. This is a physical realization of the extended Hubbard model in the atomic limit. By using the equations of motion method, we exactly solve the model. For an attractive intersite potential, we find, at half filling, a phase transition towards a broken particle-hole symmetry state. The critical temperature, as a function of the relevant parameters, has a re-entrant behavior as already observed in the equivalent spin-1 Ising model on the Bethe lattice.

cond-mat.str-el↗
arXiv2007

Self-organization in Trees and Motifs of Two-Dimensional Chaotic Maps with Time Delay

We study two-dimensional chaotic standard maps coupled along the edges of scale-free trees and tree-like subgraph (4-star) with a non-symplectic coupling and time delay between the nodes. Apart from the chaotic and regular 2-periodic motion, the coupled map system exhibits variety of dynamical effects in a wide range of coupling strengths. This includes dynamical localization, emergent periodicity, and appearance of strange non-chaotic attractors. Near the strange attractors we find long-range correlations in the intervals of return-times to specified parts of the phase space. We substantiate the analysis with the finite-time Lyapunov stability. We also give some quantitative evidence of how the small-scale dynamics at 4-star motifs participates in the genesis of the collective behavior at the whole network.

cond-mat.stat-mech↗
arXiv2008

Hidden Structure in Tilings, Conjectured Asymptotic Expansion for lambda_d in Multidimensional Dimer Problem

The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V in d dimensions, the dimer problem loosely speaking is to count the number of different ways dimers (dominoes) may be layed down on the lattice to completely cover it. It is known that the number of such coverings is roughly exp(lambda_d V) for some number lambda_d. The first terms in the expansion of lambda_d have been known for about thirty years lambda_d ~ (1/2)ln(2d)-1/2 Herein we present a mathematical argument for an asymptotic expansion lambda_d ~ (1/2)ln(2d) -1/2 +(1/8)/d + (5/96)/d^2 +... with the first few terms given explicitly.

math-ph↗
arXiv2008

Supersymmetry and Nonequilibrium Work Relations

We give a field-theoretic proof of the nonequilibrium work relations for a space dependent field with stochastic dynamics. The path integral representation and its symmetries allow us to derive Jarzynski's equality. In addition, we derive a set of exact identities that generalize the fluctuation-dissipation relations to far-from equilibrium situations. These identities are prone to experimental verification. Furthermore, we show that supersymmetry invariance of the Langevin equation, which is broken when the external potential is time-dependent, is partially restored by adding to the action a term which is precisely Jarzynski's work. Jarzynski's equality can also be deduced from this supersymmetry

cond-mat.stat-mech↗
arXiv2007

Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes

The effects of the finite size of the network on the evolutionary dynamics of a Boolean network are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. It is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks there is an additional selection for input inverting Boolean functions that output a value opposite to the majority of input values. These results are revealed through an empirical study of the model that calculates the frequency of occurrence of the different possible Boolean functions. Classes of functions are found to occur with the same frequency. Those classes depend on the symmetry of the evolutionary dynamics and correspond to orbits of the relevant symmetry group. The empirical results match analytic results, determined by utilizing Polya's theorem, for the number of orbits expected in both finite size and infinitely large networks. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as well as possible. The results suggest that both finite size effects and symmetry are important for understanding the evolution of real-world complex networks, including genetic regulatory networks.

cond-mat.stat-mech↗
arXiv2008

Computing the Tutte polynomial in vertex-exponential time

The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating link in knot theory, and the partition functions of the models of Ising, Potts, and Fortuin--Kasteleyn in statistical physics. Prior to this work, deletion--contraction was also the fastest known general-purpose algorithm for these invariants, running in time roughly proportional to the number of spanning trees in the input graph. Here, we give a substantially faster algorithm that computes the Tutte polynomial--and hence, all the aforementioned invariants and more--of an arbitrary graph in time within a polynomial factor of the number of connected vertex sets. The algorithm actually evaluates a multivariate generalization of the Tutte polynomial by making use of an identity due to Fortuin and Kasteleyn. We also provide a polynomial-space variant of the algorithm and give an analogous result for Chung and Graham's cover polynomial. An implementation of the algorithm outperforms deletion--contraction also in practice.

cs.DS↗
arXiv2011

Thermodynamic and quantum entropy gain of frame averaging

We are discussing a universal non-unitary map M subsequent to a generic unitary map U, whose von Neumann entropy gain coincides with the calculated thermodynamic entropy production. For many-body quantum reservoirs we prove that M can be the averaging over all translations of the spatial frame. Assuming the coincidence of microscopic and macroscopic entropy productions leads to a novel equation between entropy gain of frame averaging and relative entropy. Our map M turns out to coincide with the older one called twirl, used recently in the theory of quantum reference frames. Related results to ours have been obtained and we discuss some of them briefly. Possible relevance of frame averaging (twirling) for real world irreversibility is mentioned.

quant-ph↗