Abstract
We consider graphs parameterized on a portion X⊂Zd×{1,…,M}k of a cylindrical subset of the lattice Zd×Zk, and perform a discrete-to-continuum dimension-reduction process for energies defined on X of quadratic type. Our only assumptions are that X be connected as a graph and periodic in the first d-directions. We show that, upon scaling of the domain and of the energies by a small parameter ɛ, the scaled energies converge to a d-dimensional limit energy. The main technical points are a dimension-reducing coarse-graining process and a discrete version of the p-connectedness approach by Zhikov.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
