相关论文: Analyse harmonique sur le graphe de Pascal

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

In this paper an extended CPR decomposition theorem for Finsler symmetric spaces of semi-negative curvature in the context of reductive structures is proven. This decomposition theorem is applied to give a geometric description of the…

According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…

In this paper, we investigate the spectral analysis (from the point of view of semi-groups) of discrete, fractional and classical Fokker-Planck equations. Discrete and fractional Fokker-Planck equations converge in some sense to the…

We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…

The geometric Langlands program is distinguished in assigning spectral decompositions to all representations, not only the irreducible ones. However, it is not even clear what is meant by a spectral decomposition when one works with…

It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative…

The classical spectral theorem completely describes self-adjoint operators on finite dimensional inner product vector spaces as linear combinations of orthogonal projections onto pairwise orthogonal subspaces. We prove a similar theorem for…

We study the real spectrum compactification of character varieties of finitely generated groups in semisimple Lie groups. This provides a compactification with good topological properties, and we interpret the boundary points in terms of…

We consider finite energy corotationnal wave maps with target manifold $\m S^2$. We prove that for a sequence of times, they decompose as a sum of decoupled harmonic maps in the light cone, and a smooth wave map (in the blow case) or a…

The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of this graph. In this paper we obtain new results about the…

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

We determine the summands of the decomposition theorem for the Hitchin system for $\mathrm{GL}_n$, in arbitrary degree, over the locus of reduced spectral curves. The key ingredient is an equivariant formula for lattice point counts in…

Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…

We prove an analogue of Yau's Caccioppoli-type inequality for nonnegative subharmonic functions on graphs. We then obtain a Liouville theorem for harmonic or non-negative subharmonic functions of class Lq, 1<=q<\infty, on any graph, and a…

We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs furnished with vertex colorings, edge colorings and/or edge…

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…

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…

We study semifinite harmonic functions on arbitrary branching graphs. We give a detailed exposition of an algebraic method which allows one to classify semifinite indecomposable harmonic functions on some multiplicative branching graphs.…