Related papers: Algorithms to generate saturated random sequential…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
A mathematical model of the process of carbon capture in a packed column by adsorption is developed and analysed. First a detailed study is made of the governing equations. Due to the complexity of the internal geometry it is standard…
This work presents an efficient algorithm for generating statistically representative microstructures of particulate composites in periodic representative volume elements. The Swelling and Random Migration (SRM) algorithm combines…
We present a new sink particle algorithm developed for the Adaptive Mesh Refinement code RAMSES. Our main addition is the use of a clump finder to identify density peaks and their associated regions (the peak patches). This allows us to…
We study the surface growth generated by the random deposition of particles of different sizes. A model is proposed where the particles are aggregated on an initially flat surface, giving rise to a rough interface and a porous bulk. By…
The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume…
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core…
Connectedness percolation phenomena in the two-dimensional (2D) packing of binary mixtures of disks with different diameters were studied numerically. The packings were produced using random sequential adsorption (RSA) model with…
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…
A Matlab-based computational procedure is proposed to fill a given volume with spheres whose radii are randomly picked from any specified probability distribution supported by \verb|Matlab|. The general program sequence and examples of…
We produce oriented rotational wave packets in CO and measure their characteristics via high harmonic generation. The wavepacket is created using an intense, femtosecond laser pulse and its second harmonic. A delayed 800 nm pulse probes the…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
We systematically investigate the self-assembly of anisotropic cone-shaped particles decorated by ring-like attractive patches. We demonstrate that the self-assembled clusters, which arise due to the conical particle's anisotropic shape…
The conformational behavior of a coarse-grained finite polymer chain near an attractive spherical surface was investigated by means of multicanonical Monte Carlo computer simulations. In a detailed analysis of canonical equilibrium data…
Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…
Granular materials segregate spontaneously due to differences in particle size, shape, density and flow behaviour. In this paper we experimentally investigate density-difference-driven segregation for a range of density ratios and a range…
The growth of a rough and porous thin surface by deposition of randomly shaped clusters with different sizes over an initially flat linear substrate is simulated, using Monte Carlo technique. Unlike the ordinary Random Deposition, our…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…