Search arXiv⌕ Search

arXiv subjects

Xin He

Publications and source records attributed to Xin He.

210 records · Page 12Linked to original sources
arXiv2016

Optimal Monotone Drawings of Trees

A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists abpath P_{uw} in G that is monotone in some direction l_{uw}. (Namely, the order of the orthogonal projections of the vertices of P_{uw} on l_{uw} is the same as the order they appear in P_{uw}.) The problem of finding monotone drawings for trees has been studied in several recent papers. The main focus is to reduce the size of the drawing. Currently, the smallest drawing size is O(n^{1.205}) x O(n^{1.205}). In this paper, we present an algorithm for constructing monotone drawings of trees on a grid of size at most 12n x 12n. The smaller drawing size is achieved by a new simple Path Draw algorithm, and a procedure that carefully assigns primitive vectors to the paths of the input tree T. We also show that there exists a tree T_0 such that any monotone drawing of T_0 must use a grid of size Omega(n) x Omega(n). So the size of our monotone drawing of trees is asymptotically optimal.

cs.DS↗
arXiv2015

Local convergence of critical random trees and continuous-state branching processes

We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large functional values always converge locally to immortal trees. We also derive a very general ratio limit property for functionals of random trees satisfying the monotonicity property. Then we move on to study the local convergence of critical continuous-state branching processes, and prove a similar result. Finally we give a definition of continuum condensation trees, which should be the correct local limits for certain subcritical Levy trees under suitable conditionings.

math.PR↗
arXiv2015

A note on the maximal out-degree of Galton-Watson trees

In this note we consider both the local maximal out-degree and the global maximal out-degree of Galton-Watson trees. In particular, we show that the tail of any local maximal out-degree and that of the offspring distribution are asymptotically of the same order. However for the global maximal out-degree, this is only true in the subcritical case.

math.PR↗
arXiv2014

The maximal jump and local convergence of continuous-state branching processes

We study the distribution of the maximal jump of continuous-state branching processes. Several exact expressions and explicit asymptotics of both the local maximal jump and the global maximal jump are obtained. We also compare the distribution of the maximal jump and the Lévy measure to get several absolute continuity results. Then we study local convergence of continuous-state branching processes under various conditionings. We obtain complete results under the conditioning of large maximal jump, and partial results under two other conditionings, which are, the conditioning of large width, and, the conditioning of large total mass.

math.PR↗
arXiv2014

Conditioning Galton-Watson trees on large maximal out-degree

We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with a unique infinite spine. For the sub-critical case, we obtain local convergence to size-biased trees with a unique infinite node. We also study tail of the maximal out-degree of sub-critical Galton-Watson trees, which is essential for the proof of the local convergence.

math.PR↗
arXiv2013

Asteroseismic analysis of the CoRoT target HD49933

The frequency ratios and of HD 49933 exhibit an increase at high frequencies. This behavior also exists in the ratios of other stars, which is considered to result from the low signal-to-noise ratio and the larger line width at the high-frequency end and could not be predicted by stellar models in previous work. Our calculations show that the behavior not only can be reproduced by stellar models, but can be predicted by asymptotic formulas of the ratios. The frequency ratios of the Sun, too, can be reproduced well by the asymptotic formulas. The increased behavior derives from the fact that the gradient of mean molecular weight at the bottom of the radiative region hinders the propagation of p-modes, while the hindrance does not exist in the convective core. This behavior should exist in the ratios of stars with a large convective core. The characteristic of the ratios at high frequencies provides a strict constraint on stellar models and aids in determining the size of the convective core and the extent of overshooting. Observational constraints point to a star with $M=1.28\pm0.01 M_{\odot}$, $R=1.458\pm0.005 R_{\odot}$, $t=1.83\pm0.1$ Gyr, $r_{cc}=0.16\pm0.02 R_{\odot}$, $α=1.85\pm0.05$, and $δ_{ov}=0.6\pm0.2$ for HD 49933.

astro-ph.SR↗
arXiv2012

Lebesgue approximation of $(2,β)$-superprocesses

