相关论文: Bounded Discrete Bridges
Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
Random scale-free overlay topologies provide a number of properties like for example high resilience against failures of random nodes, small (average) diameter as well as good expansion and congestion characteristics that make them…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…
We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves…
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
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…
We study walk algebras and Hecke algebras for Kac-Moody root systems. Each choice of orientation for the set of real roots gives rise to a corresponding "oriented" basis for each of these algebras. We show that the notion of distinguished…
Chirality in active and passive fluids gives rise to odd transport properties, most notably the emergence of robust edge currents that defy standard dissipative dynamics. While these phenomena are well-described by continuum hydrodynamics,…
Consider a closed surface $S$ with negative Euler characteristic, and an admissible probability measure on the fundamental group of $S$ with finite first moment with respect to some hyperbolic metric on $S$. Corresponding to each point in…
We study the asymptotic behavior of zero-drift random walks confined to multidimensional convex cones, when the endpoint is close to the boundary. We derive a local limit theorem in the fluctuation regime.
The main result of this paper states that in a rooted product of a path with rooted graphs which are disposed in a somewhat mirror-symmetric fashion, there are distinct eigenvalues supported in the end vertices of the path which are too…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…
Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
The one-dimensional Brownian motion starting from the origin at time $t=0$, conditioned to return to the origin at time $t=1$ and to stay positive during time interval $0 < t < 1$, is called the Bessel bridge with duration 1. We consider…
The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…