Zobrazeno 1 - 10
of 369
pro vyhledávání: '"Sly, Allan"'
The stochastic block model is a canonical model of communities in random graphs. It was introduced in the social sciences and statistics as a model of communities, and in theoretical computer science as an average case model for graph partitioning pr
Externí odkaz:
http://arxiv.org/abs/2406.15957
Fixing $\beta \ge 0$ and an integer $q \ge 2$, consider the ferromagnetic $q$-Potts measures $\mu_n^{\beta,B}$ on finite graphs ${\sf G}_n$ on $n$ vertices, with external field strength $B \ge 0$ and the corresponding random cluster measures $\varphi
Externí odkaz:
http://arxiv.org/abs/2312.16008
For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale argument to prove stretched exponential concentration of the first passage times at the scale of the standard deviation. Our results are proved under hypoth
Externí odkaz:
http://arxiv.org/abs/2312.14143
Autor:
Sly, Allan, Sohn, Youngtak
The local behavior of typical solutions of random constraint satisfaction problems (CSP) describes many important phenomena including clustering thresholds, decay of correlations, and the behavior of message passing algorithms. When the constraint de
Externí odkaz:
http://arxiv.org/abs/2305.17334
In this paper we continue to rigorously establish the predictions in ground breaking work in statistical physics by Decelle, Krzakala, Moore, Zdeborov\'a (2011) regarding the block model, in particular in the case of $q=3$ and $q=4$ communities. We p
Externí odkaz:
http://arxiv.org/abs/2212.03362
Autor:
Elboim, Dor, Sly, Allan
In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge interchange. In t
Externí odkaz:
http://arxiv.org/abs/2211.17023
Autor:
Dauvergne, Duncan, Sly, Allan
In a collection of particles performing independent random walks on $\mathbb Z^d$ we study the spread of an infection with SIR dynamics. Susceptible particles become infected when they meet an infected particle. Infected particles heal and are remove
Externí odkaz:
http://arxiv.org/abs/2209.06037
Autor:
Schmid, Dominik, Sly, Allan
In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower decomposition, we s
Externí odkaz:
http://arxiv.org/abs/2209.04395
Autor:
Nguyen, Oanh, Sly, Allan
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random graphs $\ma
Externí odkaz:
http://arxiv.org/abs/2205.03551
Autor:
Schmid, Dominik, Sly, Allan
We study mixing times for the totally asymmetric simple exclusion process (TASEP) on a circle of length $N$ with $k$ particles. We show that the mixing time is of order $N^2 \min(k,N-k)^{-1/2}$, and that the cutoff phenomenon does not occur. This con
Externí odkaz:
http://arxiv.org/abs/2203.11896