T. Jiang

Publications
Influence

Large deviations for heavy-tailed random sums in compound renewal model

Q. Tang, C. Su, T. Jiang, J. Zhang
Mathematics
15 March 2001

In the present paper we investigate the precise large deviations for heavy-tailed random sums. First, we obtain a result which improves the relative result in Kluppelberg and Mikosch (J. Appl.… Expand

Ages and magnetic structures of the South China Sea constrained by deep tow magnetic surveys and IODP Expedition 349

C. Li, X. Xu, +38 authors Guoliang Zhang
Geology
1 December 2014

Combined analyses of deep tow magnetic anomalies and International Ocean Discovery Program Expedition 349 cores show that initial seafloor spreading started around 33 Ma in the northeastern South… Expand

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints

N. Alon, T. Jiang, Z. Miller, D. Pritikin
Mathematics, Computer Science
Random Struct. Algorithms
1 December 2003

We consider a canonical Ramsey type problem. An edge-coloring of a graph is called m-good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G)… Expand

Exact solution of the hypergraph Turán problem for k-uniform linear paths

Z. Füredi, T. Jiang, R. Seiver
Mathematics, Computer Science
Comb.
5 August 2011

A k-uniform linear path of length ℓ, denoted by ℙℓ(k), is a family of k-sets {F1,...,F℗ such that |Fi ∩ Fi+1|=1 for each i and Fi ∩ Fbj = $\not 0$. Expand

Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes

T. Jiang, A. Vardy
Mathematics, Computer Science
IEEE Transactions on Information Theory
18 April 2004

We show that, in fact, there exists a positive constant c such that A/sub 2/(n, d)/spl ges/c2/sup n//V(n,d-1) is the maximum size of a binary code of length n and minimum distance d. Expand

Hypergraph Turán numbers of linear cycles

Z. Füredi, T. Jiang
Mathematics, Computer Science
J. Comb. Theory, Ser. A
11 February 2013

We apply the delta system method, particularly tools from [11] and [8], to determine, for all k ≥ 5 and large n, the Turán numbers of certain hypergraphs called k-uniform linear cycles. Expand

Seismic stratigraphy of the central South China Sea basin and implications for neotectonics

C. Li, J. Li, +35 authors X. Zhao
Geology
1 December 2014

Coring/logging data and physical property measurements from International Ocean Discovery Program Expedition 349 are integrated with, and correlated to, reflection seismic data to map seismic… Expand

Turán Numbers of Subdivided Graphs

T. Jiang, R. Seiver
Computer Science, Mathematics
SIAM J. Discret. Math.
4 September 2012

We prove that the Turan number $ex(n,H^{(p)})$ is the maximum number of edges in an $n$-vertex simple graph that does not contain $F$ as a subgraph. Expand

Edge-colorings of complete graphs that avoid polychromatic trees

T. Jiang, D. West
Mathematics, Computer Science
Discret. Math.
2004

We study monochromatic subgraphs that are forced by every coloring of the edges of Kn with a fixed number of colors. Expand

Interactions between deformation and fluids in the frontal thrust region of the NanTroSEIZE transect offshore the Kii Peninsula, Japan: Results from IODP Expedition 316 Sites C0006 and C0007

E. Screaton, G. Kimura, +26 authors X. Zhao
Geology
1 December 2009

Integrated Ocean Drilling Program (IODP) Expedition 316 Sites C0006 and C0007 examined the deformation front of the Nankai accretionary prism offshore the Kii Peninsula, Japan. In the drilling area,… Expand

Recommended Authors