Related papers: A random Schr\"odinger operator associated with th…
A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability $\alpha$, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen…
We give a simple proof for recurrence of vertex reinforced jump process on \(\mathbb{Z}^d\), under strong reinforcement. Moreover, we show how the previous result implies that linearly edge-reinforced random walk on \ \(\mathbb{Z}^d\) is…
It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…
We consider physical interpretations of non-trivial boundary conditions of self-adjoint extensions for one-dimensional Schr\"odinger operator of free spinless particle. Despite its model and rather abstract character this question is worth…
The aim of this paper is to study asymptotic geometric properties almost surely or/and in probability of extreme order statistics of an i.i.d. random field (potential) indexed by sites of multidimensional lattice cube, the volume of which…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
We prove some new pointwise-in-energy bounds on the expectations of various spectral shift functions associated with random Schr\"{o}dinger operators in the continuum having Anderson-type random potentials in both finite-volume and…
This paper investigates functional limit theorems for the Elephant Random Walk (ERW) on general periodic structures, extending the Bertenghi's results on $\mathbb{Z}^d$. Our results reveal new structure-dependent quantities that do not…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is…
We prove sharp upper bounds for eigenvalues of Schr\"odinger operators on quantum graphs with $\delta$-coupling (also known as Robin) conditions at all vertices. The bounds depend on the geometry of the graph, on the potential, and the…
Jim Propp's P-machine, also known as the "rotor router model" is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order.…
We consider Schr\"odinger operators with periodic potentials on periodic discrete graphs. The spectrum of the Schr\"odinger operator consists of an absolutely continuous part (a union of a finite number of non-degenerated bands) plus a…
In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…
Findings by M. L. Lyra, S. Mayboroda and M. Filoche relate invertibility and positivity of a class of discrete Schr\"odinger matrices with the existence of the "Landscape Function", which provides an upper bound on all eigenvectors…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
This paper is a further study of Reference \cite{Xue2015}. We are concerned with the contact process with random vertex weights on the oriented lattice. Our main result gives the asymptotic behavior of the survival probability of the…