نتایج جستجو برای: percolation
تعداد نتایج: 10202 فیلتر نتایج به سال:
Covering a graph or a lattice with nonoverlapping dimers is a problem that has received considerable interest in areas, such as discrete mathematics, statistical physics, chemistry, and materials science. Yet, the problem of percolation on dimer-covered lattices has received little attention. In particular, percolation on lattices that are fully covered by nonoverlapping dimers has not evidentl...
This paper introduces a discrete-time stochastic game class on [Formula: see text], which plays the role of toy model for well-known problem homogenization Hamilton–Jacobi equations. Conditions are provided under n-stage value converges as n tends to infinity, and connections with theory discussed. Funding: The second author acknowledges support French Agence Nationale de la Recherche (ANR) [Gr...
Introduction First we would like to explain Percolation theory, and then we refer to the possibility of the application of this theory to political science. There are two kinds of
In this paper, we study percolation on finite Cayley graphs. A conjecture of Benjamini says that the critical percolation pc of any vertex–transitive graph satisfying a certain diameter condition can be bounded away from one. We prove Benjamini’s conjecture for some special classes of Cayley graphs. We also establish a reduction theorem, which allows us to build Cayley graphs for large groups w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید