Related papers: Discrete diffusion-type equation on regular graphs…
We formulate and analyze difference equations on graphs analogous to time-independent diffusion equations arising in the study of diffuse scattering in continuous media. Moreover, we show how to construct solutions in the presence of weak…
In this work we study the degenerate diffusion equation $\partial_{t}=x^{\alpha}a\left(x\right)\partial_{x}^{2}+b\left(x\right)\partial_{x}$ for $\left(x,t\right)\in\left(0,\infty\right)^{2}$, equipped with a Cauchy initial data and the…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
Let $T\$ be a stopping time associated with a sequence of independent random variables $Z_{1},Z_{2},...$ . By applying a suitable change in the probability measure we present relations between the moment or probability generating functions…
Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H^k_n(G)$ is produced when the preceding constructions are repeated $n$…
Transporting between arbitrary distributions is a fundamental goal in generative modeling. Recently proposed diffusion bridge models provide a potential solution, but they rely on a joint distribution that is difficult to obtain in…
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected…
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…
We solve explicitly the following problem: for a given probability measure mu, we specify a generalised martingale diffusion X which, stopped at an independent exponential time T, is distributed according to mu. The process X is specified…
Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from s_i to t_i. Schrijver [SICOMP'94] proved that the…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
We present in a detailed manner the scaling theory of irreversible aggregation characterized by the set of reaction rates $K(k,l)=1/k+1/l$, as well as a minor generalisation thereof. In this case, it is possible to evaluate the scaling…
We propose diffusion-like equations with time and space fractional derivatives of the distributed order for the kinetic description of anomalous diffusion and relaxation phenomena, whose diffusion exponent varies with time and which,…
We consider graph diffusion processes constructed from finite i.i.d. samples drawn from an unknown manifold embedded in ambient Euclidean space, where the graph affinity is defined by an ambient Gaussian kernel matrix. We show that the…
.Stochastic models based on random diffusivities, such as the diffusing-diffusivity approach, are popular concepts for the description of non-Gaussian diffusion in heterogeneous media. Studies of these models typically focus on the moments…
We consider a time-dependent linear diffusion equation together with a related inverse boundary value problem. The aim of the inverse problem is to determine, based on observations on the boundary, the non-homogeneous diffusion coefficient…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…
In this work, we consider the numerical recovery of a spatially dependent diffusion coefficient in a subdiffusion model from distributed observations. The subdiffusion model involves a Caputo fractional derivative of order $\alpha\in(0,1)$…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…