Hardy's Inequality on Finite Networks

Shougenji Yukihiro

Yamasaki Maretsugu

full_text_file

c0020032r008.pdf ( 109 KB )

Descriptions

The smallest eigenvalue of a weighted discrete Laplacian is closely related to a generalized Hardy's inequality on networks. We shall estimate the smallest eigenvalue by using a discrete Kuramochi potential with some numerical experiments.

About This Article

Pages

all_journal_index

Other Article

Some Aspects on Circles and Helices in a Complex Projective Space

PP. 1 - 8

Dirichlet Problem in an Exterior Domain with Potential in a Weighted Lebesgue Class

PP. 9 - 23

Stability and Boundedness in Volterra Integro-differential Equations

PP. 25 - 40

Combinatorial Problems Arising from the Statistical Mechanics Model of Spin Glasses

PP. 41 - 47

Continuous Dependence on Aging and Birth Functions for Size-structured Population models of general type

PP. 49 - 56

Geometry of Homogeneous Left Lie Loops and Tangent Lie Triple Algebras

PP. 57 - 68

On Geodesic Homogeneous Left Lie Loops as Reductive Homogeneous Spaces

PP. 69 - 74

Hardy's Inequality on Finite Networks

PP. 75 - 84

総合理工学部 島根大学総合理工学部 島根大学総合理工学研究科 島根大学総合理工学部紀要.シリーズB

Hardy's Inequality on Finite Networks

総合理工学部

島根大学総合理工学部

島根大学総合理工学研究科

島根大学総合理工学部紀要.シリーズB