Related papers: Spectral Properties of Laplacian and Stochastic Di…
The challenges of graph stream algorithms are twofold. First, each edge needs to be processed only once, and second, it needs to work on highly constrained memory. Diffusion degree is a measure of node centrality that can be calculated (for…
The hierarchical product of networks represents a natural tool for building large networks out of two smaller subnetworks: a primary subnetwork and a secondary subnetwork. Here we study the dynamics of diffusion and synchronization…
We survey geometric properties which imply the stochastic incompleteness of the minimal diffusion process associated to the Laplacian on manifolds and graphs. In particular, we completely characterize stochastic incompleteness for…
Traditionally, systems governed by linear Partial Differential Equations (PDEs) are spatially discretized to exploit their algebraic structure and reduce the computational effort for controlling them. Due to beneficial insights of the PDEs,…
In this paper, we present a new multiscale method which is capable of coupling atomistic and continuum domains for high frequency wave propagation analysis. The problem of non-physical wave reflection, which occurs due to the change in…
We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i…
The spectral excess theorem states that, in a regular graph G, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess (a number that is computed by using…
From social interactions to the human brain, higher-order networks are key to describe the underlying network geometry and topology of many complex systems. While it is well known that network structure strongly affects its function, the…
For the case of approximation of convection--diffusion equations using piecewise affine continuous finite elements a new edge-based nonlinear diffusion operator is proposed that makes the scheme satisfy a discrete maximum principle. The…
For a distribution advected by a simple chaotic map with diffusion, the "strange eigenmode" is investigated from the Lagrangian (material) viewpoint and compared to its Eulerian (spatial) counterpart. The eigenmode embodies the balance…
This work presents a comprehensive framework for enhanced diffusion modeling in fluid-structure interactions by combining the Immersed Boundary Method (IBM) with stochastic trajectories and high-order spectral boundary conditions. Using…
The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the…
The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
An investigation of the effect of surface diffusion in random deposition model is made by analytical methods and reasoning. For any given site, the extent to which a particle can diffuse is decided by the morphology in the immediate…
Diffusion models have shown remarkable capabilities in generating high-fidelity data across modalities such as images, audio, and video. However, their computational intensity makes deployment on edge devices a significant challenge. This…
Graph Laplacians and related nonlinear mappings into low dimensional spaces have been shown to be powerful tools for organizing high dimensional data. Here we consider a data set X in which the graph associated with it changes depending on…
Bond-percolation graphs are random subgraphs of the d-dimensional integer lattice generated by a standard bond-percolation process. The associated graph Laplacians, subject to Dirichlet or Neumann conditions at cluster boundaries, represent…
Laplacian flows model the rate of change of each node's state as being proportional to the difference between its value and that of its neighbors. Typically, these flows capture diffusion or synchronization dynamics and are well-studied.…
We introduce Spectral Guidance, a framework for controlling diffusion models by leveraging the intrinsic geometry of the generative process. As data is progressively corrupted by noise, only a small number of features remain informative for…