Related papers: Diffuse Scattering on Graphs
Low-dimensional periodic arrays of scatterers with a moving point particle are ideal models for studying deterministic diffusion. For such systems the diffusion coefficient is typically an irregular function under variation of a control…
Diffusion models are central to generative modeling and have been adapted to graphs by diffusing adjacency matrix representations. The challenge of having up to $n!$ such representations for graphs with $n$ nodes is only partially mitigated…
We develop a novel approach towards causal inference. Rather than structural equations over a causal graph, we learn stochastic differential equations (SDEs) whose stationary densities model a system's behavior under interventions. These…
This paper concerns the derivation of radiative transfer equations for acoustic waves propagating in a randomly fluctuating slab (between two parallel planes) in the weak-scattering regime, and the study of boundary effects through an…
We consider an explicitly solvable model (formulated in the Riemannian geometry terms) for a stationary wave process in a specific thin domain with the Dirichlet boundary conditions on the boundary of the domain. The transition from the…
We study classical binary fluid mixtures in which densities vary on very short time (ps) and length (nm) scales, such that hydrodynamics does not apply. In a pure fluid with a localized heat pulse the breakdown of hydrodynamics was overcome…
We derive dispersion estimates for solutions of a one-dimensional discrete Dirac equations with a potential. In particular, we improve our previous result, weakening the conditions on the potential. To this end we also provide new results…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the…
We study nonnegative solutions to the Cauchy problem for the Fractional Fast Diffusion Equation on a suitable class of connected, noncompact Riemannian manifolds. This parabolic equation is both singular and nonlocal: the diffusion is…
The scattering of scalar waves by a set of scatterers is considered. It is proven that the scattered field can be represented as an integral supported by any smooth surface enclosing the scatterers. This is a generalization of the series…
The topographical scattering of gravity waves is investigated using a spectral energy balance equation that accounts for first order wave-bottom Bragg scattering. This model represents the bottom topography and surface waves with spectra,…
We introduce a numerical method that enables efficient modelling of light scattering by large, disordered ensembles of non-spherical particles incorporated in stratified media, including when the particles are in close vicinity to each…
We investigate the bounds between normal or anomalous effective diffusion for inertial particles transported by parallel flows. The infrared behavior of the fluid kinetic-energy spectrum, i.e. the possible presence of long-range…
Graph generative models have broad applications in biology, chemistry and social science. However, modelling and understanding the generative process of graphs is challenging due to the discrete and high-dimensional nature of graphs, as…
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high…
Light transport in superdiffusive media of finite size is studied theoretically. The intensity Green's function for a slab geometry is found by discretizing the fractional diffusion equation and employing the eigenfunction expansion method.…
We study the problem of lateral diffusion on a static, quasi-planar surface generated by a stationary, ergodic random field possessing rapid small-scale spatial fluctuations. The aim is to study the effective behaviour of a particle…
The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, instead of the size, of the resulting sets. Applications of…
Existing approaches for diffusion on graphs, e.g., for label propagation, are mainly focused on isotropic diffusion, which is induced by the commonly-used graph Laplacian regularizer. Inspired by the success of diffusivity tensors for…