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 433 records · Page 24Linked to original sources

arXiv2013

Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem

We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as Network Expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram and a discussion of physical origin of the phase transitions) for Network Expansion is obtained. Finally, we provide a message-passing algorithm to solve the original CSPs in the most general form.

q-bio.MN↗

arXiv2013

Transport in quenched disorder: light diffusion in strongly heterogeneous turbid media

We present a theoretical and experimental study of light transport in disordered media with strongly heterogeneous distribution of scatterers formed via non-scattering regions. Step correlations induced by quenched disorder are found to prevent diffusivity from diverging with increasing heterogeneity scale, contrary to expectations from annealed models. Spectral diffusivity is measured for a porous ceramic where nanopores act as scatterers and macropores render their distribution heterogeneous. Results agree well with Monte Carlo simulations and a proposed analytical model.

cond-mat.dis-nn↗

arXiv2014

Grain fragmentation in sheared granular flow: weakening effects, energy dissipation, and strain localization

We describe the shear flow of a disordered granular material in the presence of grain fracture using the shear-transformation-zone (STZ) theory of amorphous plasticity adapted to systems with a hard-core inter-particle interaction. To this end, we develop the equations of motion for this system within a statistical-thermodynamic framework analogous to that used in the analysis of molecular glasses. For hard-core systems, the amount of internal, configurational disorder is characterized by the compactivity $X = \partial V / \partial S_C$, where $V$ and $S_C$ are respectively the volume and configurational entropy. Grain breakage is described by a constitutive equation for the temporal evolution of a characteristic grain size $a$, based on fracture mechanics. We show that grain breakage is a weakening mechanism, significantly lowering the flow stress at large strain rates, if the material is rate-strengthening in character. We show in addition that if the granular material is sufficiently aged, spatial inhomogeneity in configurational disorder results in strain localization. We also show that grain splitting contributes significantly to comminution at small shear strains, while grain abrasion becomes dominant at large shear displacements.

cond-mat.soft↗

arXiv2013

Kinetic theory of nonlinear diffusion in a weakly disordered nonlinear Schrödinger chain in the regime of homogeneous chaos

We study the discrete nonlinear Schröinger equation with weak disorder, focusing on the regime when the nonlinearity is, on the one hand, weak enough for the normal modes of the linear problem to remain well resolved, but on the other, strong enough for the dynamics of the normal mode amplitudes to be chaotic for almost all modes. We show that in this regime and in the limit of high temperature, the macroscopic density $ρ$ satisfies the nonlinear diffusion equation with a density-dependent diffusion coefficient, $D(ρ)=D_0ρ^2$. An explicit expression for $D_0$ is obtained in terms of the eigenfunctions and eigenvalues of the linear problem, which is then evaluated numerically. The role of the second conserved quantity (energy) in the transport is also quantitatively discussed.

cond-mat.dis-nn↗

arXiv2014

Space-filling Percolation

A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation center that is selected at a random location within the uncovered region. The growth rate $δ$ is a continuously tunable parameter of the problem which assumes a specific value while a particular pattern of discs is generated. When a growing disc overlaps for the first time with at least another disc, it's growth is stopped and is said to be `frozen'. In this paper we study the percolation properties of the set of frozen discs. Using numerical simulations we present evidence for the following: (i) The Order Parameter appears to jump discontinuously at a certain critical value of the area coverage; (ii) the width of the window of the area coverage needed to observe a macroscopic jump in the Order Parameter tends to vanish as $δ\to 0$ and on the contrary (iii) the cluster size distribution has a power law decaying functional form. While the first two results are the signatures of a discontinuous transition, the third result is indicative of a continuous transition. Therefore we refer this transition as a sharp but continuous transition similar to what has been observed in the recently introduced Achlioptas process of Explosive Percolation. It is also observed that in the limit of $δ\to 0$, the critical area coverage at the transition point tends to unity, implying the limiting pattern is space-filling. In this limit, the fractal dimension of the pore space at the percolation point has been estimated to be $1.42(10)$ and the contact network of the disc assembly is found to be a scale-free network.

cond-mat.dis-nn↗

arXiv2014

Static and dynamical properties of a hard-disk fluid confined to a narrow channel

The thermodynamic properties of disks moving in a channel sufficiently narrow that they can collide only with their nearest neighbors can be solved exactly by determining the eigenvalues and eigenfunctions of an integral equation. Using it we have determined the correlation length $ξ$ of this system. We have developed an approximate solution which becomes exact in the high density limit. It describes the system in terms of defects in the regular zigzag arrangement of disks found in the high-density limit. The correlation length is then effectively the spacing between the defects. The time scales for defect creation and annihilation are determined with the help of transition-state theory, as is the diffusion coefficient of the defects, and these results are found to be in good agreement with molecular dynamics simulations. On compressing the system with the Lubachevsky--Stillinger procedure, jammed states are obtained whose packing fractions $ϕ_J$ are a function of the compression rate $γ$. We find a quantitative explanation of this dependence by making use of the Kibble--Zurek hypothesis. We have also determined the point-to-set length scale $ξ_{PS}$ for this system. At a packing fraction $ϕ$ close to its largest value $ϕ_{\text{max}}$, $ξ_{PS}$ has a simple power law divergence, $ξ_{PS} \sim 1/(1-ϕ/ϕ_{\text{max}})$, while $ξ$ diverges much faster, $\ln(ξ) \sim 1/(1-ϕ/ϕ_{\text{max}})$.

