Related papers: Discrete diffusion-type equation on regular graphs…
We formulate the generalized master equation for a class of continuous time random walks in the presence of a prescribed deterministic evolution between successive transitions. This formulation is exemplified by means of an…
We study a class of semilinear diffusion equations on infinite, connected, weighted graphs, focusing on two types of nonlinearities: monotone decreasing and Lipschitz continuous. Under minimal structural assumptions on the graph, we…
The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…
We consider a generalization of the diffusion equation on graphs. This generalized diffusion equation gives rise to both normal and superdiffusive processes on infinite one-dimensional graphs. The generalization is based on the $k$-path…
We generalize the scattering approach to quantum graphs to quantum graphs with with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
We study existence and uniqueness for one-dimensional generalized stochastic differential equations with singular coefficients, including distributional drift and degenerate, possibly discontinuous, diffusion coefficients. Such…
An intermittent nonlinear map generating subdiffusion is investigated. Computer simulations show that the generalized diffusion coefficient of this map has a fractal, discontinuous dependence on control parameters. An amended continuous…
We discuss a family of time-reversible, scale-invariant diffusions with singular coefficients. In analogy with the standard Gaussian theory, a corresponding family of generalized characteristic functions provides a useful tool for proving…
We present a general scheme to calculate within the independent interval approximation generalized (level-dependent) persistence properties for processes having a finite density of zero-crossings. Our results are especially relevant for the…
We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…
In dynamic graphs, edges may be added or deleted in each synchronous round. Various connectivity models exist based on constraints on these changes. One well-known model is the $T$-Interval Connectivity model, where the graph remains…
Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph $C_n$,…
The Swift-Hohenberg equation (SHE) is a partial differential equation that explains how patterns emerge from a spatially homogeneous state. It has been widely used in the theory of pattern formation. Following a recent study by Bramburger…
The explicit solution to the spectral problem of quantum graphs is used to obtain the exact distributions of several spectral statistics, such as the oscillations of the quantum momentum eigenvalues around the average, $\delta…
We develop a new robust technique to deduce variance principles for non-integrable discrete systems. To illustrate this technique, we show the existence of a variational principle for graph homomorphisms from $\Z^m$ to a $d$-regular tree.…
We derive an expression for the mean square displacement of a particle whose motion is governed by a uniform, periodic, quantum multi-baker map. The expression is a function of both time, $t$, and Planck's constant, $\hbar$, and allows a…
We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…
We consider the quantum first detection problem for a particle evolving on a graph under repeated projective measurements with fixed rate $1/\tau$. A general formula for the mean first detected transition time is obtained for a quantum walk…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…