Related papers: Algorithms for 3D rigidity analysis and a first or…
Blood vessel networks form by spontaneous aggregation of individual cells migrating toward vascularization sites (vasculogenesis). A successful theoretical model of two dimensional experimental vasculogenesis has been recently proposed,…
Off-equilibrium dynamics of a three-dimensional lattice model with nearest- and next nearest-neighbors exclusions is studied. At equilibrium, the model undergoes a first-order fluid-solid transition. Non-equilibrium filling, through random…
We consider the general p-state Potts model on random networks with a given degree distribution (random Bethe lattices). We find the effect of the suppression of a first order phase transition in this model when the degree distribution of…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
Elegant integration schemes of second and fourth order for simulations of rigid body systems are presented which treat translational and rotational motion on the same footing. This is made possible by a recent implementation of the exact…
It has been shown recently that predictions from Mode-Coupling Theory for the glass transition of hard-spheres become increasingly bad when dimensionality increases, whereas replica theory predicts a correct scaling. Nevertheless if one…
We propose a generalized GPU-based connected component labeling (CCL) algorithm that can be applied to both various lattices and to non-lattice environments in a uniform fashion. We extend our recent GPU-based CCL algorithm without the use…
In this paper, we investigate the effect of local structures on network processes. We investigate a random graph model that incorporates local clique structures to deviate from the locally tree-like behavior of most standard random graph…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
Network structure is a mechanism for promoting cooperation in social dilemma games. In the present study, we explore graph surgery, i.e., to slightly perturb the given network, towards a network that better fosters cooperation. To this end,…
3D Computer simulations and experiments are employed to study random packings of compressible spherical grains under external confining stress. Of particular interest is the rigid ball limit, which we describe as a continuous transition in…
In this paper we propose a novel method to study critical systems numerically by a combined collective-mode algorithm and Renormalization Group on the lattice. This method is an improved version of MCRG in the sense that it has all the…
Graph pebbling is a problem in which pebbles are distributed across the vertices of a graph and moved according to a specific rule: two pebbles are removed from a vertex to place one on an adjacent vertex. The goal is to determine the…
How condensed-matter simulations depend on the number of molecules being simulated ($N$) is sometimes itself a valuable piece of information. Liquid crystals provide a case in point. Light scattering and $2d$-IR experiments on…
We study numerically how multiple deformable capsules squeeze into a constriction. This situation is largely encountered in microfluidic chips designed to manipulate living cells, which are soft entities. We use fully three-dimensional…
Besides their huge technological importance, fluidized beds have attracted a large amount of research because they are perfect playgrounds to investigate highly dynamic particulate flows. Their over-all behavior is determined by…
The widespread adoption of deep learning models places demands on their robustness. In this paper, we consider the robustness of deep neural networks on videos, which comprise both the spatial features of individual frames extracted by a…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…