Related papers: Local ergodicity in the exclusion process on an in…

Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

We consider the asymmetric simple exclusion process (ASEP) on the one-dimensional finite lattice $\{1,2,\ldots,N\}$. The particles can be created/annihilated at the boundaries with given rates. These rates are $L^\infty$ functions of time…

In this paper we study Markov processes and related first passage problems on a class of weighted, modular graphs which generalize the Dyson hierarchical model. In these networks, the coupling strength between two nodes depends on their…

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…

We consider smooth area-preserving flows (also known as locally Hamiltonian flows) on surfaces of genus $g\geq 1$ and study ergodic integrals of smooth observables along the flow trajectories. We show that these integrals display a…

In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…

In this article we define and study a stochastic process on Galoisian covers of compact manifolds. The successive positions of the process are defined recursively by picking a point uniformly in the Dirichlet domain of the previous one. We…

We consider the facilitated exclusion process, which is a nonergodic, kinetically constrained exclusion process. We show that in the hydrodynamic limit, its macroscopic behavior is governed by a free boundary problem. The particles evolve…

Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…

The goal of this paper is to develop a general method to establish conditional ergodicity of infinite-dimensional Markov chains. Given a Markov chain in a product space, we aim to understand the ergodic properties of its conditional…

In this paper we are concerned with the study of additive ergodic averages in multiplicative systems and the investigation of the "pretentious" dynamical behaviour of these systems. We prove a mean ergodic theorem (Theorem A) that…

We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…

We prove quenched versions of (i) a large deviations principle (LDP), (ii) a central limit theorem (CLT), and (iii) a local central limit theorem (LCLT) for non-autonomous dynamical systems. A key advance is the extension of the spectral…

Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…

We prove ergodicity in a class of skew-product extensions of interval exchange transformations given by cocycles with logarithmic singularities. This, in particular, gives explicit examples of ergodic $\mathbb{R}$-extensions of minimal…

We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…

We present an exclusion process based approach for sampling densest $k$-sub-graphs from regular graphs $L$ with connected complement. By interpreting an exclusion process as a Markov chain on a corresponding Token Graph $\mathfrak{L}_k$, we…

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…

In this paper, we introduce ergodic sets, subsets of nodes of the networks that are dynamically disjoint from the rest of the network (i.e. that can never be reached or left following to the network dynamics). We connect their definition to…