• Publications
  • Influence
Large deviations for heavy-tailed random sums in compound renewal model
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
  • 91
  • 18
  • PDF
Ages and magnetic structures of the South China Sea constrained by deep tow magnetic surveys and IODP Expedition 349
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 SouthExpand
  • 224
  • 16
  • PDF
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints
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
  • 69
  • 9
  • PDF
Exact solution of the hypergraph Turán problem for k-uniform linear paths
TLDR
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
  • 46
  • 9
  • PDF
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
TLDR
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
  • 49
  • 6
  • PDF
Hypergraph Turán numbers of linear cycles
TLDR
We apply the delta system method, particularly tools from [11] and [8], to determine, for all k ≥ 5 and large n, the Turán numbers of certain hypergraphs called k-uniform linear cycles. Expand
  • 38
  • 6
  • PDF
Seismic stratigraphy of the central South China Sea basin and implications for neotectonics
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 seismicExpand
  • 89
  • 6
  • PDF
Turán Numbers of Subdivided Graphs
  • T. Jiang, R. Seiver
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • 4 September 2012
TLDR
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
  • 23
  • 6
  • PDF
Edge-colorings of complete graphs that avoid polychromatic trees
TLDR
We study monochromatic subgraphs that are forced by every coloring of the edges of Kn with a fixed number of colors. Expand
  • 54
  • 5
  • PDF
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
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
  • 163
  • 4
  • PDF