arXiv subjects

Bo Ning

Publications and source records attributed to Bo Ning.

At least 91 records · Page 5Linked to original sources

arXiv2017

Coloring graphs with two odd cycle lengths

In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let $G$ be a graph and $L(G)$ be the set of all odd cycle lengths of $G$. We prove that: (1) If $L(G)=\{3,3+2l\}$, where $l\geq 2$, then $χ(G)=\max\{3,ω(G)\}$; (2) If $L(G)=\{k,k+2l\}$, where $k\geq 5$ and $l\geq 1$, then $χ(G)=3$. These, together with the case $L(G)=\{3,5\}$ solved in \cite{W}, give a complete solution to the general problem addressed in \cite{W,CS,KRS}. Our results also improve a classical theorem of Gyárfás which asserts that $χ(G)\le 2|L(G)|+2$ for any graph $G$.

math.CO↗

arXiv2017

Pseudo-topological Quasi-local Energy of Torsion Gravity

Torsion gravity is a natural extension to Einstein gravity in the presence of the fermion matter sources. In this paper we adopt Wald's covariant method of Noether charge to construct the quasi-local energy of the Einstein-Cartan-fermion system, and find that its explicit expression is formally independent of the coupling constant between torsion and axial current. This seemingly topological nature is unexpected and is reminiscent of similar nature of quantum Hall effect and topological insulator. However, the coupling dependence does enter when evaluating it on-shell, and thus the topological nature is pseudo. Based on the expression of the quasi-local energy, we evaluate it for a particular solution on the entanglement wedge and find the agreement with the holographic relative entropy obtained before. This shows that the equivalence of these two quantities in the Einstein-Cartan-fermion system. Moreover, the quasi-local energy in this case is not always positive definite so that it provides an example of swampland in torsion gravity. Based on the covariant Noether charge, we also derive the nonzero fermion effect on Komar angular momentum. The implication of our results to the tests of torsion gravity in the future gravitational wave astronomy is also discussed.

hep-th↗

arXiv2017

Bayesian inference for generalized extreme value distribution with Gaussian copula dependence

Dependent generalized extreme value (dGEV) models have attracted much attention due to the dependency structure that often appears in real datasets. To construct a dGEV model, a natural approach is to assume that some parameters in the model are time-varying. A previous study has shown that a dependent Gumbel process can be naturally incorporated into a GEV model. The model is a nonlinear state space model with a hidden state that follows a Markov process, with its innovation following a Gumbel distribution. Inference may be made for the model using Bayesian methods, sampling the hidden process from a mixture normal distribution, used to approximate the Gumbel distribution. Thus the response follows an approximate GEV model. We propose a new model in which each marginal distribution is an exact GEV distribution. We use a variable transformation to combine the marginal CDF of a Gumbel distribution with the standard normal copula. Then our model is a nonlinear state space model in which the hidden state equation is Gaussian. We analyze this model using Bayesian methods, and sample the elements of the state vector using particle Gibbs with ancestor sampling (PGAS). The PGAS algorithm turns out to be very efficient in solving nonlinear state space models. We also show our model is flexible enough to incorporate seasonality.

stat.ME↗

arXiv2016

Relative Entropy and Torsion Coupling

We evaluate the relative entropy on a ball region near the UV fixed point of a holographic conformal field theory deformed by a fermionic operator of nonzero vacuum expectation value. The positivity of the relative entropy considered here is implied by the expected monotonicity of decrease of quantum entanglement under RG flow. The calculations are done in the perturbative framework of Einstein-Cartan gravity in four-dimensional asymptotic anti-de Sitter space with a postulated standard bilinear coupling between axial fermion current and torsion. By requiring positivity of relative entropy, our result yields a constraint on axial current-torsion coupling, fermion mass and equation of state.

hep-th↗

arXiv2016

Wiener index, Harary index and Hamiltonicity of graphs

In this paper, we prove tight sufficient conditions for traceability and Hamiltonicity of connected graphs with given minimum degree, in terms of Wiener index and Harary index. We also prove some result on Hamiltonicity of balanced bipartite graphs in the similar fashion. In two recent papers \cite{LDJ2016,LDJ2017}, Liu et al. corrected some previous work on traceability of connected graphs in terms of Wiener index and Harary index, respectively, such as \cite{HW2013,Y2013}. We generalize these results and give short and unified proofs. All results in this paper are best possible.

math.CO↗

arXiv2016

Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs

In 1962, Erdős proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipartite graphs, Moon and Moser proved a corresponding theorem in 1963. In this paper we establish several spectral analogues of Moon and Moser's theorem on Hamilton paths in balanced bipartite graphs and nearly balanced bipartite graphs. One main ingredient of our proofs is a structural result of its own interest, involving Hamilton paths in balanced bipartite graphs with given minimum degree and number of edges.

math.CO↗

arXiv2016

