arXiv subjects
Publications and source records attributed to Yong Lin.
We study some equivalent properties of the curvature-dimension conditions $CD(n,K)$ inequality on infinite, but locally finite graph. These equivalences are gradient estimate, Poincaré type inequalities and reverse Poincaré inequalities. And we also obtain one equivalent property of gradient estimate for a new notion of curvature-dimension conditions $CDE'(\infty, K)$ at the same assumption of graphs.
Continuing our previous work (arXiv:1509.07981v1), we derive another global gradient estimate for positive functions, particularly for positive solutions to the heat equation on finite or locally finite graphs. In general, the gradient estimate in the present paper is independent of our previous one. As applications, it can be used to get an upper bound and a lower bound of the heat kernel on locally finite graphs. These global gradient estimates can be compared with the Li-Yau inequality on graphs contributed by Bauer, Horn, Lin, Lipper, Mangoubi and Yau (J. Differential Geom. 99 (2015) 359-409). In many topics, such as eigenvalue estimate and heat kernel estimate (not including the Liouville type theorems), replacing the Li-Yau inequality by the global gradient estimate, we can get similar results.
We derive a gradient estimate for positive functions, in particular for positive solutions to the heat equation, on finite or locally finite graphs. Unlike the well known Li-Yau estimate, which is based on the maximum principle, our estimate follows from the graph structure of the gradient form and the Laplacian operator. Though our assumption on graphs is slightly stronger than that of Bauer, Horn, Lin, Lippner, Mangoubi, and Yau (J. Differential Geom. 99 (2015) 359-405), our estimate can be easily applied to nonlinear differential equations, as well as differential inequalities. As applications, we estimate the greatest lower bound of Cheng's eigenvalue and an upper bound of the minimal heat kernel, which is recently studied by Bauer, Hua and Yau (Preprint, 2015) by the Li-Yau estimate. Moreover, generalizing an earlier result of Lin and Yau (Math. Res. Lett. 17 (2010) 343-356), we derive a lower bound of nonzero eigenvalues by our gradient estimate.
We prove pointwise gradient bounds for heat semigroups associated to general (possibly unbounded) Laplacians on infinite graphs satisfying the curvature dimension condition CD(K,\infty). Using gradient bounds, we show stochastic completeness for graphs satisfying the curvature dimension condition.
In this paper, we prove the equivalent of ultracontractive bound of heat semigroup or the uniform upper bound of the heat kernel with the Nash inequality, Log-Sobolev inequalities on graphs. We also show that under the assumption of volume growth and nonnegative curvature $CDE'(n,0)$ the Sobolev inequality, Nash inequality, Faber-Krahn inequality, Log-Sobolev inequalities, discrete and continuous-time uniform upper estimate of heat kernel are all true on graph.
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy invariance of homologies of digraphs and the relation between the fundamental group of the digraph and its first homology group. The category of (undirected) graphs can be identified by a natural way with a full subcategory of digraphs. Thus we obtain also consistent homology and homotopy theories for graphs. Note that the homotopy theory for graphs coincides with the one constructed in the paper of Babson et.
We prove the Li-Yau gradient estimate for the heat kernel on graphs. The only assumption is a variant of the curvature-dimension inequality, which is purely local, and can be considered as a new notion of curvature for graphs. We compute this curvature for lattices and trees and conclude that it behaves more naturally than the already existing notions of curvature. Moreover, we show that if a graph has non-negative curvature then it has polynomial volume growth. We also derive Harnack inequalities and heat kernel bounds from the gradient estimate, and show how it can be used to strengthen the classical Buser inequality relating the spectral gap and the Cheeger constant of a graph.
We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the $n$th Laplacian eigenvalue is at most $2\left[ 6(n-1) + 15(2g-2) \right]^2$. Our results hold for any Schrödinger operator, not just the Laplacian.
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the path homology and cohomology of a digraph.
A graph is called Ricci-flat if its Ricci-curvatures vanish on all edges. Here we use the definition of Ricci-cruvature on graphs given in [Lin-Lu-Yau, Tohoku Math., 2011], which is a variation of [Ollivier, J. Funct. Math., 2009]. In this paper, we classified all Ricci-flat connected graphs with girth at least five: they are the infinite path, cycle $C_n$ ($n\geq 6$), the dodecahedral graph, the Petersen graph, and the half-dodecahedral graph. We also construct many Ricci-flat graphs with girth 3 or 4 by using the root systems of simple Lie algebras.
When we examine the chirality or observed handedness of the chromospheric and coronal structures involved in the long-term build-up to eruptive events, we find that they evolve in very specific ways to form two and only two sets of large-scale chiral systems. Each system contains spatially separated components with both signs of chirality, the upper portion having negative (positive) chirality and the lower part possessing positive (negative) chirality. The components within a system are a filament channel (represented partially by sets of chromospheric fibrils), a filament (if present), a filament cavity, sometimes a sigmoid, and always an overlying arcade of coronal loops. When we view these components as parts of large-scale chiral systems, we more clearly see that it is not the individual components of chiral systems that erupt but rather it is the approximate upper parts of an entire evolving chiral system that erupts. We illustrate the typical pattern of build-up to eruptive solar events first without and then including the chirality in each stage of the build-up. We argue that a complete chiral system has one sign of handedness above the filament spine and the opposite handedness in the barbs and filament channel below the filament spine. If the spine has handedness, the observations favor its having the handedness of the filament cavity and coronal loops above. As the separate components of a chiral system form, we show that the system appears to maintain a balance of right-handed and left-handed features, thus preserving an initial near-zero net helicity. Each individual chiral system may produce many successive eruptive events above a single filament channel.
We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.
This is a survey paper. We study the Ricci curvature and spectrum of graphs, as well as the exterior forms and deRahm cohomology on graphs.
We explore the tunneling behavior of a quantum particle on a finite graph, in the presence of an asymptotically large potential. Surprisingly the behavior is governed by the local symmetry of the graph around the wells.
We present a 40 minute time series of filtergrams from the red and the blue wing of the \halpha line in an active region near the solar disk center. From these filtergrams we construct both Dopplergrams and summed ``line center'' images. Several dynamic fibrils (DFs) are identified in the summed images. The data is used to simultaneously measure the proper motion and the Doppler signals in DFs. For calibration of the Doppler signals we use spatially resolved spectrograms of a similar active region. Significant variations in the calibration constant for different solar features are observed, and only regions containing DFs have been used in order to reduce calibration errors. We find a coherent behavior of the Doppler velocity and the proper motion which clearly demonstrates that the evolution of DFs involve plasma motion. The Doppler velocities are found to be a factor 2--3 smaller than velocities derived form proper motions in the image plane. The difference can be explained by the radiative processes involved, the Doppler velocity is a result of the local atmospheric velocity weighted with the response function. As a result the Doppler velocity originates from a wide range in heights in the atmosphere. This is contrasted by the proper motion velocity which is measured from the sharply defined bright tops of the DFs and is therefore a very local velocity measure. The Doppler signal originates from well below the top of the DF. Finally we discuss how this difference together with the lacking spatial resolution of older observations have contributed to some of the confusion about the identity of DFs, spicules and mottles.
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user's information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and their results, and summarizes the bibliographic database content into a knowledge base. We present the design and implementation of ZBroker and describe its Web-based user interface.