Related papers: Iterated Graph Systems (I): random walks and diffu…
We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…
We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…
A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…
The problem of sums of independent, identically distributed random variables with stretched-exponential tails exhibits a dynamical phase transition and has recently reemerged in the context of active transport and condensation phenomena. We…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
In this paper, we explore the two-star Exponential Random Graph Model, which is a two parameter exponential family on the space of simple labeled graphs. We introduce auxiliary variables to express the two-star model as a mixture of the…
This paper studies, in dimensions greater than two, stationary diffusion processes in random environment which are small, isotropic perturbations of Brownian motion satisfying a finite range dependence. Such processes were first considered…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
Stretched exponential relaxation ($\exp{-(t/\tau)}^{\beta_K}$) is observed in a large variety of systems but has not been explained so far. Studying random walks on percolation clusters in curved spaces whose dimensions range from 2 to 7,…
This paper studies anchored expansion, a non-uniform version of the strong isoperimetric inequality. We show that every graph with i-anchored expansion contains a subgraph with isoperimetric (Cheeger) constant at least i. We prove a…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
Given a set of graphs from some unknown family, we want to generate new graphs from that family. Recent methods use diffusion on either graph embeddings or the discrete space of nodes and edges. However, simple changes to embeddings (say,…
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…
The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…
Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
Working in the setting of i.i.d. last-passage percolation on $\mathbb{R}^D$ with no assumptions on the underlying edge\hyp{}weight distribution, we arrive at the notion of grid entropy - a Subadditive Ergodic Theorem limit of the entropies…