arXiv subjects

Hong Liu

Publications and source records attributed to Hong Liu.

At least 451 records · Page 25Linked to original sources

arXiv2016

Canonical Typicality of Energy Eigenstates of an Isolated Quantum System

Currently there are two main approaches to describe how quantum statistical physics emerges from an isolated quantum many-body system in a pure state: Canonical Typicality (CT) and Eigenstate Thermalization Hypothesis (ETH). These two approaches has different but overlapping areas of validity, phenomenology and set of physical outcomes. In this paper we discuss the relation between CT and ETH and propose a formulation of ETH in terms of the reduced density matrix. We provide strong numerical evidences for the proposal. This article has been withdrawn as it is superseded by arXiv:1611.08764

cond-mat.stat-mech↗

arXiv2016

Local conditions for exponentially many subdivisions

Given a graph $F$, let $s_t(F)$ be the number of subdivisions of $F$, each with a different vertex set, which one can guarantee in a graph $G$ in which every edge lies in at least $t$ copies of $F$. In 1990, Tuza asked for which graphs $F$ and large $t$, one has that $s_t(F)$ is exponential in a power of $t$. We show that, somewhat surprisingly, the only such $F$ are complete graphs, and for every $F$ which is not complete, $s_t(F)$ is polynomial in $t$. Further, for a natural strengthening of the local condition above, we also characterise those $F$ for which $s_t(F)$ is exponential in a power of $t$.

math.CO↗

arXiv2016

Ordinal Constrained Binary Code Learning for Nearest Neighbor Search

Recent years have witnessed extensive attention in binary code learning, a.k.a. hashing, for nearest neighbor search problems. It has been seen that high-dimensional data points can be quantized into binary codes to give an efficient similarity approximation via Hamming distance. Among existing schemes, ranking-based hashing is recent promising that targets at preserving ordinal relations of ranking in the Hamming space to minimize retrieval loss. However, the size of the ranking tuples, which shows the ordinal relations, is quadratic or cubic to the size of training samples. By given a large-scale training data set, it is very expensive to embed such ranking tuples in binary code learning. Besides, it remains a dificulty to build ranking tuples efficiently for most ranking-preserving hashing, which are deployed over an ordinal graph-based setting. To handle these problems, we propose a novel ranking-preserving hashing method, dubbed Ordinal Constraint Hashing (OCH), which efficiently learns the optimal hashing functions with a graph-based approximation to embed the ordinal relations. The core idea is to reduce the size of ordinal graph with ordinal constraint projection, which preserves the ordinal relations through a small data set (such as clusters or random samples). In particular, to learn such hash functions effectively, we further relax the discrete constraints and design a specific stochastic gradient decent algorithm for optimization. Experimental results on three large-scale visual search benchmark datasets, i.e. LabelMe, Tiny100K and GIST1M, show that the proposed OCH method can achieve superior performance over the state-of-the-arts approaches.

cs.CV↗

arXiv2016

Anomalous Hall Coulomb drag of massive Dirac fermions

Dirac fermions are actively investigated, and the discovery of the quantized anomalous Hall effect of massive Dirac fermions has spurred the promise of low-energy electronics. Some materials hosting Dirac fermions are natural platforms for interlayer coherence effects such as Coulomb drag and exciton condensation. Here we determine the role played by the anomalous Hall effect in Coulomb drag in massive Dirac fermion systems. We focus on topological insulator films with out-of plane magnetizations in both the active and passive layers. The transverse response of the active layer is dominated by a topological term arising from the Berry curvature. We show that the topological mechanism does not contribute to Coulomb drag, yet the longitudinal drag force in the passive layer gives rise to a transverse drag current. This anomalous Hall drag current is independent of the active-layer magnetization, a fact that can be verified experimentally. It depends non-monotonically on the passive-layer magnetization, exhibiting a peak that becomes more pronounced at low densities. These findings should stimulate new experiments and quantitative studies of anomalous Hall drag.