On a conjecture of Chen-Guo-Wang

Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n$th$ Bernoulli number, Chen, Guo and Wang proposed a conjecture about the log-concavity of the function $θ(x)=\sqrt[x]{2ζ(x)Γ(x+1)}$ for $x\in (6,\infty)$, where $ζ(x)$ is the Riemann zeta function and $Γ(x)$ is the Gamma function. In this paper, we first prove this conjecture along the spirit of Zhu's previous work. Second, we extend Chen et al.'s conjecture in the sense of almost infinite log-monotonicity of combinatorial sequences, which was also introduced by Chen et al. Furthermore, by using an analogue criterion to the one of Chen, Guo and Wang, we deduce the almost infinite log-monotonicity of the sequences $\frac{1}{\sqrt[n]{|B_{2n}|}}$, $T_n$ and $\frac{1}{\sqrt[n]{T_n}}$, where $B_{2n}$ and $T_{n}$ are the $2n$th Bernoulli number and the $n$th tangent number, respectively. These results can be seen as extensions of some solved conjectures of Sun.

math.CA↗

arXiv2016

Heavy subgraphs, stability and hamiltonicity

Let $G$ be a graph. Adopting the terminology of Broersma et al. and Č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.

math.CO↗

arXiv2016

Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles

In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore's theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős' theorem and Moon-Moser's theorem, respectively. Let $\mathcal{G}_n^k$ be the class of non-Hamiltonian graphs of order $n$ and minimum degree at least $k$. We determine the maximum (signless Laplacian) spectral radius of graphs in $\mathcal{G}_n^k$ (for large enough $n$), and the minimum (signless Laplacian) spectral radius of the complements of graphs in $\mathcal{G}_n^k$. All extremal graphs with the maximum (signless Laplacian) spectral radius and with the minimum (signless Laplacian) spectral radius of the complements are determined, respectively. We also solve similar problems for balanced bipartite graphs and the quasi-complements.

math.CO↗

arXiv2016

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1,3}$. Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if every vertex of it has degree at least $(|V(G)|-2)/3$. At the workshop C\&C (Novy Smokovec, 1993), Broersma conjectured the degree condition of this result can be restricted only to end-vertices of induced copies of $N$ (the graph obtained from a triangle by adding three disjoint pendant edges). Fujisawa and Yamashita showed that the degree condition of Matthews and Sumner can be restricted only to end-vertices of induced copies of $Z_1$ (the graph obtained from a triangle by adding one pendant edge). Our main result in this paper is a characterization of all graphs $H$ such that a 2-connected claw-free graph $G$ is hamiltonian if each end-vertex of every induced copy of $H$ in $G$ has degree at least $|V(G)|/3+1$. This gives an affirmative solution of the conjecture of Broersma up to an additive constant.

math.CO↗

arXiv2016

The Randić index and signless Laplacian spectral radius of graphs

Given a connected graph $G$, the Randić index $R(G)$ is the sum of $\tfrac{1}{\sqrt{d(u)d(v)}}$ over all edges $\{u,v\}$ of $G$, where $d(u)$ and $d(v)$ are the degree of vertices $u$ and $v$ respectively. Let $q(G)$ be the largest eigenvalue of the singless Laplacian matrix of $G$ and $n=|V(G)|$. Hansen and Lucas (2010) made the following conjecture: \[ \frac{q(G)}{R(G)} \leq \begin{cases} \frac{4n-4}{n} & 4 \leq n\leq 12 \frac{n}{\sqrt{n-1}} & n\geq 13 \end{cases} \] with equality if and only if $G=K_{n}$ for $4\leq n\leq 12$ and $G=S_n$ for $n\geq 13$, respectively. Deng, Balachandran, and Ayyaswamy (J. Math. Anal. Appl. 2014) verified this conjecture for $4 \leq n \leq 11$. In this paper, we solve this conjecture completely.

math.CO↗

arXiv2016

