Related papers: Random sampling vs. exact enumeration of attractor…
Homogeneous suspensions of red blood cells (RBCs or erythrocytes) in blood plasma are unstable in the absence of driving forces and form elongated stacks, called rouleau. These erythrocyte aggregates are often branched porous networks -- a…
In a previous contribution (H.J. Stoeckmann, J. Phys. A35, 5165 (2002)), the density of states was calculated for a billiard with randomly distributed delta-like scatterers, doubly averaged over the positions of the impurities and the…
Biological processes, including cell differentiation, organism development, and disease progression, can be interpreted as attractors (fixed points or limit cycles) of an underlying networked dynamical system. In this paper, we study the…
We investigate aggregation and fragmentation dynamics of tracers and inertial aggregates in random flows leading to steady state size distributions. Our objective is to elucidate the impact of changes in aggregation rates, due to…
We derive a self-duality relation for a one-dimensional model of branching and annihilating random walkers with an even number of offsprings. With the duality relation and by deriving exact results in some limiting cases involving fast…
Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes…
We derive mostly analytically the scaling behavior of the number of nonfrozen and relevant nodes in critical Kauffman networks (with two inputs per node) in the thermodynamic limit. By defining and analyzing a stochastic process that…
Patterns of animate and inanimate systems show remarkable similarities in their aggregation. One similarity is the double-Pareto distribution of the aggregate-size of system components. Different models have been developed to predict…
We define a probabilistic scheme to compute the distributions of periods, transients and weigths of attraction basins in Kauffman networks. These quantities are obtained in the framework of the annealed approximation, first introduced by…
We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…
We analyze the statistical complexity vs. entropy plane-representation of sampled chaotic attractors as a function of the sampling period {\tau}. It is shown that if the Bandt and Pompe procedure is used to assign a probability distribution…
We consider a stochastic process in which independent identically distributed random matrices are multiplied and where the Lyapunov exponent of the product is positive. We continue multiplying the random matrices as long as the norm,…
We consider a large family of branching-selection particle systems. The branching rate of each particle depends on its rank and is given by a function $b$ defined on the unit interval. There is also a killing measure $D$ supported on the…
We describe a general strategy for sampling configurations from a given distribution, NOT based on the standard Metropolis (Markov chain) strategy. It uses the fact that nontrivial problems in statistical physics are high dimensional and…
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples from these distributions. The primary drawback to traditional…
We consider a self-attracting random walk in dimension d=1, in presence of a field of strength s, which biases the walker toward a target site. We focus on the dynamic case (true reinforced random walk), where memory effects are implemented…
Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…
We introduce a general methodology of update rules accounting for arbitrary interevent time distributions in simulations of interacting agents. In particular we consider update rules that depend on the state of the agent, so that the update…
We study the properties of the random quantum states induced from the uniformly random pure states on a bipartite quantum system by taking the partial trace over the larger subsystem. Most of the previous studies have adopted a viewpoint of…