On the mode-change problem for random measures.
In this note, we prove an asymptotic expansion and a central limit theorem for the multiple overlap R1, ..., s of the SK model, defined for given N, s ≥ 1 by R1, ..., s = N-1Σi≤N σ1i ... σsi. These results are obtained by a careful analysis of the terms appearing in the cavity derivation formula, as well as some graph induction procedures. Our method could hopefully be applied to other spin glasses models.
von Neumann's reliance on the von Mises frequentist interpretation is discussed and compared with the Dutchbook approach proposed by de Finetti.
This paper introduces the notion of pairwise and coordinatewise negative dependence for random vectors in Hilbert spaces. Besides giving some classical inequalities, almost sure convergence and complete convergence theorems are established. Some limit theorems are extended to pairwise and coordinatewise negatively dependent random vectors taking values in Hilbert spaces. An illustrative example is also provided.
We consider positive real valued random data X with the decadic representation X = Σi=∞∞Di 10i and the first significant digit D = D(X) in {1,2,...,9} of X defined by the condition D = Di ≥ 1, Di+1 = Di+2 = ... = 0. The data X are said to satisfy the Newcomb-Benford law if P{D=d} = log10(d+1 / d) for all d in {1,2,...,9}. This law holds for example for the data with log10X uniformly distributed on an interval (m,n) where m and n are integers. We show that if log10X has a distribution function...
We consider the nearest neighbor random walk on planar graphs. For certain families of these graphs, we give explicit upper bounds on the norm of the random walk operator in terms of the minimal number of edges at each vertex. We show that for a wide range of planar graphs the spectral radius of the random walk is less than one.
Ground states of the Edwards–Anderson (EA) spin glass model are studied on infinite graphs with finite degree. Ground states are spin configurations that locally minimize the EA Hamiltonian on each finite set of vertices. A problem with far-reaching consequences in mathematics and physics is to determine the number of ground states for the model on for any . This problem can be seen as the spin glass version of determining the number of infinite geodesics in first-passage percolation or the number...
We compute explicitly the number of paths of given length joining two vertices of the Cayley graph of the free product of cyclic groups of order k.