Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “adap-org”

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 235 records · Page 13Linked to original sources

Self-Referential Noise and the Synthesis of Three-Dimensional Space

Generalising results from Godel and Chaitin in mathematics suggests that self-referential systems contain intrinsic randomness. We argue that this is relevant to modelling the universe and show how three-dimensional space may arise from a non-geometric order-disorder model driven by self-referential noise.

gr-qc↗

The Computational Complexity of Sandpiles

Given an initial distribution of sand in an Abelian sandpile, what final state does it relax to after all possible avalanches have taken place? In d >= 3, we show that this problem is P-complete, so that explicit simulation of the system is almost certainly necessary. We also show that the problem of determining whether a sandpile state is recurrent is P-complete in d >= 3. In d=1, we give two algorithms for predicting the sandpile on a lattice of size n, both faster than explicit simulation: a serial one that runs in time O(n log n), and a parallel one that runs in time O(log^3 n), i.e. in the class NC^3. The latter is based on a more general problem we call Additive Ranked Generability. This leaves the two-dimensional case as an interesting open problem.

cond-mat↗

Replica Symmetry Breaking in Short-Range Spin Glasses: Theoretical Foundations and Numerical Evidences

We discuss replica symmetry breaking (RSB) in spin glasses. We update work in this area, from both the analytical and numerical points of view. We give particular attention to the difficulties stressed by Newman and Stein concerning the problem of constructing pure states in spin glass systems. We mainly discuss what happens in finite-dimensional, realistic spin glasses. Together with a detailed review of some of the most important features, facts, data, and phenomena, we present some new theoretical ideas and numerical results. We discuss among others the basic idea of the RSB theory, correlation functions, interfaces, overlaps, pure states, random field, and the dynamical approach. We present new numerical results for the behaviors of coupled replicas and about the numerical verification of sum rules, and we review some of the available numerical results that we consider of larger importance (for example, the determination of the phase transition point, the correlation functions, the window overlaps, and the dynamical behavior of the system).

cond-mat.dis-nn↗

Stochastic calculus: application to dynamic bifurcations and threshold crossings

For the dynamic pitchfork bifurcation in the presence of white noise, the statistics of the last time at zero are calculated as a function of the noise level and the rate of change of the parameter. The threshold crossing problem used, for example, to model the firing of a single cortical neuron is considered, concentrating on quantities that may be experimentally measurable but have so far received little attention. Expressions for the statistics of pre-threshold excursions, occupation density and last crossing time of zero are compared with results from numerical generation of paths.

adap-org↗

Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness

We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single spin-flip dynamics of the Ising model at zero temperature. We show that in three or more dimensions these systems can simulate Boolean circuits of AND and OR gates, and are therefore P-complete. That is, predicting their state t time-steps in the future is at least as hard as any other problem that takes polynomial time on a serial computer. Therefore, unless a widely believed conjecture in computer science is false, it is impossible even with parallel computation to predict majority-vote cellular automata, or zero-temperature single spin-flip Ising dynamics, qualitatively faster than by explicit simulation.

cond-mat.stat-mech↗

The diameter of the world wide web

Despite its increasing role in communication, the world wide web remains the least controlled medium: any individual or institution can create websites with unrestricted number of documents and links. While great efforts are made to map and characterize the Internet's infrastructure, little is known about the topology of the web. Here we take a first step to fill this gap: we use local connectivity measurements to construct a topological model of the world wide web, allowing us to explore and characterize its large scale properties.

cond-mat.dis-nn↗

Molecular dynamics of arbitrarily shaped granular particles}

We propose a new model for the description of complex granular particles and their interaction in molecular dynamics simulations of granular material in two dimensions. The grains are composed of triangles which are connected by deformable beams. Particles are allowed to be convex or concave. We present first results of simulations using this particle model.

adap-org↗

Soft Turbulence in the Atmospheric Boundary Layer

In this work we compare the spectral properties of the daily medium temperature fluctuations with the experimental results of the Chicago Group, in which the local temperature fluctuations were measured in a helium cell. The results suggest that the dynamics of the daily temperature fluctuations is determined by the oft turbulent state of the atmospheric boundary layer, which state is significantly different from low dimensional chaos.

adap-org↗

Limited Range Fractality of Randomly Adsorbed Rods

Multiple resolution analysis of two dimensional structures composed of randomly adsorbed penetrable rods, for densities below the percolation threshold, has been carried out using box-counting functions. It is found that at relevant resolutions, for box-sizes, $r$, between cutoffs given by the average rod length $<\ell>$ and the average inter-rod distance $r_1$, these systems exhibit apparent fractal behavior. It is shown that unlike the case of randomly distributed isotropic objects, the upper cutoff $r_1$ is not only a function of the coverage but also depends on the excluded volume, averaged over the orientational distribution. Moreover, the apparent fractal dimension also depends on the orientational distributions of the rods and decreases as it becomes more anisotropic. For box sizes smaller than $<\ell>$ the box counting function is determined by the internal structure of the rods, whether simple or itself fractal. Two examples are considered - one of regular rods of one dimensional structure and rods which are trimmed into a Cantor set structure which are fractals themselves. The models examined are relevant to adsorption of linear molecules and fibers, liquid crystals, stress induced fractures and edge imperfections in metal catalysts. We thus obtain a distinction between two ranges of length scales: $r < <\ell>$ where the internal structure of the adsorbed objects is probed, and $<\ell> < r < r_1$ where their distribution is probed, both of which may exhibit fractal behavior. This distinction is relevant to the large class of systems which exhibit aggregation of a finite density of fractal-like clusters, which includes surface growth in molecular beam epitaxy and diffusion-limited-cluster-cluster-aggregation models.

