No Arabic abstract
The entrainment transition of coupled random frequency oscillators presents a long-standing problem in nonlinear physics. The onset of entrainment in populations of large but finite size exhibits strong sensitivity to fluctuations in the oscillator density at the synchronizing frequency. This is the source for the unusual values assumed by the correlation size exponent $ u$. Locally coupled oscillators on a $d$-dimensional lattice exhibit two types of frequency entrainment: symmetry-breaking at $d > 4$, and aggregation of compact synchronized domains in three and four dimensions. Various critical properties of the transition are well captured by finite-size scaling relations with simple yet unconventional exponent values.
Wetting transitions have been predicted and observed to occur for various combinations of fluids and surfaces. This paper describes the origin of such transitions, for liquid films on solid surfaces, in terms of the gas-surface interaction potentials V(r), which depend on the specific adsorption system. The transitions of light inert gases and H2 molecules on alkali metal surfaces have been explored extensively and are relatively well understood in terms of the least attractive adsorption interactions in nature. Much less thoroughly investigated are wetting transitions of Hg, water, heavy inert gases and other molecular films. The basic idea is that nonwetting occurs, for energetic reasons, if the adsorption potentials well-depth D is smaller than, or comparable to, the well-depth of the adsorbate-adsorbate mutual interaction. At the wetting temperature, Tw, the transition to wetting occurs, for entropic reasons, when the liquids surface tension is sufficiently small that the free energy cost in forming a thick film is sufficiently compensated by the fluid- surface interaction energy. Guidelines useful for exploring wetting transitions of other systems are analyzed, in terms of generic criteria involving the simple model, which yields results in terms of gas-surface interaction parameters and thermodynamic properties of the bulk adsorbate.
Due to the discrete nature of words, language GANs require to be optimized from rewards provided by discriminator networks, via reinforcement learning methods. This is a much harder setting than for continuous tasks, which enjoy gradient flows from discriminators to generators, usually leading to dramatic learning instabilities. However, we claim that this can be solved by making discriminator and generator networks cooperate to produce output sequences during training. These cooperative outputs, inherently built to obtain higher discrimination scores, not only provide denser rewards for training, but also form a more compact artificial set for discriminator training, hence improving its accuracy and stability. In this paper, we show that our SelfGAN framework, built on this cooperative principle, outperforms Teacher Forcing and obtains state-of-the-art results on two challenging tasks, Summarization and Question Generation.
Being fundamentally a non-equilibrium process, synchronization comes with unavoidable energy costs and has to be maintained under the constraint of limited resources. Such resource constraints are often reflected as a finite coupling budget available in a network to facilitate interaction and communication. Here, we show that introducing temporal variation in the network structure can lead to efficient synchronization even when stable synchrony is impossible in any static network under the given budget, thereby demonstrating a fundamental advantage of temporal networks. The temporal networks generated by our open-loop design are versatile in the sense of promoting synchronization for systems with vastly different dynamics, including periodic and chaotic dynamics in both discrete-time and continuous-time models. Furthermore, we link the dynamic stabilization effect of the changing topology to the curvature of the master stability function, which provides analytical insights into synchronization on temporal networks in general. In particular, our results shed light on the effect of network switching rate and explain why certain temporal networks synchronize only for intermediate switching rate.
A cornerstone assumption that most literature on discrete time crystals has relied on is that homogeneous Floquet systems generally heat to a featureless infinite temperature state, an expectation that motivated researchers in the field to mostly focus on many-body localized systems. Some works have however shown that the standard diagnostics for time crystallinity apply equally well to clean settings without disorder. This fact raises the question whether an homogeneous discrete time crystal is possible in which the originally expected heating is evaded. Studying both a localized and an homogeneous model with short-range interactions, we clarify this issue showing explicitly the key differences between the two cases. On the one hand, our careful scaling analysis confirms that, in the thermodynamic limit and in contrast to localized discrete time crystals, homogeneous systems indeed heat. On the other hand, we show that, thanks to a mechanism reminiscent of quantum scars, finite-size homogeneous systems can still exhibit very crisp signatures of time crystallinity. A subharmonic response can in fact persist over timescales that are much larger than those set by the integrability-breaking terms, with thermalization possibly occurring only at very large system sizes (e.g., of hundreds of spins). Beyond clarifying the emergence of heating in disorder-free systems, our work casts a spotlight on finite-size homogeneous systems as prime candidates for the experimental implementation of nontrivial out-of-equilibrium physics.
In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. It is shown by examples that the answer is negative. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, an example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.