Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRandom graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time
126
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This improvement finally settles a conjecture by Aizenman (1997) about the role of boundary conditions in critical high-dimensional percolation, and it is a key step in deriving further properties of critical percolation on the torus. Indeed, a criterion of Nachmias and Peres (2008) implies appropriate bounds on diameter and mixing time of the largest clusters. We further prove that the volume bounds apply also to any finite number of the largest clusters. The main conclusion of the paper is that the behavior of critical percolation on the high-dimensional torus is the same as for critical Erdos-Renyi random graphs. In this updated version we incorporate an erratum to be published in a forthcoming issue of Probab. Theory Relat. Fields. This results in a modification of Theorem 1.2 as well as Proposition 3.1.
rate research
Read More
In this paper we study the metastable behavior of one of the simplest disordered spin system, the random field Curie-Weiss model. We will show how the potential theoretic approach can be used to prove sharp estimates on capacities and metastable exit times also in the case when the distribution of the random field is continuous. Previous work was restricted to the case when the random field takes only finitely many values, which allowed the reduction to a finite dimensional problem using lumping techniques. Here we produce the first genuine sharp estimates in a context where entropy is important.
We study exceptional sets of the local time of the continuous-time simple random walk in scaled-up (by $N
In this paper we investigate the long time behavior of solutions to fractional in time evolution equations which appear as results of random time changes in Markov processes. We consider inverse subordinators as random times and use the subordination principle for the solutions to forward Kolmogorov equations. The class of subordinators for which asymptotic analysis may be realized is described.
Given a random word of size $n$ whose letters are drawn independently from an ordered alphabet of size $m$, the fluctuations of the shape of the random RSK Young tableaux are investigated, when $n$ and $m$ converge together to infinity. If $m$ does not grow too fast and if the draws are uniform, then the limiting shape is the same as the limiting spectrum of the GUE. In the non-uniform case, a control of both highest probabilities will ensure the convergence of the first row of the tableau toward the Tracy--Widom distribution.
Finding a ground state of a given Hamiltonian on a graph $G=(V,E)$ is an important but hard problem. One of the potential methods is to use a Markov chain Monte Carlo to sample the Gibbs distribution whose highest peaks correspond to the ground states. In this short paper, we investigate the stochastic cellular automata, in which all spins are updated independently and simultaneously. We prove that (i) if the temperature is sufficiently high and fixed, then the mixing time is at most of order $log|V|$, and that (ii) if the temperature drops in time $n$ as $1/log n$, then the limiting measure is uniformly distributed over the ground states.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
