We develop an a posteriori analysis of C interior penalty methods for the displacement obstacle problem of clamped Kirchhoff plates. We show that a residual based error estimator originally designed for C interior penalty methods for the boundary value problem of clamped Kirchhoff plates can also be used for the obstacle problem. We obtain reliability and efficiency estimates for the error esti...

We show the presence of a dense pure point spectrum on quantum graphs with Maryland-type quasiperiodic Kirchhoff coupling constants at the vertices.

We apply iterative resolution estimation to least-squares Kirchhoff migration. Resolution plots reveal low illumination areas on seismic images and provide information about image uncertainties.

In this paper we study the existence, multiplicity, and regularity of positive weak solutions for following Kirchhoff–Choquard problem: M ∬ ℝ 2 N | u ( x ) − y + s d Δ = λ γ ∫ Ω μ , ∗ in 0 \ where is open bounded domain with C2 boundary, > 2s ∈ (0, 1). models Kirchhoff-type coefficient particular, degenerate case Kirchhoff zero at zero. (− Δ)s fractional Laplace operator, a real parameter, 1) c...

In this article, by using critical point theory, we show the existence of infinitely many weak solutions for a fourth-order Kirchhoff type elliptic problems with Hardy potential.

This paper studies the Laplacian spectrum and average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is eigenvalues a large dense graph can be effectively approximated by using degree function corresponding graphon. More specifically, we show how to approximate distribution (Kirchhoff index) graph. For all cases, provide explicit bounds...

in this paper‎, ‎we prove a multiplicity result for some biharmonic elliptic equation of kirchhoff type and involving nonlinearities with critical exponential growth at infinity‎. ‎using some variational arguments and exploiting the symmetries of the problem‎, ‎we establish a multiplicity result giving two nontrivial solutions‎.

We propose a new measure of vulnerability of a node in a complex network. The measure is based on the analogy in which the nodes of the network are represented by balls and the links are identified with springs. We define the measure as the node displacement, or the amplitude of vibration of each node, under fluctuation due to the thermal bath in which the network is supposed to be submerged.We...