cond-mat.soft↗

arXiv2013

Spatial correlation functions and dynamical exponents in very large samples of 4D spin glasses

The study of the low temperature phase of spin glass models by means of Monte Carlo simulations is a challenging task, because of the very slow dynamics and the severe finite size effects they show. By exploiting at the best the capabilities of standard modern CPUs (especially the SSE instructions), we have been able to simulate the four-dimensional (4D) Edwards-Anderson model with Gaussian couplings up to sizes $L=70$ and for times long enough to accurately measure the asymptotic behavior. By quenching systems of different sizes to the the critical temperature and to temperatures in the whole low temperature phase, we have been able to identify the regime where finite size effects are negligible: $ξ(t) \lesssim L/7$. Our estimates for the dynamical exponent ($z \simeq 1/T$) and for the replicon exponent ($α\simeq 1.0$ and $T$-independent), that controls the decay of the spatial correlation in the zero-overlap sector, are consistent with the RSB theory, but the latter differs from the theoretically conjectured value.

cond-mat.dis-nn↗

arXiv2014

The SAT-UNSAT transition in the adversarial SAT problem

Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT and therefore the nature of the critical region and the transition are not easily paralleled to those of SAT and worth of independent study. AdSAT also provides an upper bound for the transition threshold of the quantum satisfiability problem (QSAT). We present a complete algorithm for AdSAT, show that 2-AdSAT is in $\mathbf{P}$, and then study two stochastic algorithms (simulated annealing and its improved variant) and compare their performances in detail for 3-AdSAT. Varying the density of clauses $α$ we find a sharp SAT-UNSAT transition at a critical value whose upper bound is $α_c \lesssim 1.5$, thus providing a much stricter upper bound for the QSAT transition than those previously found.

cs.CC↗

arXiv2014

Ensemble renormalization group for the random field hierarchical model

The Renormalization Group (RG) methods are still far from being completely understood in quenched disordered systems. In order to gain insight into the nature of the phase transition of these systems, it is common to investigate simple models. In this work we study a real-space RG transformation on the Dyson hierarchical lattice with a random field, which led to a reconstruction of the RG flow and to an evaluation of the critical exponents of the model at T = 0. We show that this method gives very accurate estimations of the critical exponents, by comparing our results with the ones obtained by some of us using an independent method.

cond-mat.dis-nn↗

arXiv2014

Dynamical transition in the D = 3 Edwards-Anderson spin glass in an external magnetic field

We study the off-equilibrium dynamics of the three-dimensional Ising spin glass in the presence of an external magnetic field. We have performed simulations both at fixed temperature and with an annealing protocol. Thanks to the Janus special-purpose computer, based on FPGAs, we have been able to reach times equivalent to 0.01 seconds in experiments. We have studied the system relaxation both for high and for low temperatures, clearly identifying a dynamical transition point. This dynamical temperature is strictly positive and depends on the external applied magnetic field. We discuss different possibilities for the underlying physics, which include a thermodynamical spin-glass transition, a mode-coupling crossover or an interpretation reminiscent of the random first-order picture of structural glasses.

cond-mat.dis-nn↗

arXiv2014

Density-based and transport-based core-periphery structures in networks

Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks---including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

physics.soc-ph↗

arXiv2014

Slow, bursty dynamics as the consequence of quenched network topologies

Bursty dynamics of agents is shown to appear at criticality or in extended Griffiths phases, even in case of Poisson processes. I provide numerical evidence for power-law type of inter-communication time distributions by simulating the Contact Process and the Susceptible-Infected-Susceptible model. This observation suggests that in case of non-stationary bursty systems the observed non-poissonian behavior can emerge as the consequence of an underlying hidden poissonian network process, which is either critical or exhibits strong rare-region effects. On contrary, in time varying networks rare-region effects do not cause deviation from the mean-field behavior and heterogeneity induced burstyness is absent.

cond-mat.stat-mech↗

arXiv2014

Overfrustrated and Underfrustrated Spin-Glasses in d=3 and 2: Evolution of Phase Diagrams and Chaos Including Spin-Glass Order in d=2

