Related papers: The homogenous tree as an electric network
It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…
Motility is characteristic of life, but a common basis for movement has remained to be identified. Diverse systems in motion shift between two states depending on interactions that turnover at the rate of an applied cycle of force. Although…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
A stable-like Markov chain is a time-homogeneous Markov chain on the real line with the transition kernel $p(x,dy)=f_x(y-x)dy$, where the density functions $f_x(y)$, for large $|y|$, have a power-law decay with exponent $\alpha(x)+1$, where…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…
Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…
Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…
We study the global and local regularity properties of random wavelet series whose coefficients exhibit correlations given by a tree-indexed Markov chain. We determine the law of the spectrum of singularities of these series, thereby…
Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of $k$ paths ($k$ is odd) along branches of trees or, equivalently, $k$ loop--erased random walks. Starting and ending points of…
We introduce a diffusion model for energetically inhomogeneous systems. A random walker moves on a spin-S Ising configuration, which generates the energy landscape on the lattice through the nearest-neighbors interaction. The underlying…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…
We study the homology of random \v{C}ech complexes generated by a homogeneous Poisson process. We focus on 'homological connectivity' - the stage where the random complex is dense enough, so that its homology "stabilizes" and becomes…
In this paper, we make a few random explorations that relate directly to the items mentioned in the title. We define transient chains and recurrent chains with "killing", the Green's function, the Laplacian operator, and harmonic functions.…
We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…