arXiv subjects

Joshua E. S. Socolar

Publications and source records attributed to Joshua E. S. Socolar.

At least 37 records · Page 2Linked to original sources

arXiv2015

Phase Transformations in Binary Colloidal Monolayers

Phase transformations can be difficult to characterize at the microscopic level due to the inability to directly observe individual atomic motions. Model colloidal systems, by contrast, permit the direct observation of individual particle dynamics and of collective rearrangements, which allows for real-space characterization of phase transitions. Here, we study a quasi-two-dimensional, binary colloidal alloy that exhibits liquid-solid and solid-solid phase transitions, focusing on the kinetics of a diffusionless transformation between two crystal phases. Experiments are conducted on a monolayer of magnetic and nonmagnetic spheres suspended in a thin layer of ferrofluid and exposed to a tunable magnetic field. A theoretical model of hard spheres with point dipoles at their centers is used to guide the choice of experimental parameters and characterize the underlying materials physics. When the applied field is normal to the fluid layer, a checkerboard crystal forms; when the angle between the field and the normal is sufficiently large, a striped crystal assembles. As the field is slowly tilted away from the normal, we find that the transformation pathway between the two phases depends strongly on crystal orientation, field strength, and degree of confinement of the monolayer. In some cases, the pathway occurs by smooth magnetostrictive shear, while in others it involves the sudden formation of martensitic plates.

cond-mat.soft↗

arXiv2014

Emergence of limit-periodic order in tiling models

A 2D lattice model defined on a triangular lattice with nearest- and next-nearest-neighbor interactions based on the Taylor-Socolar monotile is known to have a limit-periodic ground state. The system reaches that state during a slow quench through an infinite sequence of phase transitions. We study the model as a function of the strength of the next-nearest-neighbor interactions, and introduce closely related 3D models with only nearest-neighbor interactions that exhibit limit-periodic phases. For models with no next-nearest-neighbor interactions of the Taylor-Socolar type, there is a large degenerate classes of ground states, including crystalline patterns and limit-periodic ones, but a slow quench still yields the limit-periodic state. For the Taylor-Socolar lattice model, we present calculations of the diffraction pattern for a particular decoration of the tile that permits exact expressions for the amplitudes, and identify domain walls that slow the relaxation times in the ordered phases. For one of the 3D models, we show that the phase transitions are first order, with equilibrium structures that can be more complex than in the 2D case, and we include a proof of aperiodicity for a geometrically simple tile with only nearest-neighbor matching rules.

cond-mat.stat-mech↗

arXiv2012

Quantifying the complexity of random Boolean networks

We study two measures of the complexity of heterogeneous extended systems, taking random Boolean networks as prototypical cases. A measure defined by Shalizi et al. for cellular automata, based on a criterion for optimal statistical prediction [Shalizi et al., Phys. Rev. Lett. 93, 118701 (2004)], does not distinguish between the spatial inhomogeneity of the ordered phase and the dynamical inhomogeneity of the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing complexity values for networks in the ordered and critical regimes and for highly disordered networks, peaking somewhere in the disordered regime. Individual nodes with high complexity are the ones that pass the most information from the past to the future, a quantity that depends in a nontrivial way on both the Boolean function of a given node and its location within the network.

nlin.CG↗

arXiv2012

Hierarchical freezing in a lattice model

A certain two-dimensional lattice model with nearest and next-nearest neighbor interactions is known to have a limit-periodic ground state. We show that during a slow quench from the high temperature, disordered phase, the ground state emerges through an infinite sequence of phase transitions. We define appropriate order parameters and show that the transitions are related by renormalizations of the temperature scale. As the temperature is decreased, sublattices with increasingly large lattice constants become ordered. A rapid quench results in glass-like state due to kinetic barriers created by simultaneous freezing on sublattices with different lattice constants.

cond-mat.stat-mech↗

arXiv2011

Forcing nonperiodicity with a single tile

An aperiodic prototile is a shape for which infinitely many copies can be arranged to fill Euclidean space completely with no overlaps, but not in a periodic pattern. Tiling theorists refer to such a prototile as an "einstein" (a German pun on "one stone"). The possible existence of an einstein has been pondered ever since Berger's discovery of large set of prototiles that in combination can tile the plane only in a nonperiodic way. In this article we review and clarify some features of a prototile we recently introduced that is an einstein according to a reasonable definition. [This abstract does not appear in the published article.]

