3,252 research outputs found

    Effects of degree distribution in mutual synchronization of neural networks

    Full text link
    We study the effects of the degree distribution in mutual synchronization of two-layer neural networks. We carry out three coupling strategies: large-large coupling, random coupling, and small-small coupling. By computer simulations and analytical methods, we find that couplings between nodes with large degree play an important role in the synchronization. For large-large coupling, less couplings are needed for inducing synchronization for both random and scale-free networks. For random coupling, cutting couplings between nodes with large degree is very efficient for preventing neural systems from synchronization, especially when subnetworks are scale-free.Comment: 5 pages, 4 figure

    Trapped interacting two-component bosons

    Full text link
    In this paper we solve one dimensional trapped SU(2) bosons with repulsive δ\delta-function interaction by means of Bethe-ansatz method. The features of ground state and low-lying excited states are studied by numerical and analytic methods. We show that the ground state is an isospin "ferromagnetic" state which differs from spin-1/2 fermions system. There exist three quasi-particles in the excitation spectra, and both holon-antiholon and holon-isospinon excitations are gapless for large systems. The thermodynamics equilibrium of the system at finite temperature is studied by thermodynamic Bethe ansatz. The thermodynamic quantities, such as specific heat etc. are obtained for the case of strong coupling limit.Comment: 15 pages, 9 figure

    Fidelity, dynamic structure factor, and susceptibility in critical phenomena

    Get PDF
    Motivated by the growing importance of fidelity in quantum critical phenomena, we establish a general relation between fidelity and structure factor of the driving term in a Hamiltonian through a newly introduced concept: fidelity susceptibility. Our discovery, as shown by some examples, facilitates the evaluation of fidelity in terms of susceptibility using well developed techniques such as density matrix renormalization group for the ground state, or Monte Carlo simulations for the states in thermal equilibrium.Comment: 4 pages, 2 figures, final version accepted by PR

    Fast Projected Newton-like Method for Precision Matrix Estimation with Nonnegative Partial Correlations

    Full text link
    We study the problem of estimating precision matrices in multivariate Gaussian distributions where all partial correlations are nonnegative, also known as multivariate totally positive of order two (MTP2\mathrm{MTP}_2). Such models have received significant attention in recent years, primarily due to interesting properties, e.g., the maximum likelihood estimator exists with as few as two observations regardless of the underlying dimension. We formulate this problem as a weighted â„“1\ell_1-norm regularized Gaussian maximum likelihood estimation under MTP2\mathrm{MTP}_2 constraints. On this direction, we propose a novel projected Newton-like algorithm that incorporates a well-designed approximate Newton direction, which results in our algorithm having the same orders of computation and memory costs as those of first-order methods. We prove that the proposed projected Newton-like algorithm converges to the minimizer of the problem. We further show, both theoretically and experimentally, that the minimizer of our formulation using the weighted â„“1\ell_1-norm is able to recover the support of the underlying precision matrix correctly without requiring the incoherence condition present in â„“1\ell_1-norm based methods. Experiments involving synthetic and real-world data demonstrate that our proposed algorithm is significantly more efficient, from a computational time perspective, than the state-of-the-art methods. Finally, we apply our method in financial time-series data, which are well-known for displaying positive dependencies, where we observe a significant performance in terms of modularity value on the learned financial networks.Comment: 43 pages; notation updated for section

    TRUNDD, a new member of the TRAIL receptor family that antagonizes TRAIL signalling

    Get PDF
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/116376/1/feb2s0014579398001355.pd

    Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks

    Full text link
    A modified spatial prisoner's dilemma game with voluntary participation in Newman-Watts small-world networks is studied. Some reasonable ingredients are introduced to the game evolutionary dynamics: each agent in the network is a pure strategist and can only take one of three strategies (\emph {cooperator}, \emph {defector}, and \emph {loner}); its strategical transformation is associated with both the number of strategical states and the magnitude of average profits, which are adopted and acquired by its coplayers in the previous round of play; a stochastic strategy mutation is applied when it gets into the trouble of \emph {local commons} that the agent and its neighbors are in the same state and get the same average payoffs. In the case of very low temptation to defect, it is found that agents are willing to participate in the game in typical small-world region and intensive collective oscillations arise in more random region.Comment: 4 pages, 5 figure

    Evolutionary prisoner's dilemma game with dynamic preferential selection

    Full text link
    We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player update its strategy by following one of the neighboring strategies with a probability dependent on the payoff difference. The neighbor selection obeys a dynamic preferential rule, i.e., the more frequently a neighbor's strategy was adopted by the focal player in the previous rounds, the larger probability it will be chosen to refer to in the subsequent rounds. It is found that cooperation is substantially promoted due to this simple selection mechanism. Corresponding analysis is provided by the investigations of the distribution of players' impact weights, persistence, and as well as correlation function.Comment: 7 pages, 5 figure

    Walks on weighted networks

    Full text link
    We investigate the dynamics of random walks on weighted networks. Assuming that the edge's weight and the node's strength are used as local information by a random walker, we study two kinds of walks, weight-dependent walk and strength-dependent walk. Exact expressions for stationary distribution and average return time are derived and confirmed by computer simulations. We calculate the distribution of average return time and the mean-square displacement for two walks on the BBV networks, and find that a weight-dependent walker can arrive at a new territory more easily than a strength-dependent one.Comment: 4 pages, 5 figures. minor modifications. Comments and suggestions are favored by the author
    • …
    corecore