Heavy subgraphs, stability and hamiltonicity

Let $G$ be a graph. Adopting the terminology of Broersma et al. and \v{C}ada, respectively, we say that $G$ is 2-heavy if every induced claw ($K_{1,3}$) of $G$ contains two end-vertices each one has degree at least $|V(G)|/2$; and $G$ is o-heavy if every induced claw of $G$ contains two end-vertices with degree sum at least $|V(G)|$ in $G$. In this paper, we introduce a new concept, and say that $G$ is \emph{$S$-c-heavy} if for a given graph $S$ and every induced subgraph $G'$ of $G$ isomorphic to $S$ and every maximal clique $C$ of $G'$, every non-trivial component of $G'-C$ contains a vertex of degree at least $|V(G)|/2$ in $G$. In terms of this concept, our original motivation that a theorem of Hu in 1999 can be stated as every 2-connected 2-heavy and $N$-c-heavy graph is hamiltonian, where $N$ is the graph obtained from a triangle by adding three disjoint pendant edges. In this paper, we will characterize all connected graphs $S$ such that every 2-connected o-heavy and $S$-c-heavy graph is hamiltonian. Our work results in a different proof of a stronger version of Hu's theorem. Furthermore, our main result improves or extends several previous results.Comment: 21 pages, 6 figures, finial version for publication in Discussiones Mathematicae Graph Theor

Interpretations of Association Rules by Granular Computing

We present interpretations for association rules. We first introduce Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). We then use extended random sets to present a new algorithm of finding interesting rules. We prove that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. We also provide two measures for dealing with uncertainties in association rules

Shell and isospin effects in nuclear charge radii

The shell effect and isospin effect in nuclear charge radii are systematically investigated and a four-parameter formula is proposed for the description of the root-mean-square (rms) charge radii by combining the shell corrections and deformations of nuclei obtained from the Weizs\"acker-Skyrme mass model. The rms deviation with respect to the 885 measured charge radii falls to 0.022 fm. The proposed formula is also applied for the study of the charge radii of super-heavy nuclei and nuclear symmetry energy. The linear relationship between the slope parameter L of the nuclear symmetry energy and the rms charge radius difference of 30S - 30Si mirror pair is clearly observed. The estimated slope parameter is about $L=54 \pm 19$ MeV from the coefficient of the isospin term in the proposed charge radius formula.Comment: 7 figures, 1 table, accepted for publication as a Rapid Communication in Physical Review

Bootstrapping Mixed Correlators in the Five Dimensional Critical O(N) Models

We use the conformal bootstrap approach to explore $5D$ CFTs with $O(N)$ global symmetry, which contain $N$ scalars $\phi_i$ transforming as $O(N)$ vector. Specifically, we study multiple four-point correlators of the leading $O(N)$ vector $\phi_i$ and the $O(N)$ singlet $\sigma$. The crossing symmetry of the four-point functions and the unitarity condition provide nontrivial constraints on the scaling dimensions ($\Delta_\phi$, $\Delta_\sigma$) of $\phi_i$ and $\sigma$. With reasonable assumptions on the gaps between scaling dimensions of $\phi_i$ ($\sigma$) and the next $O(N)$ vector (singlet) scalar, we are able to isolate the scaling dimensions $(\Delta_\phi$, $\Delta_\sigma)$ in small islands. In particular, for large $N=500$, the isolated region is highly consistent with the result obtained from large $N$ expansion. We also study the interacting $O(N)$ CFTs for $1\leqslant N\leqslant100$. Isolated regions on $(\Delta_\phi,\Delta_\sigma)$ plane are obtained using conformal bootstrap program with lower order of derivatives $\Lambda$; however, they disappear after increasing $\Lambda$. We think these islands are corresponding to interacting but nonunitary $O(N)$ CFTs. Our results provide a lower bound on the critical value $N_c>100$, below which the interacting $O(N)$ CFTs turn into nonunitary. The critical value is unexpectedly large comparing with previous estimations.Comment: 28 pages, 4 figure

Topology Control in Heterogeneous Wireless Networks: Problems and Solutions

Previous work on topology control usually assumes homogeneous wireless nodes with uniform transmission ranges. In this paper, we propose two localized topology control algorithms for heterogeneous wireless multi-hop networks with nonuniform transmission ranges: Directed Relative Neighborhood Graph (DRNG) and Directed Local Spanning Subgraph (DLSS). In both algorithms, each node selects a set of neighbors based on the locally collected information. We prove that (1) the topologies derived under DRNG and DLSS preserve the network connectivity; (2) the out degree of any node in the resulting topology by DLSS is bounded, while the out degree cannot be bounded in DRNG; and (3) the topologies generated by DRNG and DLSS preserve the network bi-directionality