Related papers: Discrete diffusion-type equation on regular graphs…
By using the well-known mountain pass theorem and Ekeland's variational principle, we prove that there exist at least two fully-non-trivial solutions for a $(p,q)$-Kirchhoff elliptic system with the Dirichlet boundary conditions and…
In this paper, we provide faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape…
We consider the one-dimensional initial value problem for the viscous transport equation with nonlocal velocity $u_t = u_{xx} - \left(u (K^\prime \ast u)\right)_{x}$ with a given kernel $K'\in L^1(\R)$. We show the existence of…
In this paper, we study boundary-value problems describing the exit distribution of finite-velocity random motions from prescribed domains. For the standard telegraph process, with and without drift, we derive the Dirichlet problems…
Stochastic differential equations (SDEs) are a fundamental tool for modelling dynamic processes, including gene regulatory networks (GRNs), contaminant transport, financial markets, and image generation. However, learning the underlying SDE…
We introduce the Space-Time Markov Chain Approximation (STMCA) for a general diffusion process on a finite metric graph $\Gamma$. The STMCA is a doubly asymmetric (in both time and space) random walk defined on a subdivisions of $\Gamma$,…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
We show that particle transport in a uniform, quantum multi-baker map, is generically ballistic in the long time limit, for any fixed value of Planck's constant. However, for fixed times, the semi-classical limit leads to diffusion. Random…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
We derive a formula for the level spacing probability distribution in quantum graphs. We apply it to simple examples and we discuss its relation with previous work and its possible application in more general cases. Moreover, we derive an…
In this work the diffusion in the quenched trap model with diverging mean waiting times is examined. The approach of randomly stopped time is extensively applied in order to obtain asymptotically exact representation of the disorder…
We consider the problem of `discrete-time persistence', which deals with the zero-crossings of a continuous stochastic process, X(T), measured at discrete times, T = n(\Delta T). For a Gaussian Stationary Process the persistence (no…
We develop a novel method for measuring the similarity between complete weighted graphs, which are probed by means of discrete-time quantum walks. Directly probing complete graphs using discrete-time quantum walks is intractable due to the…
We consider two versions of discrete time totally asymmetric simple exclusion processes (TASEPs) with geometric and Bernoulli random hopping probabilities. For the process mixed with these and continuous time dynamics, we obtain a single…
We address the problem of distributed computation of arbitrary functions of two correlated sources $X_1$ and $X_2$, residing in two distributed source nodes, respectively. We exploit the structure of a computation task by coding source…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
The distribution of the number of points of the closed simple random walk, visited a given number of times (the k-multiple point range) is analysed by a graph based approach. A general expression for the moments is derived. In this paper…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
We present a new method to compute the first crossing distribution in excursion set theory for the case of correlated random walks. We use a combination of the path integral formalism of Maggiore & Riotto, and the integral equation solution…