cond-mat.mes-hall↗

arXiv2016

Eigenstate Thermalization Hypothesis in Conformal Field Theory

We investigate the eigenstate thermalization hypothesis (ETH) in d+1 dimensional conformal field theories by studying reduced density matrices in energy eigenstates. We show that if local probes of high energy primary eigenstates satisfy ETH, then any finite energy observable with support on a subsystem of finite size satisfies ETH. In two dimensions, we discover that if ETH holds locally, the finite size reduced density matrix of states created by heavy primary operators is well-approximated by a projection to the Virasoro identity block.

hep-th↗

arXiv2016

Densities in large permutations and parameter testing

A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permutations and we then apply the methods used in the proof to give an example of a finitely approximable permutation parameter that is not finitely forcible. The latter answers a question posed by two of the authors and Moreira and Sampaio.

cs.DM↗

arXiv2016

A proof of Mader's conjecture on large clique subdivisions in $C_4$-free graphs

Given any integers $s,t\geq 2$, we show there exists some $c=c(s,t)>0$ such that any $K_{s,t}$-free graph with average degree $d$ contains a subdivision of a clique with at least $cd^{\frac{1}{2}\frac{s}{s-1}}$ vertices. In particular, when $s=2$ this resolves in a strong sense the conjecture of Mader in 1999 that every $C_4$-free graph has a subdivision of a clique with order linear in the average degree of the original graph. In general, the widely conjectured asymptotic behaviour of the extremal density of $K_{s,t}$-free graphs suggests our result is tight up to the constant $c(s,t)$.

math.CO↗

arXiv2016

The Non-Perturbative Quantum Nature of the Dislocation-Phonon Interaction

Despite the long history of dislocation-phonon interaction studies, there are many problems that have not been fully resolved during this development. These include an incompatibility between a perturbative approach and the long-range nature of a dislocation, the relation between static and dynamic scattering, and the nature of dislocation-phonon resonance. Here by introducing a fully quantized dislocation field, the "dislon"[1], a phonon is renormalized as a quasi-phonon, with shifted quasi-phonon energy, and accompanied by a finite quasi-phonon lifetime that is reducible to classical results. A series of outstanding legacy issues including those above can be directly explained within this unified phonon renormalization approach. In particular, a renormalized phonon naturally resolves the decades-long debate between dynamic and static dislocation-phonon scattering approaches.

cond-mat.mtrl-sci↗

arXiv2016

