We study a model of nonidentical swarmalators, generalizations of phase oscillators that both sync in time and swarm in space. The model produces four collective states: asynchrony, sync clusters, vortexlike phase waves, and a mixed state. These states occur in many real-world swarmalator systems such as biological microswimmers, chemical nanomotors, and groups of drones. A generalized Ott-Antonsen ansatz provides the first analytic description of these states and conditions for their existence. We show how this approach may be used in studies of active matter and related disciplines.
We study the statistical properties of the sampled networks by a random walker. We compare topological properties of the sampled networks such as degree distribution, degree-degree correlation, and clustering coefficient with those of the original networks. From the numerical results, we find that most of topological properties of the sampled networks are almost the same as those of the original networks for . In contrast, we find that the degree distribution exponent of the sampled networks for somewhat deviates from that of the original networks when the ratio of the sampled network size to the original network size becomes smaller. We also apply the sampling method to various real networks such as collaboration of movie actor, Worldwide Web, and peer-to-peer networks. All topological properties of the sampled networks are essentially the same as those of the original real networks.
We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph, where a hyperedge can connect any number of vertices. These uncorrelated hypergraphs are treelike (hypertrees), which crucially simplifies the problem and allows us to apply the belief-propagation algorithm to these loopy networks with arbitrary motifs. As natural examples, we consider motifs in the form of finite loops and cliques. We apply the belief-propagation algorithm to the ferromagnetic Ising model with pairwise interactions on the resulting random networks and obtain an exact solution of this model. We find an exact critical temperature of the ferromagnetic phase transition and demonstrate that with increasing the clustering coefficient and the loop size, the critical temperature increases compared to ordinary treelike complex networks. However, weak clustering does not change the critical behavior qualitatively. Our solution also gives the birth point of the giant connected component in these loopy networks.
We study the impact of network heterogeneity on relaxation dynamics of the Kuramoto model on uncorrelated complex networks with scale-free degree distributions. Using the Ott-Antonsen method and the annealed-network approach, we find that the critical behavior of the relaxation rate near the synchronization phase transition does not depend on network heterogeneity and critical slowing down takes place at the critical point when the second moment of the degree distribution is finite. In the case of a complete graph we obtain an explicit result for the relaxation rate when the distribution of natural frequencies is Lorentzian. We also find a response of the Kuramoto model to an external field and show that the susceptibility of the model is inversely proportional to the relaxation rate. We reveal that network heterogeneity strongly impacts a field dependence of the relaxation rate and the susceptibility when the network has a divergent fourth moment of degree distribution. We introduce a pair correlation function of phase oscillators and show that it has a sharp peak at the critical point, signaling emergence of long-range correlations. Our numerical simulations of the Kuramoto model support our analytical results.
Reduction of frustration was the driving force in an approach to social balance as it was recently considered by Antal et al. [T. Antal, P. L. Krapivsky, and S. Redner, Phys. Rev. E 72, 036121 (2005)]. We generalize their triad dynamics to -cycle dynamics for arbitrary integer . We derive the phase structure, determine the stationary solutions, and calculate the time it takes to reach a frozen state. The main difference in the phase structure as a function of is related to being even or odd. As a second generalization we dilute the all-to-all coupling as considered by Antal et al. to a random network with connection probability . Interestingly, this model can be mapped to a satisfiability problem of computer science. The phase of social balance in our original interpretation then becomes the phase of satisfaction of all logical clauses in the satisfiability problem. In common to the cases we study, the ideal solution without any frustration always exists, but the question actually is as to whether this solution can be found by means of a local stochastic algorithm within a finite time. The answer depends on the choice of parameters. After establishing the mapping between the two classes of models, we generalize the social-balance problem to a diluted network topology for which the satisfiability problem is usually studied. On the other hand, in connection with the satisfiability problem we generalize the random local algorithm to a -random local algorithm, including a parameter that corresponds to the propensity parameter in the social balance problem. The qualitative effect of the inclusion of this parameter is a bias towards the optimal solution and a reduction of the needed simulation time.
Amyloid precursor protein (APP) is widely recognized for playing a central role in Alzheimer's disease pathogenesis. Although APP is expressed in several tissues outside the human central nervous system, the functions of APP and its family members in other tissues are still poorly understood. APP is involved in several biological functions which might be potentially important for male fertility, such as cell adhesion, cell motility, signaling, and apoptosis. Furthermore, APP superfamily members are known to be associated with fertility. Knowledge on the protein networks of APP in human testis and spermatozoa will shed light on the function of APP in the male reproductive system. We performed a Yeast Two-Hybrid screen and a database search to study the interaction network of APP in human testis and sperm. To gain insights into the role of APP superfamily members in fertility, the study was extended to APP-like protein 2 (APLP2). We analyzed several topological properties of the APP interaction network and the biological and physiological properties of the proteins in the APP interaction network were also specified by gene ontologyand pathways analyses. We classified significant features related to the human male reproduction for the APP interacting proteins and identified modules of proteins with similar functional roles which may show cooperative behavior for male fertility. The present work provides the first report on the APP interactome in human testis. Our approach allowed the identification of novel interactions and recognition of key APP interacting proteins for male reproduction, particularly in sperm-oocyte interaction.