相关论文: Critical random graphs: Diameter and mixing time

We give a combinatorial proof of the following theorem. Let $G$ be any finite group acting transitively on a set of cardinality $n$. If $S \subseteq G$ is a random set of size $k$, with $k \geq (\log n)^{1+\varepsilon}$ for some…

We consider dynamical percolation on the complete graph $K_n$, where each edge refreshes its state at rate $\mu \ll 1/n$, and is then declared open with probability $p = \lambda/n$ where $\lambda > 1$. We study a random walk on this…

We provide a complete description of the giant component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ as soon as it emerges from the scaling window, i.e., for $p = (1+\epsilon)/n$ where $\epsilon^3 n \to \infty$ and $\epsilon=o(1)$. Our…

Consider the subgraph of the discrete $d$-dimensional torus of size length $N$, $d\ge3$, induced by the range of the simple random walk on the torus run until the time $uN^d$. We prove that for all $d\ge 3$ and $u>0$, the mixing time for…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected…

We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…

The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random…

The largest components of the critical Erd\H{o}s-R\'enyi graph, $G(n,p)$ with $p=1/n$, have size of order $n^{2/3}$ with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of…

We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…

Define $(X_n)$ on $\mathbf{Z}/q\mathbf{Z}$ by $X_{n+1} = 2X_n + b_n$, where the steps $b_n$ are chosen independently at random from $-1, 0, +1$. The mixing time of this random walk is known to be at most $1.02 \log_2 q$ for almost all odd…

We consider the simple random walk on a random d-regular graph with n vertices, and investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. It was shown in…

We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on…

We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…

We study the mixing time of a random walker who moves inside a dynamical random cluster model on the d-dimensional torus of side-length n. In this model, edges switch at rate \mu between open and closed, following a Glauber dynamics for the…

We prove expectation and concentration results for the following random variables on an Erd\H{o}s-R\'enyi random graph $\mathcal{G}\left(n,p\right)$ in the sparsely connected regime $\log n + \log\log \log n \leq np < n^{1/10}$: effective…

Let $G(N,p)=(V,E)$ be an Erd\"os-R\'enyi random graph and $(X_n)_{n \in \mathbb{N}}$ be a simple random walk on it. We study the the order of magnitude of $\sum_{i \in V} \pi_ih_{ij} $ where $\pi_i=d_i / 2|E|$ for $d_i$ the number of…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…

In this paper we study the cover time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs on $\mathrm{Poi}(n)$ vertices. We show that the cover time undergoes a jump at the connectivity…

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…