601,538 research outputs found
Transfer Matrices for the Partition Function of the Potts Model on Toroidal Lattice Strips
We present a method for calculating transfer matrices for the -state Potts
model partition functions , for arbitrary and temperature
variable , on strip graphs of the square (sq), triangular (tri), and
honeycomb (hc) lattices of width vertices and of arbitrarily great length
vertices, subject to toroidal and Klein bottle boundary conditions. For
the toroidal case we express the partition function as ,
where denotes lattice type, are specified polynomials of
degree in , are eigenvalues of the
transfer matrix in the degree- subspace, and
() for , respectively. An analogous formula is
given for Klein bottle strips. We exhibit a method for calculating
for arbitrary . In particular, we find some very
simple formulas for the determinant , and trace
. Corresponding results are given for the equivalent
Tutte polynomials for these lattice strips and illustrative examples are
included.Comment: 52 pages, latex, 10 figure
Community detection for networks with unipartite and bipartite structure
Finding community structures in networks is important in network science,
technology, and applications. To date, most algorithms that aim to find
community structures only focus either on unipartite or bipartite networks. A
unipartite network consists of one set of nodes and a bipartite network
consists of two nonoverlapping sets of nodes with only links joining the nodes
in different sets. However, a third type of network exists, defined here as the
mixture network. Just like a bipartite network, a mixture network also consists
of two sets of nodes, but some nodes may simultaneously belong to two sets,
which breaks the nonoverlapping restriction of a bipartite network. The mixture
network can be considered as a general case, with unipartite and bipartite
networks viewed as its limiting cases. A mixture network can represent not only
all the unipartite and bipartite networks, but also a wide range of real-world
networks that cannot be properly represented as either unipartite or bipartite
networks in fields such as biology and social science. Based on this
observation, we first propose a probabilistic model that can find modules in
unipartite, bipartite, and mixture networks in a unified framework based on the
link community model for a unipartite undirected network [B Ball et al (2011
Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both
overlapping and nonoverlapping communities) and apply it to two real-world
networks: a southern women bipartite network and a human transcriptional
regulatory mixture network. The results suggest that our model performs well
for all three types of networks, is competitive with other algorithms for
unipartite or bipartite networks, and is applicable to real-world networks.Comment: 27 pages, 8 figures.
(http://iopscience.iop.org/1367-2630/16/9/093001
On Exactly Solvable Potentials
We investigate two methods of obtaining exactly solvable potentials with
analytic forms.Comment: 13 pages, Latex, to appear in Chineses Journal of Physic
Transfer Matrices for the Zero-Temperature Potts Antiferromagnet on Cyclic and Mobius Lattice Strips
We present transfer matrices for the zero-temperature partition function of
the -state Potts antiferromagnet (equivalently, the chromatic polynomial) on
cyclic and M\"obius strips of the square, triangular, and honeycomb lattices of
width and arbitrarily great length . We relate these results to our
earlier exact solutions for square-lattice strips with ,
triangular-lattice strips with , and honeycomb-lattice strips with
and periodic or twisted periodic boundary conditions. We give a
general expression for the chromatic polynomial of a M\"obius strip of a
lattice and exact results for a subset of honeycomb-lattice transfer
matrices, both of which are valid for arbitrary strip width . New results
are presented for the strip of the triangular lattice and the
and strips of the honeycomb lattice. Using these results and taking the
infinite-length limit , we determine the continuous
accumulation locus of the zeros of the above partition function in the complex
plane, including the maximal real point of nonanalyticity of the degeneracy
per site, as a function of .Comment: 62 pages, latex, 6 eps figures, includes additional results, e.g.,
loci , requested by refere
Electron Electric Dipole Moment induced by Octet-Colored Scalars
An appended sector of two octet-colored scalars, each an electroweak doublet,
is an interesting extension of the simple two Higgs doublet model motivated by
the minimal flavor violation. Their rich CP violating interaction gives rise to
a sizable electron electric dipole moment, besides the quark electric dipole
moment via the two-loop contribution of Barr-Zee mechanism.Comment: 8 pages, 2 figure
Chiral Restoration in the Early Universe: Pion Halo in the Sky
vanishing above indicates chiral symmetry restoration at
high . But is it the old chiral symmetry that is `restored'? In this
talk, I report on the spacetime quantization of the BPFTW effective action for
quarks in a hot environ. The fermion propagator is known to give a
pseudo-Lorentz invariant particle pole as well as new spacelike cuts. Our
quantization shows that the spacelike cuts directly lead to a thermal vacuum
that is a generalized NJL state, with a curious phase. This
is responsible for vanishing at high . The thermal vacuum is
invariant under a new chiral charge, but continues to break the old zero
temperature chirality. Our quantization suggests a new class of order
parameters that probe the physics of these spacelike cuts. In usual scenario,
the pion dissociates in the early alphabet soup. With this new understanding of
the thermal vacuum, the pion remains a Nambu-Goldstone particle at high ,
and will not dissociate. It propagates at the speed of light but with a halo.Comment: 4 pages, LaTeX, CCNY-HEP-94-9 To appear in Proceedings of "Trends in
Astroparticle Physics Workshop", Stockholm, Sweden, 22-25 September, 1994,
Nuclear Physics B, Proceedings Supplement, edited by L. Bergstrom, P.
Carlson, P.O. Hulth, and H. Snellman. (Only revision is in the header
citation
Secure secret sharing in the cloud
In this paper, we show how a dealer with limited resources is possible to share the secrets to players via an untrusted cloud server without compromising the privacy of the secrets. This scheme permits a batch of two secret messages to be shared to two players in such a way that the secrets are reconstructable if and only if two of them collaborate. An individual share reveals absolutely no information about the secrets to the player. The secret messages are obfuscated by encryption and thus give no information to the cloud server. Furthermore, the scheme is compatible with the Paillier cryptosystem and other cryptosystems of the same type. In light of the recent developments in privacy-preserving watermarking technology, we further model the proposed scheme as a variant of reversible watermarking in the encrypted domain
- …