23,680 research outputs found
Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games
Cooperative games provide a framework for fair and stable profit allocation
in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are
such solution concepts that characterize stability of cooperation. In this
paper, we study the algorithmic issues on the least-core and nucleolus of
threshold cardinality matching games (TCMG). A TCMG is defined on a graph
and a threshold , in which the player set is and the profit of
a coalition is 1 if the size of a maximum matching in
meets or exceeds , and 0 otherwise. We first show that for a TCMG, the
problems of computing least-core value, finding and verifying least-core payoff
are all polynomial time solvable. We also provide a general characterization of
the least core for a large class of TCMG. Next, based on Gallai-Edmonds
Decomposition in matching theory, we give a concise formulation of the
nucleolus for a typical case of TCMG which the threshold equals . When
the threshold is relevant to the input size, we prove that the nucleolus
can be obtained in polynomial time in bipartite graphs and graphs with a
perfect matching
Single-cluster dynamics for the random-cluster model
We formulate a single-cluster Monte Carlo algorithm for the simulation of the
random-cluster model. This algorithm is a generalization of the Wolff
single-cluster method for the -state Potts model to non-integer values
. Its results for static quantities are in a satisfactory agreement with
those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which
involves a full cluster decomposition of random-cluster configurations. We
explore the critical dynamics of this algorithm for several two-dimensional
Potts and random-cluster models. For integer , the single-cluster algorithm
can be reduced to the Wolff algorithm, for which case we find that the
autocorrelation functions decay almost purely exponentially, with dynamic
exponents , and for , and
4 respectively. For non-integer , the dynamical behavior of the
single-cluster algorithm appears to be very dissimilar to that of the SWCM
algorithm. For large critical systems, the autocorrelation function displays a
range of power-law behavior as a function of time. The dynamic exponents are
relatively large. We provide an explanation for this peculiar dynamic behavior.Comment: 7 figures, 4 table
Olig2/Plp-positive progenitor cells give rise to Bergmann glia in the cerebellum.
NG2 (nerve/glial antigen2)-expressing cells represent the largest population of postnatal progenitors in the central nervous system and have been classified as oligodendroglial progenitor cells, but the fate and function of these cells remain incompletely characterized. Previous studies have focused on characterizing these progenitors in the postnatal and adult subventricular zone and on analyzing the cellular and physiological properties of these cells in white and gray matter regions in the forebrain. In the present study, we examine the types of neural progeny generated by NG2 progenitors in the cerebellum by employing genetic fate mapping techniques using inducible Cre-Lox systems in vivo with two different mouse lines, the Plp-Cre-ER(T2)/Rosa26-EYFP and Olig2-Cre-ER(T2)/Rosa26-EYFP double-transgenic mice. Our data indicate that Olig2/Plp-positive NG2 cells display multipotential properties, primarily give rise to oligodendroglia but, surprisingly, also generate Bergmann glia, which are specialized glial cells in the cerebellum. The NG2+ cells also give rise to astrocytes, but not neurons. In addition, we show that glutamate signaling is involved in distinct NG2+ cell-fate/differentiation pathways and plays a role in the normal development of Bergmann glia. We also show an increase of cerebellar oligodendroglial lineage cells in response to hypoxic-ischemic injury, but the ability of NG2+ cells to give rise to Bergmann glia and astrocytes remains unchanged. Overall, our study reveals a novel Bergmann glia fate of Olig2/Plp-positive NG2 progenitors, demonstrates the differentiation of these progenitors into various functional glial cell types, and provides significant insights into the fate and function of Olig2/Plp-positive progenitor cells in health and disease
Magnetic Moments of Pentaquarks
If the of and pentaquarks is really found to
be by future experiments, they will be accompanied by
partners in some models. It is reasonable to expect that
these states will also be discovered in the near future with
the current intensive experimental and theoretical efforts. We estimate
pentaquark magnetic moments using different models.Comment: 13 page
Crossing bonds in the random-cluster model
We derive the scaling dimension associated with crossing bonds in the
random-cluster representation of the two-dimensional Potts model, by means of a
mapping on the Coulomb gas. The scaling field associated with crossing bonds
appears to be irrelevant, on the critical as well as on the tricritical branch.
The latter result stands in a remarkable contrast with the existing result for
the tricritical O(n) model that crossing bonds are relevant. In order to obtain
independent confirmation of the Coulomb gas result for the crossing-bond
exponent, we perform a finite-size-scaling analysis based on numerical
transfer-matrix calculations.Comment: 2 figure
Heavy Pentaquarks
We construct the spin-flavor wave functions of the possible heavy pentaquarks
containing an anti-charm or anti-bottom quark using various clustered quark
models. Then we estimate the masses and magnetic moments of the or heavy pentaquarks. We emphasize the difference in the
predictions of these models. Future experimental searches at BESIII, CLEOc,
BELLE, and LEP may find these interesting states
Geometric properties of two-dimensional O(n) loop configurations
We study the fractal geometry of O() loop configurations in two dimensions
by means of scaling and a Monte Carlo method, and compare the results with
predictions based on the Coulomb gas technique. The Monte Carlo algorithm is
applicable to models with noninteger and uses local updates. Although these
updates typically lead to nonlocal modifications of loop connectivities, the
number of operations required per update is only of order one. The Monte Carlo
algorithm is applied to the O() model for several values of , including
noninteger ones. We thus determine scaling exponents that describe the fractal
nature of O() loops at criticality. The results of the numerical analysis
agree with the theoretical predictions.Comment: 18 pages, 6 figure
Surface and bulk transitions in three-dimensional O(n) models
Using Monte Carlo methods and finite-size scaling, we investigate surface
criticality in the O models on the simple-cubic lattice with , 2, and
3, i.e. the Ising, XY, and Heisenberg models. For the critical couplings we
find and . We
simulate the three models with open surfaces and determine the surface magnetic
exponents at the ordinary transition to be ,
, and for , 2, and 3, respectively. Then we vary
the surface coupling and locate the so-called special transition at
and , where
. The corresponding surface thermal and magnetic exponents are
and for the Ising
model, and and for
the XY model. Finite-size corrections with an exponent close to -1/2 occur for
both models. Also for the Heisenberg model we find substantial evidence for the
existence of a special surface transition.Comment: TeX paper and 10 eps figure
- …