Cyclability of $id$-cycles in graphs

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either $v_iv_{i+1}\in E(G)$ or both of the first implicit-degrees of $v_i$ and $v_{i+1}$ are at least $n/2$ (indices are taken modulo $p$), then $C'$ is called an $id$-cycle of $G$. In this paper, we prove that for every $id$-cycle $C'$, there exists a cycle $C$ in $G$ with $V(C')\subseteq V(C)$. This generalizes several early results on the Hamiltonicity and cyclability of graphs.

math.CO↗

arXiv2015

Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions

A graph $G$ is called \emph{claw-o-heavy} if every induced claw ($K_{1,3}$) of $G$ has two end-vertices with degree sum at least $|V(G)|$ in $G$. For a given graph $R$, $G$ is called \emph{$R$-f-heavy} if for every induced subgraph $H$ of $G$ isomorphic to $R$ and every pair of vertices $u,v\in V(H)$ with $d_H(u,v)=2$, there holds $\max\{d(u),d(v)\}\geq |V(G)|/2$. In this paper, we prove that every 2-connected claw-\emph{o}-heavy and $Z_3$-\emph{f}-heavy graph is hamiltonian (with two exceptional graphs), where $Z_3$ is the graph obtained from identifying one end-vertex of $P_4$ (a path with 4 vertices) with one vertex of a triangle. This result gives a positive answer to a problem proposed in [B. Ning, S. Zhang, Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs, Discrete Math. 313 (2013) 1715--1725], and also implies two previous theorems of Faudree et al. and Chen et al., respectively.

math.CO↗

arXiv2015

Spectral radius and traceability of connected claw-free graphs

Let $G$ be a connected claw-free graph on $n$ vertices and $\overline{G}$ be its complement graph. Let $μ(G)$ be the spectral radius of $G$. Denote by $N_{n-3,3}$ the graph consisting of $K_{n-3}$ and three disjoint pendent edges. In this note we prove that: (1) If $μ(G)\geq n-4$, then $G$ is traceable unless $G=N_{n-3,3}$. (2) If $μ(\overline{G})\leq μ(\overline{N_{n-3,3}})$ and $n\geq 24$, then $G$ is traceable unless $G=N_{n-3,3}$. Our works are counterparts on claw-free graphs of previous theorems due to Lu et al., and Fiedler and Nikiforov, respectively.

math.CO↗

arXiv2015

Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs

Broersma and Veldman proved that every 2-connected claw-free and $P_6$-free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and $P_6$-free graph is hamiltonian. On the other hand, Li et al. constructed a class of 2-connected graphs which are claw-heavy and $P_6$-\emph{o}-heavy but not hamiltonian. In this paper we further give some Ore-type degree conditions restricting to induced $P_6$'s of a 2-connected claw-heavy graph that can guarantee the graph to be hamiltonian. This improves some previous related results.

math.CO↗

arXiv2015

Spectral radius and Hamiltonian properties of graphs

Let $G$ be a graph with minimum degree $δ$. The spectral radius of $G$, denoted by $ρ(G)$, is the largest eigenvalue of the adjacency matrix of $G$. In this note we mainly prove the following two results. (1) Let $G$ be a graph on $n\geq 4$ vertices with $δ\geq 1$. If $ρ(G)> n-3$, then $G$ contains a Hamilton path unless $G\in\{K_1\vee (K_{n-3}+2K_1),K_2\vee 4K_1,K_1\vee (K_{1,3}+K_1)\}$. (2) Let $G$ be a graph on $n\geq 14$ vertices with $δ\geq 2$. If $ρ(G)\geq ρ(K_2\vee (K_{n-4}+2K_1))$, then $G$ contains a Hamilton cycle unless $G= K_2\vee (K_{n-4}+2K_1)$. As corollaries of our first result, two previous theorems due to Fiedler and Nikiforov and Lu et al. are obtained, respectively. Our second result refines another previous theorem of Fiedler and Nikiforov.

math.CO↗

arXiv2014

Quantum Decoherence with Holography

Quantum decoherence is the loss of a system's purity due to its interaction with the surrounding environment. Via the AdS/CFT correspondence, we study how a system decoheres when its environment is a strongly-coupled theory. In the Feynman-Vernon formalism, we compute the influence functional holographically by relating it to the generating function of Schwinger-Keldysh propagators and thereby obtain the dynamics of the system's density matrix. We present two exactly solvable examples: (1) a straight string in a BTZ black hole and (2) a scalar probe in AdS$_5$. We prepare an initial state that mimics Schrödinger's cat and identify different stages of its decoherence process using the time-scaling behaviors of Rényi entropy. We also relate decoherence to local quantum quenches, and by comparing the time evolution behaviors of the Wigner function and Rényi entropy we demonstrate that the relaxation of local quantum excitations leads to the collapse of its wave-function.

hep-th↗

arXiv2014

On some papers of Nikiforov

The well known Mantel's Theorem states that a graph on $n$ vertices and $m$ edges contains a triangle if $m>\frac{n^2}{4}$. Nosal proved that every graph on $m$ edges contains a triangle if the spectral radius $λ_1>\sqrt{m}$, which is a spectral analog of Mantel's Theorem. Furthermore, by using Motzkin-Straus Inequality, Nikiforov sharped Nosal's result and characterized the extremal graphs when the equality holds. Our first contribution in this note is to give two new proofs of the spectral concise Mantel's Theorem due to Nikiforov (without help of Motzkin-Straus Inequality). Nikiforov also obtained some results concerning the existence of consecutive cycles and spectral radius. Second, we prove a theorem concerning the existence of consecutive even cycles and spectral radius, which slightly improves a result of Nikiforov. At last, we focus on spectral radius inequalities. Hong proved his famous bound for spectral radius. Later, Hong, Shu and Fang generalized Hong's bound to connected graphs with given minimum degree. By using quite different technique, Nikiforov proved Hong et al.'s bound for general graphs independently. In this note, we prove a new spectral inequality by applying the technique of Nikiforov. Our result extends Stanley's spectral inequality.

math.CO↗