相关论文: An inverse problem for fractional random walks on …
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
In this thesis, we study three physically relevant models of strongly correlated random variables: trapped fermions, random matrices and random walks. In the first part, we show several exact mappings between the ground state of a trapped…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
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…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
We generalize many recent uniqueness results on the fractional Calder\'on problem to cover the cases of all domains with nonempty exterior. The highlight of our work is the characterization of uniqueness and nonuniqueness of partial data…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.
Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…
Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…
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 show that the generalized diffusion coefficient of a subdiffusive intermittent map is a fractal function of control parameters. A modified continuous time random walk theory yields its coarse functional form and correctly describes a…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…