相关论文: Geometry and Laplacian on Discrete Magic Carpets

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…

We define a class of random measures, spatially independent martingales, which we view as a natural generalisation of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian…

Consider the free field on a fractal graph based on a high-dimensional Sierpinski carpet (e.g. the Menger sponge), that is, a centered Gaussian field whose covariance is the Green's function for simple random walk on the graph. Moreover…

An isogeometric approach for solving the Laplace-Beltrami equation on a two-dimensional manifold embedded in three-dimensional space using a Galerkin method based on Catmull-Clark subdivision surfaces is presented and assessed. The…

We construct a one-parameter family of Laplacians on the Sierpinski Gasket that are symmetric and self-similar for the 9-map iterated function system obtained by iterating the standard 3-map iterated function system. Our main result is the…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

In this paper, we consider a certain convolutional Laplacian for metric measure spaces and investigate its potential for the statistical analysis of complex objects. The spectrum of that Laplacian serves as a signature of the space under…

In this article we consider importance sampling (IS) and sequential Monte Carlo (SMC) methods in the context of 1-dimensional random walks with absorbing barriers. In particular, we develop a very precise variance analysis for several IS…

We investigate the spectrum of the self-similar Laplacian, which generates the so-called "$pq$ random walk" on the integer half-line $\mathbb{Z}_+$. Using the method of spectral decimation, we prove that the spectral type of the Laplacian…

We obtain a nature generalization for an affine Sierpinski carpet and Sierpinski triangle to $n$-dimensional space, by using the generations and characterizations of affinely-equivalent Sierpinski carpet. Exactly, in this paper, a Menger…

The real symplectic Stiefel manifold is the manifold of symplectic bases of symplectic subspaces of a fixed dimension. It features in a large variety of applications in physics and engineering. In this work, we study this manifold with the…

Symplectic integrators with long-term preservation of integrals of motion are introduced for the guiding-center model of plasma particles in toroidal magnetic fields of general topology. An efficient transformation to canonical coordinates…

We study the spectral theory of a class of piecewise centrosymmetric Jacobi operators defined on an associated family of substitution graphs. Given a finite centrosymmetric matrix viewed as a weight matrix on a finite directed path graph…

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph into a new graph which is called the Mycielskian of that graph. In this paper we provide some…

We discuss the classical mechanics on the Grassmannian and the Disc modeled on the ideal L^(2,\infty)(H). We apply methods of geometric quantization to these systems. Their relation to a flat symplectic space is also discussed.

Information from an image occurs over multiple and distinct spatial scales. Image pyramid multiresolution representations are a useful data structure for image analysis and manipulation over a spectrum of spatial scales. This paper employs…

Very often traditional approaches studying dynamics of self-similarity processes are not able to give their quantitative characteristics at infinity and, as a consequence, use limits to overcome this difficulty. For example, it is well know…

Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…

The Exterior-Interior duality expresses a deep connection between the Laplace spectrum in bounded and connected domains in $\mathbb{R}^2$, and the scattering matrices in the exterior of the domains. Here, this link is extended to the study…

Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…