Let $ξ=(ξ_t)$ be a locally finite $(2,β)$-superprocess in $\RR^d$ with $β<1$ and $d>2/β$. Then for any fixed $t>0$, the random measure $ξ_t$ can be a.s. approximated by suitably normalized restrictions of Lebesgue measure to the $\varepsilon$-neighborhoods of ${\rm supp}\,ξ_t$. This extends the Lebesgue approximation of Dawson-Watanabe superprocesses. Our proof is based on a truncation of $(α,β)$-superprocesses and uses bounds and asymptotics of hitting probabilities.

math.PR↗
arXiv2001

Common-Face Embeddings of Planar Graphs

Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in {1,...,q}, there is a face F_i in the embedding whose boundary contains at least one vertex from each set in C_i. This problem has applications to the recovery of topological information from geographical data and the design of constrained layouts in VLSI. Let I be the input size, i.e., the total number of vertices and edges in G and the families C_i, counting multiplicity. We show that this problem is NP-complete in general. We also show that it is solvable in O(I log I) time for the special case where for each input family C_i, each set in C_i induces a connected subgraph of the input graph G. Note that the classical problem of simply finding a planar embedding is a further special case of this case with q=0. Therefore, the processing of the additional constraints C_1,...,C_q only incurs a logarithmic factor of overhead.

cs.DS↗
arXiv2001

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G which all take O(m+n) time for encoding and decoding. Our schemes employ new properties of canonical orderings for planar graphs and new techniques of processing strings of multiple types of parentheses. For applications that need to determine in O(1) time the adjacency of two nodes and the degree of a node, we use 2m+(5+1/k)n + o(m+n) bits for any constant k > 0 while the best previous bound by Munro and Raman is 2m+8n + o(m+n). If G is triconnected or triangulated, our bit count decreases to 2m+3n + o(m+n) or 2m+2n + o(m+n), respectively. If G is simple, our bit count is (5/3)m+(5+1/k)n + o(n) for any constant k > 0. Thus, if a simple G is also triconnected or triangulated, then 2m+2n + o(n) or 2m+n + o(n) bits suffice, respectively. If only adjacency queries are supported, the bit counts for a general G and a simple G become 2m+(14/3)n + o(m+n) and (4/3)m+5n + o(n), respectively. If we only need to reconstruct G from its code, a simple and triconnected G uses roughly 2.38m + O(1) bits while the best previous bound by He, Kao, and Lu is 2.84m.

cs.DS↗
arXiv2001

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1 bits, improving on the best previous bound of about 1.53m bits. In case exponential time is acceptable, roughly 1.08m bits have been known to suffice. If G is triconnected, we use at most (2.5+2\log{3})\min\{n,f\}-7 bits, which is at most 2.835m bits and smaller than the best previous bound of 3m bits. Both of our schemes take O(n) time for encoding and decoding.

cs.DS↗
arXiv2001

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfies certain properties, then an n-node m-edge pi-graph G can be encoded by a binary string X such that (1) G and X can be obtained from each other in O(n log n) time, and (2) X has at most beta(n)+o(beta(n)) bits for any continuous super-additive function beta(n) so that there are at most 2^{beta(n)+o(beta(n))} distinct n-node pi-graphs. The methodology is applicable to general classes of graphs; this paper focuses on planar graphs. Examples of such pi include all conjunctions over the following groups of properties: (1) G is a planar graph or a plane graph; (2) G is directed or undirected; (3) G is triangulated, triconnected, biconnected, merely connected, or not required to be connected; (4) the nodes of G are labeled with labels from {1, ..., ell_1} for ell_1 <= n; (5) the edges of G are labeled with labels from {1, ..., ell_2} for ell_2 <= m; and (6) each node (respectively, edge) of G has at most ell_3 = O(1) self-loops (respectively, ell_4 = O(1) multiple edges). Moreover, ell_3 and ell_4 are not required to be O(1) for the cases of pi being a plane triangulation. These examples are novel applications of small cycle separators of planar graphs and are the only nontrivial classes of graphs, other than rooted trees, with known polynomial-time information-theoretically optimal coding schemes.

cs.DS↗