math.CO↗

arXiv2010

An aperiodic hexagonal tile

We show that a single prototile can fill space uniformly but not admit a periodic tiling. A two-dimensional, hexagonal prototile with markings that enforce local matching rules is proven to be aperiodic by two independent methods. The space--filling tiling that can be built from copies of the prototile has the structure of a union of honeycombs with lattice constants of $2^n a$, where $a$ sets the scale of the most dense lattice and $n$ takes all positive integer values. There are two local isomorphism classes consistent with the matching rules and there is a nontrivial relation between these tilings and a previous construction by Penrose. Alternative forms of the prototile enforce the local matching rules by shape alone, one using a prototile that is not a connected region and the other using a three--dimensional prototile.

math.CO↗

arXiv2009

On the Origin of Chaos in Autonomous Boolean Networks

We undertake a systematic study of the dynamics of Boolean networks to determine the origin of chaos observed in recent experiments. Networks with nodes consisting of ideal logic gates are known to display either steady states, periodic behavior, or an ultraviolet catastrophe where the number of logic-transition events circulating in the network per unit time grows as a power-law. In an experiment, non-ideal behavior of the logic gates prevents the ultraviolet catastrophe and may lead to deterministic chaos. We identify certain non-ideal features of real logic gates that enable chaos in experimental networks. We find that short-pulse rejection and the asymmetry between the logic states tends to engender periodic behavior, at least for the simplest networks. On the other hand, we find that a memory effect termed "degradation" can generate chaos. Our results strongly suggest that deterministic chaos can be expected in a large class of experimental Boolean-like networks. Such devices may find application in a variety of technologies requiring fast complex waveforms or flat power spectra, and can be used as a test-bed for fundamental studies of real-world Boolean-like networks.

nlin.CD↗

arXiv2009

Boolean Chaos

We observe deterministic chaos in a simple network of electronic logic gates that are not regulated by a clocking signal. The resulting power spectrum is ultra-wide-band, extending from dc to beyond 2 GHz. The observed behavior is reproduced qualitatively using an autonomously updating Boolean model with signal propagation times that depend on the recent history of the gates and filtering of pulses of short duration, whose presence is confirmed experimentally. Electronic Boolean chaos may find application as an ultra-wide-band source of radio waves

nlin.CD↗

arXiv2009

Boolean modeling of collective effects in complex networks

Complex systems are often modeled as Boolean networks in attempts to capture their logical structure and reveal its dynamical consequences. Approximating the dynamics of continuous variables by discrete values and Boolean logic gates may, however, introduce dynamical possibilities that are not accessible to the original system. We show that large random networks of variables coupled through continuous transfer functions often fail to exhibit the complex dynamics of corresponding Boolean models in the disordered (chaotic) regime, even when each individual function appears to be a good candidate for Boolean idealization. A suitably modified Boolean theory explains the behavior of systems in which information does not propagate faithfully down certain chains of nodes. Model networks incorporating calculated or directly measured transfer functions reported in the literature on transcriptional regulation of genes are described by the modified theory.

q-bio.MN↗

arXiv2007

Mutual information in random Boolean models of regulatory networks

The amount of mutual information contained in time series of two elements gives a measure of how well their activities are coordinated. In a large, complex network of interacting elements, such as a genetic regulatory network within a cell, the average of the mutual information over all pairs is a global measure of how well the system can coordinate its internal dynamics. We study this average pairwise mutual information in random Boolean networks (RBNs) as a function of the distribution of Boolean rules implemented at each element, assuming that the links in the network are randomly placed. Efficient numerical methods for calculating show that as the number of network nodes N approaches infinity, the quantity N exhibits a discontinuity at parameter values corresponding to critical RBNs. For finite systems it peaks near the critical value, but slightly in the disordered regime for typical parameter variations. The source of high values of N is the indirect correlations between pairs of elements from different long chains with a common starting point. The contribution from pairs that are directly linked approaches zero for critical networks and peaks deep in the disordered regime.

q-bio.OT↗

arXiv2007

Hexagonal parquet tilings: k-isohedral monotiles with arbitrarily large k