cond-mat↗

Feynman-Kac Kernels in Markovian Representations of the Schroedinger Interpolating Dynamics

Probabilistic solutions of the so called Schrödinger boundary data problem provide for a unique Markovian interpolation between any two strictly positive probability densities designed to form the input-output statistics data for the process taking place in a finite-time interval. The key issue is to select the jointly continuous in all variables positive Feynman-Kac kernel, appropriate for the phenomenological (physical) situation. We extend the existing formulations of the problem to cases when the kernel is \it not \rm a fundamental solution of a parabolic equation, and prove the existence of a continuous Markov interpolation in this case. Next, we analyze the compatibility of this stochastic evolution with the original parabolic dynamics, while assumed to be governed by the temporally adjoint pair of (parabolic) partial differential equations, and prove that the pertinent random motion is a diffusion process. In particular, in conjunction with Born's statistical interpretation postulate in quantum theory, we consider stochastic processes which are compatible with the Schrödinger picture quantum evolution.

quant-ph↗

Fluid Models for Kinetic Effects on Coherent Nonlinear Alfven Waves. II. Numerical Solutions

The influence of various kinetic effects (e.g. Landau damping, diffusive and collisional dissipation, and finite Larmor radius terms) on the nonlinear evolution of finite amplitude Alfvenic wave trains in a finite-beta environment is systematically investigated using a novel, kinetic nonlinear Schrodinger (KNLS) equation. The dynamics of Alfven waves is sensitive to the sense of polarization as well as the angle of propagation with respect to the ambient magnetic field. Numerical solution for the case with Landau damping reveals the formation of dissipative structures, which are quasi-stationary, S-polarized directional (and rotational) discontinuities which self-organize from parallel propagating, linearly polarized waves. Parallel propagating circularly polarized packets evolve to a few circularly polarized Alfven harmonics on large scales. Stationary arc-polarized rotational discontinuities form from obliquely propagating waves. Collisional dissipation, even if weak, introduces enhanced wave damping when beta is very close to unity. Cyclotron motion effects on resonant particle interactions introduce cyclotron resonance into the nonlinear Alfven wave dynamics.

physics.plasm-ph↗

Strong Ordering by Non-uniformity of Thresholds in a Coupled Map Lattice

The coupled map lattice by Olami {\it et al.} [Phys. Rev. Lett. {\bf 68}, 1244 (1992)] is ``doped'' by letting just {\it one} site have a threshold, $T^{*}_{\rm max}$, bigger than the others. On an $L \times L$ lattice with periodic boundary conditions this leads to a transition from avalanche sizes of about one to exactly $L^2$, and after each avalanche stresses distributes among only five distinct values, $τ_{k}$, related to the parameters $α$ and $T^{*}_{\rm max}$ by $τ_{k}= kα T^{*}_{\rm max}$ where $k=0,1,2,3,4$. This result is independent of lattice size. The transient times are inversely proportional to the amount of doping and increase linearly with $L$.

adap-org↗

Phase space geometry and slow dynamics

We describe a non-Arrhenius mechanism for slowing down of dynamics that is inherent to the high dimensionality of the phase space. We show that such a mechanism is at work both in a family of mean-field spin-glass models without any domain structure and in the case of ferromagnetic domain growth. The marginality of spin-glass dynamics, as well as the existence of a `quasi equilibrium regime' can be understood within this scenario. We discuss the question of ergodicity in an out-of equilibrium situation.

cond-mat↗

Car accidents and number of stopped cars due to road blockage on a one-lane highway

Within the framework of a simple model of car traffic on a one-lane highway, we study the probability for car accidents to occur when drivers do not respect the safety distance between cars, and, as a result of the blockage during the time $T$ necessary to clear the road, we determine the number of stopped cars as a function of car density. We give a simple theory in good agreement with our numerical simulations.

adap-org↗

On-line learning of non-monotonic rules by simple perceptron

We study the generalization ability of a simple perceptron which learns unlearnable rules. The rules are presented by a teacher perceptron with a non-monotonic transfer function. The student is trained in the on-line mode. The asymptotic behaviour of the generalization error is estimated under various conditions. Several learning strategies are proposed and improved to obtain the theoretical lower bound of the generalization error.

cond-mat↗

Error threshold in simple landscapes

We consider the quasispecies description of a population evolving in both the "master sequence" landscape (where a single sequence is evolutionarily preferred over all others) and the REM landscape (where the fitness of different sequences is an independent, identically distributed, random variable). We show that, in both cases, the error threshold is analogous to a first order thermodynamical transition, where the overlap between the average genotype and the optimal one drops discontinuously to zero.

cond-mat.dis-nn↗

Entropic Sampling and Natural Selection in Biological Evolution

With a view to connecting random mutation on the molecular level to punctuated equilibrium behavior on the phenotype level, we propose a new model for biological evolution, which incorporates random mutation and natural selection. In this scheme the system evolves continuously into new configurations, yielding non-stationary behavior of the total fitness. Further, both the waiting time distribution of species and the avalanche size distribution display power-law behaviors with exponents close to two, which are consistent with the fossil data. These features are rather robust, indicating the key role of entropy.

cond-mat↗