相关论文: Sampling Theory with Average Values on the Sierpin…

We construct a theory of distributions in the setting of analysis on post-critically finite self-similar fractals, and on fractafolds and products based on such fractals. The results include basic properties of test functions and…

We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…

Historically, the machine learning community has derived spectral decompositions from graph-based approaches. We break with this approach and prove the statistical and computational superiority of the Galerkin method, which consists in…

Disentanglement via mechanism sparsity was introduced recently as a principled approach to extract latent factors without supervision when the causal graph relating them in time is sparse, and/or when actions are observed and affect them…

We consider the reconstruction of a bandlimited function from its finite localized sample data. Truncating the classical Shannon sampling series results in an unsatisfactory convergence rate due to the slow decayness of the sinc function.…

We study energy measures on SG based on harmonic functions. We characterize the positive energy measures through studying the bounds of Radon-Nikodym derivatives with respect to the Kusuoka measure. We prove a limited continuity of the…

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…

In many applications, the observations can be represented as a signal defined over the vertices of a graph. The analysis of such signals requires the extension of standard signal processing tools. In this work, first, we provide a class of…

Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…

In this paper, we establish an analogue of the classical mean value property for both the harmonic functions and some general functions in the domain of the Laplacian on the Sierpinski gasket. Furthermore, we extend the result to some other…

Fractal geometry is the study of sets which exhibit the same pattern at multiple scales. Developing tools to study these sets is of great interest. One step towards developing some of these tools is recognizing the duality between…

The first part of this paper deals with electrical networks and symplectic reductions. We consider two operations on electrical networks (the "trace map" and the "gluing map") and show that they correspond to symplectic reductions. We also…

We present a new method to approximate the Neumann spectrum of a Laplacian on a fractal K in the plane as a renormalized limit of the Neumann spectra of the standard Laplacian on a sequence of domains that approximate K from the outside.…

We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…

Stochastic geometry (SG) has been successfully used as a modelling tool for cellular networks to characterize the coverage probability in both the downlink (DL) and uplink (UL) systems, under the assumption that the base stations (BS) are…

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

We study the connection of the existence of solutions with certain properties and the spectrum of operators in the framework of regular Dirichlet forms on infinite graphs. In particular we prove a version of the Allegretto-Piepenbrink…

It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…

An important problem in the analysis of experimental data showing fractal properties, is that such samples are composed by a set of points limited by an upper and a lower cut off. We study how finite size effect due to the discreteness of…

Sup-normalized spectral functions form building blocks of max-stable and Pareto processes and therefore play an important role in modeling spatial extremes. For one of the most popular examples, the Brown-Resnick process, simulation is not…