This paper addresses the question of whether a single tile with nearest neighbor matching rules can force a tiling in which the tiles fall into a large number of isohedral classes. A single tile is exhibited that can fill the Euclidean plane only with a tiling that contains k distinct isohedral sets of tiles, where k can be made arbitrarily large. It is shown that the construction cannot work for a simply connected 2D tile with matching rules for adjacent tiles enforced by shape alone. It is also shown that any of the following modifications allows the construction to work: (1) coloring the edges of the tiling and imposing rules on which colors can touch; (2) allowing the tile to be multiply connected; (3) requiring maximum density rather than space-filling; (4) allowing the tile to have a thickness in the third dimension.

cond-mat.other↗

arXiv2007

Attractors in continuous and Boolean networks

We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of generic continuous systems. We investigate the dynamics in simple rings and rings with one additional self-input. An analysis of switching characteristics and pulse propagation explains the relation between attractors of the continuous systems and their Boolean approximations. For simple rings, "reliable" Boolean attractors correspond to stable continuous attractors. For networks with more complex logic, the qualitative features of continuous attractors are influenced by inherently non-Boolean characteristics of switching events.

q-bio.MN↗

arXiv2007

Network Analysis of the State Space of Discrete Dynamical Systems

We study networks representing the dynamics of elementary 1-d cellular automata (CA) on finite lattices. We analyze scaling behaviors of both local and global network properties as a function of system size. The scaling of the largest node in-degree is obtained analytically for a variety of CA including rules 22, 54 and 110. We further define the \emph{path diversity} as a global network measure. The co-appearance of non-trivial scaling in both hub size and path diversity separates simple dynamics from the more complex behaviors typically found in Wolfram's Class IV and some Class III CA.

cond-mat.stat-mech↗

arXiv2006

Exhaustive percolation on random networks

We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a phenomenon we refer to as exhaustive percolation. We derive scaling law exponents and exact results for the distribution of the number of undamaged nodes, valid for a broad class of random networks at the exhaustive percolation transition and in the exhaustive percolation regime. This class includes processes that determine the set of frozen nodes in random Boolean networks with indegree distributions that decay sufficiently rapidly with the number of inputs. Connections between our calculational methods and previous studies of percolation beginning from a single initial node are also pointed out. Central to our approach is the observation that key aspects of damage spreading on a random network are fully characterized by a single function specifying the probability that a given node will be damaged as a function of the fraction of damaged nodes. In addition to our analytical investigations of random networks, we present a numerical example of exhaustive percolation on a directed lattice.

nlin.CG↗

arXiv2005

Force distributions in a triangular lattice of rigid bars

We study the uniformly weighted ensemble of force balanced configurations on a triangular network of nontensile contact forces. For periodic boundary conditions corresponding to isotropic compressive stress, we find that the probability distribution for single-contact forces decays faster than exponentially. This super-exponential decay persists in lattices diluted to the rigidity percolation threshold. On the other hand, for anisotropic imposed stresses, a broader tail emerges in the force distribution, becoming a pure exponential in the limit of infinite lattice size and infinitely strong anisotropy.

cond-mat.soft↗

arXiv2003

Stability domains for time-delay feedback control with latency

We generalize a known analytical method for determining the stability of periodic orbits controlled by time-delay feedback methods when latencies associated with the generation and injection of the feedback signal cannot be ignored. We discuss the case of extended time-delay autosynchronization (ETDAS) and show that nontrivial qualitative features of the domain of control observed in experiments can be explained by taking into account the effects of both the unstable eigenmode and a single stable eigenmode in the Floquet theory.

nlin.CD↗

arXiv2003

Discrete models of force chain networks

A fundamental property of any material is its response to a localized stress applied at a boundary. For granular materials consisting of hard, cohesionless particles, not even the general form of the stress response is known. Directed force chain networks (DFCNs) provide a theoretical framework for addressing this issue, and analysis of simplified DFCN models reveal both rich mathematical structure and surprising properties. We review some basic elements of DFCN models and present a class of homogeneous solutions for cases in which force chains are restricted to lie on a discrete set of directions.

cond-mat.soft↗

arXiv2002

Scaling in ordered and critical random Boolean networks

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks lie at or near a critical point in parameter space that divides ``ordered'' from ``chaotic'' attractor dynamics. In the ordered regime, we show rigorously that the average number of relevant nodes (the ones that determine the attractor dynamics) remains constant with increasing system size N. For critical networks, our analysis and numerical results show that the number of relevant nodes scales like N^{1/3}. Numerical experiments also show that the median number of attractors in critical networks grows faster than linearly with N. The calculations explain why the correct asymptotic scaling is observed only for very large N.

cond-mat.dis-nn↗