45,358 research outputs found

    The Value-of-Information in Matching with Queues

    Full text link
    We consider the problem of \emph{optimal matching with queues} in dynamic systems and investigate the value-of-information. In such systems, the operators match tasks and resources stored in queues, with the objective of maximizing the system utility of the matching reward profile, minus the average matching cost. This problem appears in many practical systems and the main challenges are the no-underflow constraints, and the lack of matching-reward information and system dynamics statistics. We develop two online matching algorithms: Learning-aided Reward optimAl Matching (LRAM\mathtt{LRAM}) and Dual-LRAM\mathtt{LRAM} (DRAM\mathtt{DRAM}) to effectively resolve both challenges. Both algorithms are equipped with a learning module for estimating the matching-reward information, while DRAM\mathtt{DRAM} incorporates an additional module for learning the system dynamics. We show that both algorithms achieve an O(ϵ+δr)O(\epsilon+\delta_r) close-to-optimal utility performance for any ϵ>0\epsilon>0, while DRAM\mathtt{DRAM} achieves a faster convergence speed and a better delay compared to LRAM\mathtt{LRAM}, i.e., O(δz/ϵ+log(1/ϵ)2))O(\delta_{z}/\epsilon + \log(1/\epsilon)^2)) delay and O(δz/ϵ)O(\delta_z/\epsilon) convergence under DRAM\mathtt{DRAM} compared to O(1/ϵ)O(1/\epsilon) delay and convergence under LRAM\mathtt{LRAM} (δr\delta_r and δz\delta_z are maximum estimation errors for reward and system dynamics). Our results reveal that information of different system components can play very different roles in algorithm performance and provide a systematic way for designing joint learning-control algorithms for dynamic systems

    Generalized Bose-Fermi statistics and structural correlations in weighted networks

    Full text link
    We derive a class of generalized statistics, unifying the Bose and Fermi ones, that describe any system where the first-occupation energies or probabilities are different from subsequent ones, as in presence of thresholds, saturation, or aging. The statistics completely describe the structural correlations of weighted networks, which turn out to be stronger than expected and to determine significant topological biases. Our results show that the null behavior of weighted networks is different from what previously believed, and that a systematic redefinition of weighted properties is necessary.Comment: Final version accepted for publication on Physical Review Letter

    Convergence and Growth Linkages Between North and South

    Get PDF
    Using cross-sectional data for 98 countries for 1960-85, this paper shows that growth of per capita GDP depends negatively on initial income levels, as implied by the convergence hypothesis, as well as on international differences in investment rates in physical and human capital. There is some evidence of slight economies of scale (1.06) among the industrial countries. The evidence in favor of the convergence hypothesis is strongest for the countries of the OECD and Latin America, and weakest for Asia. Growth in Latin America and Africa is lower than elsewhere even after allowing for international differences in initial income levels, scale, schooling and capital investment. Analysis of Solow residuals for the OECD countries (for which capital stock data are available) shows convergence in rates of technical progress, suggesting that convergence of per capita GDPs is not Just a function of differences in investment rates. The linkage between per capita GDP and the real exchange rate is found to be strong for the OECD and Asia, weak for Africa and negative for Latin America.

    Supersolid phases in the extended boson hubbard model

    Full text link
    We present a comprehensive numerical study on the ground state phase diagram of the two-dimensional hardcore boson extended Hubbard model with nearest (V1V_1) and next nearest neighbor (V2V_2) repulsions. In addition to the quantum solid and superfluid phases, we report the existence of striped supersolid and three-quarter (quarter) filled supersolid at commensurate density ρ=0.75\rho=0.75 (0.25) due to the interplay of V1V_1 and V2V_2 interactions. The nature of three-quarter filled supersolid and the associated quantum solid will be discussed. Quantum phase transition between the two supersolids of different symmetries is observed and is clearly of first order.Comment: 4 pages, 6 figure

    Commensurate lock-in and incommensurate supersolid phases of hardcore bosons on anisotropic triangular lattices

    Get PDF
    We investigate the interplay between commensurate lock-in and incommensurate supersolid phases of the hardcore bosons at half-filling with anisotropic nearest-neighbor hopping and repulsive interactions on triangular lattice. We use numerical quantum and variational Monte Carlo as well as analytical Schwinger boson mean-field analysis to establish the ground states and phase diagram. It is shown that, for finite size systems, there exist a series of jumps between different supersolid phases as the anisotropy parameter is changed. The density ordering wavevectors are locked to commensurate values and jump between adjacent supersolids. In the thermodynamic limit, however, the magnitude of these jumps vanishes leading to a continuous set of novel incommensurate supersoild phases.Comment: 5 pages, 5 figures, added new results, changed title and conclusio

    Navigation in a small world with local information

    Full text link
    It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very serious limit of information. To theoretically study this issue, here the navigation process of launching messages toward designated targets is investigated on a variant of the one-dimensional small-world network (SWN). In the network structure considered, the probability of a shortcut falling between a pair of nodes is proportional to rαr^{-\alpha}, where rr is the lattice distance between the nodes. When α=0\alpha =0, it reduces to the SWN model with random shortcuts. The system shows the dynamic small-world (SW) effect, which is different from the well-studied static SW effect. We study the effective network diameter, the path length as a function of the lattice distance, and the dynamics. They are controlled by multiple parameters, and we use data collapse to show that the parameters are correlated. The central finding is that, in the one-dimensional network studied, the dynamic SW effect exists for 0α20\leq \alpha \leq 2. For each given value of α\alpha in this region, the point that the dynamic SW effect arises is ML1ML^{\prime}\sim 1, where MM is the number of useful shortcuts and LL^{\prime} is the average reduced (effective) length of them.Comment: 10 pages, 5 figures, accepted for publication in Physical Review

    Evolution of the single-hole spectral function across a quantum phase transition in the anisotropic-triangular-lattice antiferromagnet

    Full text link
    We study the evolution of the single-hole spectral function when the ground state of the anisotropic-triangular-lattice antiferromagnet changes from the incommensurate magnetically-ordered phase to the spin-liquid state. In order to describe both of the ground states on equal footing, we use the large-N approach where the transition between these two phases can be obtained by controlling the quantum fluctuations via an 'effective' spin magnitude. Adding a hole into these ground states is described by a t-J type model in the slave-fermion representation. Implications of our results to possible future ARPES experiments on insulating frustrated magnets, especially Cs2_2CuCl4_4, are discussed.Comment: 8 pages, 7 figure

    A paradox in community detection

    Full text link
    Recent research has shown that virtually all algorithms aimed at the identification of communities in networks are affected by the same main limitation: the impossibility to detect communities, even when these are well-defined, if the average value of the difference between internal and external node degrees does not exceed a strictly positive value, in literature known as detectability threshold. Here, we counterintuitively show that the value of this threshold is inversely proportional to the intrinsic quality of communities: the detection of well-defined modules is thus more difficult than the identification of ill-defined communities.Comment: 5 pages, 3 figure
    corecore