The number of subsets of integers with no $k$-term arithmetic progression

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\{1,2,\ldots, n\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we establish a new supersaturation result, which roughly states that sets of size $Θ(r_k(n))$ contain superlinearly many $k$-term arithmetic progressions. For integers $r$ and $k$, Erd\Ho s asked whether there is a set of integers $S$ with no $(k+1)$-term arithmetic progression, but such that any $r$-coloring of $S$ yields a monochromatic $k$-term arithmetic progression. Nešetřil and Rödl, and independently Spencer, answered this question affirmatively. We show the following density version: for every $k\ge 3$ and $δ>0$, there exists a reasonably dense subset of primes $S$ with no $(k+1)$-term arithmetic progression, yet every $U\subseteq S$ of size $|U|\geδ|S|$ contains a $k$-term arithmetic progression. Our proof uses the hypergraph container method, which has proven to be a very powerful tool in extremal combinatorics. The idea behind the container method is to have a small certificate set to describe a large independent set. We give two further applications in the appendix using this idea.

math.CO↗

arXiv2016

Orientation Driven Bag of Appearances for Person Re-identification

Person re-identification (re-id) consists of associating individual across camera network, which is valuable for intelligent video surveillance and has drawn wide attention. Although person re-identification research is making progress, it still faces some challenges such as varying poses, illumination and viewpoints. For feature representation in re-identification, existing works usually use low-level descriptors which do not take full advantage of body structure information, resulting in low representation ability. %discrimination. To solve this problem, this paper proposes the mid-level body-structure based feature representation (BSFR) which introduces body structure pyramid for codebook learning and feature pooling in the vertical direction of human body. Besides, varying viewpoints in the horizontal direction of human body usually causes the data missing problem, $i.e.$, the appearances obtained in different orientations of the identical person could vary significantly. To address this problem, the orientation driven bag of appearances (ODBoA) is proposed to utilize person orientation information extracted by orientation estimation technic. To properly evaluate the proposed approach, we introduce a new re-identification dataset (Market-1203) based on the Market-1501 dataset and propose a new re-identification dataset (PKU-Reid). Both datasets contain multiple images captured in different body orientations for each person. Experimental results on three public datasets and two proposed datasets demonstrate the superiority of the proposed approach, indicating the effectiveness of body structure and orientation information for improving re-identification performance.

cs.CV↗

arXiv2016

Supervised Matrix Factorization for Cross-Modality Hashing

Matrix factorization has been recently utilized for the task of multi-modal hashing for cross-modality visual search, where basis functions are learned to map data from different modalities to the same Hamming embedding. In this paper, we propose a novel cross-modality hashing algorithm termed Supervised Matrix Factorization Hashing (SMFH) which tackles the multi-modal hashing problem with a collective non-matrix factorization across the different modalities. In particular, SMFH employs a well-designed binary code learning algorithm to preserve the similarities among multi-modal original features through a graph regularization. At the same time, semantic labels, when available, are incorporated into the learning procedure. We conjecture that all these would facilitate to preserve the most relevant information during the binary quantization process, and hence improve the retrieval accuracy. We demonstrate the superior performance of SMFH on three cross-modality visual search benchmarks, i.e., the PASCAL-Sentence, Wiki, and NUS-WIDE, with quantitative comparison to various state-of-the-art methods

cs.IR↗

arXiv2016

Flat Helical Nanosieves

Compact and miniaturized devices with flexible functionalities are always highly demanded in optical integrated systems. Plasmonic nanosieve has been successfully harnessed as an ultrathin flat platform for complex manipulation of light, including holography, vortex generation and non-linear processes. Compared with most of reported single-functional devices, multi-functional nanosieves might find more complex and novel applications across nano-photonics, optics and nanotechnology. Here, we experimentally demonstrate a promising roadmap for nanosieve-based helical devices, which achieves full manipulations of optical vortices, including its generation, hybridization, spatial multiplexing, focusing and non-diffraction propagation etc., by controlling the geometric phase of spin light via over 121 thousands of spatially-rotated nano-sieves. Thanks to such spin-conversion nanosieve helical elements, it is no longer necessary to employ the conventional two-beam interferometric measurement to characterize optical vortices, while the interference can be realized natively without changing any parts of the current setup. The proposed strategy makes the far-field manipulations of optical orbital angular momentum within an ultrathin interface viable and bridges singular optics and integrated optics. In addition, it enables more unique extensibility and flexibility in versatile optical elements than traditional phase-accumulated helical optical devices.

physics.optics↗

arXiv2016

Coulomb drag in topological insulator films

We study Coulomb drag between the top and bottom surfaces of topological insulator films. We derive a kinetic equation for the thin-film spin density matrix containing the full spin structure of the two-layer system, and analyze the electron-electron interaction in detail in order to recover all terms responsible for Coulomb drag. Focusing on typical topological insulator systems, with film thicknesses d up to 6 nm, we obtain numerical and approximate analytical results for the drag resistivity $ρ_\text{D}$ and find that $ρ_\text{D}$ is proportional to $T^2d^{-4}n^{-3/2}_{\text{a}}n^{-3/2}_{\text{p}}$ at low temperature T and low electron density $n_{\text{a,p}}$, with a denoting the active layer and p the passive layer. In addition, we compare $ρ_{\text{D}}$ with graphene, identifying qualitative and quantitative differences, and we discuss the multi valley case, ultra thin films and electron-hole layers.

cond-mat.mes-hall↗

arXiv2015

Defect formation beyond Kibble-Zurek mechanism and holography

We study the dynamic after a smooth quench across a continuous transition from the disordered phase to the ordered phase. Based on scaling ideas, linear response and the spectrum of unstable modes, we develop a theoretical framework, valid for any second order phase transition, for the early-time evolution of the condensate in the broken phase. Our analysis unveils a novel period of non-adiabatic evolution after the system passes through the phase transition, where a parametrically large amount of coarsening occurs before a well-defined condensate forms. Our formalism predicts a rate of defect formation parametrically smaller than the Kibble-Zurek prediction and yields a criterion for the break-down of Kibble-Zurek scaling for sufficiently fast quenches. We numerically test our formalism for a thermal quench in a 2 + 1 dimensional holographic superfluid. These findings, of direct relevance in a broad range of fields including cold atom, condensed matter, statistical mechanism and cosmology, are an important step towards a more quantitative understanding of dynamical phase transitions.

hep-th↗

arXiv2015

Off-shell hydrodynamics from holography

We outline a program for obtaining an action principle for dissipative fluid dynamics by considering the holographic Wilsonian renormalization group applied to systems with a gravity dual. As a first step, in this paper we restrict to systems with a non-dissipative horizon. By integrating out gapped degrees of freedom in the bulk gravitational system between an asymptotic boundary and a horizon, we are led to a formulation of hydrodynamics where the dynamical variables are not standard velocity and temperature fields, but the relative embedding of the boundary and horizon hypersurfaces. At zeroth order, this action reduces to that proposed by Dubovsky et al. as an off-shell formulation of ideal fluid dynamics.

hep-th↗

arXiv2015

The typical structure of graphs with no large cliques

In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed $r \in \mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this result to all functions $r = r(n)$ with $r \leqslant (\log n)^{1/4}$. The proof combines a new (close to sharp) supersaturation version of the Erdős-Simonovits stability theorem, the hypergraph container method, and a counting technique developed by Balogh, Bollobás and Simonovits.

math.CO↗

arXiv2015

Continuously Shaping Orbital Angular Momentum with an Analog Optical Vortex Transmitter

Dynamic generation of obitial angular momentum (OAM) of light has enabled complex manipulation of micro-particles, high-dimension quantum entanglement and optical communication. We report an analog vortex transmitter made of one bilaterally symmetric grating and an aperture, emitting optical vortices with the average OAM value continuously variant in the entire rational range. Benefiting from linearly-varying transverse dislocation along its axis of symmetry, this diffractive transmitter possesses extra degree of freedom in engineering broadband optical vortices meanwhile preserving a novel spiniform phase with equally spaced singularities. It unlimitedly increases the average OAM of light by embracing more singularities, which is significantly different from that for Laguerre-Gaussian (LG) and Bessel vortex beams. Realizing analog generation of OAM in a single device, this technique can be potentially extended to other frequencies and applied to a wide spectrum of developments on quantum physics, aperiodic photonics and optical manipulation.

physics.optics↗

arXiv2015

The typical structure of maximal triangle-free graphs

Recently, settling a question of Erdős, Balogh and Petříčková showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the typical structure of maximal triangle-free graphs. We show that almost every maximal triangle-free graph $G$ admits a vertex partition $X\cup Y$ such that $G[X]$ is a perfect matching and $Y$ is an independent set. Our proof uses the Ruzsa-Szemerédi removal lemma, the Erdős-Simonovits stability theorem, and recent results of Balogh-Morris-Samotij and Saxton-Thomason on characterization of the structure of independent sets in hypergraphs. The proof also relies on a new bound on the number of maximal independent sets in triangle-free graphs with many vertex-disjoint $P_3$'s, which is of independent interest.

math.CO↗