Search results for "Hard"

On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search

2018

Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…

On the derivation of a linear Boltzmann equation from a periodic lattice gas

2004

We consider the problem of deriving the linear Boltzmann equation from the Lorentz process with hard spheres obstacles. In a suitable limit (the Boltzmann-Grad limit), it has been proved that the linear Boltzmann equation can be obtained when the position of obstacles are Poisson distributed, while the validation fails, also for the "correct" ratio between obstacle size and lattice parameter, when they are distributed on a purely periodic lattice, because of the existence of very long free trajectories. Here we validate the linear Boltzmann equation, in the limit when the scatterer's radius epsilon vanishes, for a family of Lorentz processes such that the obstacles have a random distributio…

Phase separation in multi-component mixtures: the four-component case

2002

Abstract Calculation of ternary phase diagrams for several mixtures formed by two salts and a neutral component is presented here. The phase diagrams are obtained by inspection of the shape of the Gibbs free energy of mixing surface (Gmix) as a function of the composition at constant temperature and pressure. The Gmix surface is calculated by the mean spherical approximation (MSA). The model for the mixtures is represented by hard spheres, with the charged components interacting via a Coulomb potential. The results are interpreted in terms of a thermodynamic analysis of the contributions to the Gibbs free energy of mixing, i.e., the configurational energy, the volume and the entropy of mixi…

Polydisperse hard spheres: crystallization kinetics in small systems and role of local structure

2016

We study numerically the crystallization of a hard-sphere mixture with 8\% polydispersity. Although often used as a model glass former, for small system sizes we observe crystallization in molecular dynamics simulations. This opens the possibility to study the competition between crystallization and structural relaxation of the melt, which typically is out of reach due to the disparate timescales. We quantify the dependence of relaxation and crystallization times on density and system size. For one density and system size we perform a detailed committor analysis to investigate the suitability of local structures as order parameters to describe the crystallization process. We find that local…

Bayesian analysis of a Gibbs hard-core point pattern model with varying repulsion range

2014

A Bayesian solution is suggested for the modelling of spatial point patterns with inhomogeneous hard-core radius using Gaussian processes in the regularization. The key observation is that a straightforward use of the finite Gibbs hard-core process likelihood together with a log-Gaussian random field prior does not work without penalisation towards high local packing density. Instead, a nearest neighbour Gibbs process likelihood is used. This approach to hard-core inhomogeneity is an alternative to the transformation inhomogeneous hard-core modelling. The computations are based on recent Markovian approximation results for Gaussian fields. As an application, data on the nest locations of Sa…

Selfish vs. Unselfish Optimization of Network Creation

2005

We investigate several variants of a network creation model: a group of agents builds up a network between them while trying to keep the costs of this network small. The cost function consists of two addends, namely (i) a constant amount for each edge an agent buys and (ii) the minimum number of hops it takes sending messages to other agents. Despite the simplicity of this model, various complex network structures emerge depending on the weight between the two addends of the cost function and on the selfish or unselfish behaviour of the agents.

Hard-Core Thinnings of Germ‒Grain Models with Power-Law Grain Sizes

2013

Random sets with long-range dependence can be generated using a Boolean model with power-law grain sizes. We study thinnings of such Boolean models which have the hard-core property that no grains overlap in the resulting germ‒grain model. A fundamental question is whether long-range dependence is preserved under such thinnings. To answer this question, we study four natural thinnings of a Poisson germ‒grain model where the grains are spheres with a regularly varying size distribution. We show that a thinning which favors large grains preserves the slow correlation decay of the original model, whereas a thinning which favors small grains does not. Our most interesting finding concerns the c…

Growth of a colloidal crystallite of hard spheres

1997

Abstract We examine the growth of a single nucleus of hard spheres in a super-saturated colloidal dispersion of hard spheres. A model developed by Bruce Ackerson and Klaus Schatzel based on a Wilson-Frenkel growth law is used. Our emphasis is on the profile of the radial density distribution around the growing (but still spherically symmetric) grain and its Fourier transform, the grain's form factor, which can be observed under small scattering angles in a dynamic light scattering experiment. Depending on the value of the supersaturation we can identify two limiting cases of different growth exponents and density profiles: one is the Frank theory of diffusion-limited growth and the other is…

"Cienīgs mācītājs! Izredzēts mīļojams draugs" : par Veco Stenderu un diviem brāļiem Harderiem

2018

Adaptive sparse representation of continuous input for tsetlin machines based on stochastic searching on the line

2021

This paper introduces a novel approach to representing continuous inputs in Tsetlin Machines (TMs). Instead of using one Tsetlin Automaton (TA) for every unique threshold found when Booleanizing continuous input, we employ two Stochastic Searching on the Line (SSL) automata to learn discriminative lower and upper bounds. The two resulting Boolean features are adapted to the rest of the clause by equipping each clause with its own team of SSLs, which update the bounds during the learning process. Two standard TAs finally decide whether to include the resulting features as part of the clause. In this way, only four automata altogether represent one continuous feature (instead of potentially h…