Related papers: Quenched invariance principles for the random cond…
We study the statistics of the maximum and minimum of a set of $N$ random variables whose dynamical and statistical properties fall within the scope of infinite ergodic theory. These non-stationary yet recurrent systems are described, in…
We study the trapping phenomenon of random walks in random environments of i.i.d. random conductances on the bonds of the grid $\mathbb{Z}^d$, the so-called random conductance model. Our main results concern the important model with…
We extend the latent position random graph model to the line graph of a random graph, which is formed by creating a vertex for each edge in the original random graph, and connecting each pair of edges incident to a common vertex in the…
We show that it is possible to generate a random walk with an electrostatic field by means of several parallel infinite charged planes in which the surface charge distribution could be either $\pm\sigma$. We formulate the problem of this…
We consider the random walk among random conductances on Z^d. We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
The celebrated invariance property states that particles entering a bounded domain, with isotropic and uniform incidence, spend on average $\langle \ell \rangle=4V/S$ length inside, no matter how they scatter. We show that this remarkable…
This paper establishes a central limit theorem and an invariance principle for a wide class of stationary random fields under natural and easily verifiable conditions. More precisely, we deal with random fields of the form $X_k =…
We employ an extension of ergodic theory to the random setting to investigate the existence of random periodic solutions of random dynamical systems. Given that a random dynamical system has a dissipative structure, we proved that a random…
This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…
We consider a random walk $\{S_n\}_{n\in \mathbb{N}}$ in time-inhomogeneous random environment $\xi$. For almost each realization of $\xi$, we formulate a quenched harmonic function, based on which we can define the random walk in random…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…
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 finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…
We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
We consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…
We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…