In spin-glass systems, frustration can be adjusted continuously and considerably, without changing the antiferromagnetic bond probability p, by using locally correlated quenched randomness, as we demonstrate here on hypercubic lattices and hierarchical lattices. Such overfrustrated and underfrustrated Ising systems on hierarchical lattices in d=3 and 2 are studied. With the removal of just 51 % of frustration, a spin-glass phase occurs in d=2. With the addition of just 33 % frustration, the spin-glass phase disappears in d=3. Sequences of 18 different phase diagrams for different levels of frustration are calculated in both dimensions. In general, frustration lowers the spin-glass ordering temperature. At low temperatures, increased frustration favors the spin-glass phase (before it disappears) over the ferromagnetic phase and symmetrically the antiferromagnetic phase. When any amount, including infinitesimal, frustration is introduced, the chaotic rescaling of local interactions occurs in the spin-glass phase. Chaos increases with increasing frustration, as seen from the increased positive value of the calculated Lyapunov exponent $λ$, starting from $λ=0$ when frustration is absent. The calculated runaway exponent $y_R$ of the renormalization-group flows decreases with increasing frustration to $y_R=0$ when the spin-glass phase disappears. From our calculations of entropy and specific heat curves in d=3, it is seen that frustration lowers in temperature the onset of both long- and short-range order in spin-glass phases, but is more effective on the former. From calculations of the entropy as a function of antiferromagnetic bond concentration p, it is seen that the ground-state and low-temperature entropy already mostly sets in within the ferromagnetic and antiferromagnetic phases, before the spin-glass phase is reached.

cond-mat.dis-nn↗

arXiv2014

Weak percolation on multiplex networks

Bootstrap percolation is a simple but non-trivial model. It has applications in many areas of science and has been explored on random networks for several decades. In single layer (simplex) networks, it has been recently observed that bootstrap percolation, which is defined as an incremental process, can be seen as the opposite of pruning percolation, where nodes are removed according to a connectivity rule. Here we propose models of both bootstrap and pruning percolation for multiplex networks. We collectively refer to these two models with the concept of "weak" percolation, to distinguish them from the somewhat classical concept of ordinary ("strong") percolation. While the two models coincide in simplex networks, we show that they decouple when considering multiplexes, giving rise to a wealth of critical phenomena. Our bootstrap model constitutes the simplest example of a contagion process on a multiplex network and has potential applications in critical infrastructure recovery and information security. Moreover, we show that our pruning percolation model may provide a way to diagnose missing layers in a multiplex network. Finally, our analytical approach allows us to calculate critical behavior and characterize critical clusters.

cond-mat.dis-nn↗

arXiv2014

Condensation and topological phase transitions in a dynamical network model with rewiring of the links

Growing network models with both heterogeneity of the nodes and topological constraints can give rise to a rich phase structure. We present a simple model based on preferential attachment with rewiring of the links. Rewiring probabilities are modulated by the negative fitness of the nodes and by the constraint for the network to be a simple graph. At low temperatures and high rewiring rates, this constraint induces a Bose-Einstein condensation of paths of length 2, i.e. a new phase transition with an extended condensate of links. The phase space of the model includes further transitions in the scaling of the connected component and the degeneracy of the network.

cond-mat.dis-nn↗

arXiv2014

Degree-dependent network growth: From preferential attachment to explosive percolation

We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation transition using a generating functions theory. The model considers a network with a fixed number of nodes wherein links are introduced using degree-dependent linking probabilities $p_k$. To illustrate the techniques and support our findings using Monte-Carlo simulations, we introduce the exemplary linking rule $p_k$ proportional to $k^{-α}$, with $α$ between -1 and plus infinity. This parameter may be used to interpolate between different regimes. For negative $α$, links are most likely attached to high-degree nodes. On the other hand, in case $α>0$, nodes with low degrees are connected and the model asymptotically approaches a process undergoing explosive percolation.

cond-mat.stat-mech↗

arXiv2014

Generalized Landauer Bound as Universal Thermodynamic Entropy in Continuous Phase Transitions

The classic Landauer bound can be lowered when erasure errors are permitted. Here we point out that continuous phase transitions characterized by an order parameter can also be viewed as information erasure by resetting a certain number of bits to a standard value. The information-theoretic expression for the generalized Landauer bound in terms of error probability implies thus a universal form for the thermodynamic entropy in the partially ordered phase. We explicitly show that the thermodynamic entropy as a function of interaction parameters and temperature is identical to the information-theoretic expression in terms of error probability alone in the specific example of the Hopfield neural network model of associative memory, a distributed information-processing system of many interacting stochastic bits. In this framework the Landauer bound sets a lower limit for the work associated with "remembering" rather than "forgetting"

cond-mat.dis-nn↗

arXiv2018

Statistics of optimal information flow in ensembles of regulatory motifs

Genetic regulatory circuits universally cope with different sources of noise that limit their ability to coordinate input and output signals. In many cases, optimal regulatory performance can be thought to correspond to configurations of variables and parameters that maximize the mutual information between inputs and outputs. Such optima have been well characterized in several biologically relevant cases over the past decade. Here we use methods of statistical field theory to calculate the statistics of the maximal mutual information (the `capacity') achievable by tuning the input variable only in an ensemble of regulatory motifs, such that a single controller regulates N targets. Assuming (i) sufficiently large N, (ii) quenched random kinetic parameters, and (iii) small noise affecting the input-output channels, we can accurately reproduce numerical simulations both for the mean capacity and for the whole distribution. Our results provide insight into the inherent variability in effectiveness occurring in regulatory systems with heterogeneous kinetic parameters.

q-bio.MN↗