Zobrazeno 1 - 10
of 8 993
pro vyhledávání: '"60K35"'
Autor:
Crowell, Robert Alexander
The empirical measure of an interacting particle system is a purely atomic random probability measure. In the limit as the number of particles grows to infinity, we show for McKean-Vlasov systems with common noise that this measure becomes absolutely
Externí odkaz:
http://arxiv.org/abs/2409.03459
Autor:
Zhou, Wang
Through the rotational invariance of the 2-d critical bond percolation exploration path on the square lattice we express Smirnov's edge parafermionic observable as a sum of two new edge observables. With the help of these two new edge observables we
Externí odkaz:
http://arxiv.org/abs/2409.03235
We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the case where
Externí odkaz:
http://arxiv.org/abs/2409.02660
We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the walk exhi
Externí odkaz:
http://arxiv.org/abs/2409.02096
We prove the Gibbs variational principle for the Asakura--Oosawa model in which particles of random size obey a hardcore constraint of non-overlap and are additionally subject to a temperature-dependent area interaction. The particle size is unbounde
Externí odkaz:
http://arxiv.org/abs/2408.17170
Autor:
Sepúlveda, Avelio, Ziliotto, Bruno
We characterize the critical parameter of oriented percolation on $\mathbb{Z}^2$ through the value of a zero-sum game. Specifically, we define a zero-sum game on a percolation configuration of $\mathbb{Z}^2$, where two players move a token along the
Externí odkaz:
http://arxiv.org/abs/2408.13796
A number of complexity measures for Boolean functions have previously been introduced. These include (1) sensitivity, (2) block sensitivity, (3) witness complexity, (4) subcube partition complexity and (5) algorithmic complexity. Each of these is con
Externí odkaz:
http://arxiv.org/abs/2408.12995
Autor:
de Lima, Lucas R.
This doctoral thesis undertakes an in-depth exploration of limiting shape theorems across diverse mathematical structures, with a specific focus on subadditive processes within finitely generated groups exhibiting polynomial growth rates, as well as
Externí odkaz:
http://arxiv.org/abs/2408.11615
Autor:
Shen, Xiao
Temporal correlations in the KPZ universality class have gained significant attention, following the conjectures in [Ferr-Spoh'16]. Building on prior work in the zero temperature setting [Basu-Gang-Zhan'21], we address the time correlation problem wi
Externí odkaz:
http://arxiv.org/abs/2408.07928
Autor:
Gladkov, Nikita
The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and other inequ
Externí odkaz:
http://arxiv.org/abs/2408.08457