Related papers: Discrete diffusion-type equation on regular graphs…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
One key issue in the probability density function (PDF) approach for disperse two-phase turbulent flows is to close the diffusion term in the phase space. This study aimed to derive a kinetic equation for particle dispersion in turbulent…
Generalized gamma distributions arise as limits in many settings involving random graphs, walks, trees, and branching processes. Pek\"oz, R\"ollin, and Ross (2016, arXiv:1309.4183 [math.PR]) exploited characterizing distributional fixed…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
In this paper, we study the discrete-time quantum random walks on a line subject to decoherence. The convergence of the rescaled position probability distribution $p(x,t)$ depends mainly on the spectrum of the superoperator…
Using the Kuznetsov trace formula, we prove a spectral decomposition for the sums of generalized Dirichlet $L$-functions. Among applications are an explicit formula relating norms of prime geodesics to moments of symmetric square…
The discrete Green's function (without boundary) $\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules…
We investigate stochastic reaction-diffusion equations on finite metric graphs. On each edge in the graph a multiplicative cylindrical Gaussian noise driven reaction-diffusion equation is given. The vertex conditions are the standard…
Using the theory of diffusion in graphs, we propose a model to study mesoscopic transport through a diffusive quantum dot. The graph consists of three quasi-1D regions: a central region describing the dot, and two identical left- and right-…
Motivated by the need to develop a general framework for performing statistical inference for discretely observed random rough differential equations, our aim is to construct a geometric $p$-rough path ${\bf X}$ whose response $Y$, when…
We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$. The distance of points $x_1,x_2\in X$ is defined as the…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…
We analyze here different types of fractional differential equations, under the assumption that their fractional order $\nu \in (0,1] $ is random\ with probability density $n(\nu).$ We start by considering the fractional extension of the…
We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…
Fox's H-function provide a unified and elegant framework to tackle several physical phenomena. We solve the space fractional diffusion equation on the real line equipped with a delta distribution initial condition and identify the…
We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired…
A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is…
We present a systematic approach to deriving normal forms and related amplitude equations for flows and discrete dynamics on the center manifold of a dynamical system at local bifurcations and unfoldings of these. We derive a general,…