Searcharxiv⌕ Search

arXiv subjects

Arjun Pemmasani

Publications and source records attributed to Arjun Pemmasani.

2 recordsLinked to original sources

Uniform Bessel bounds for magnetization crossings in finite Ising chains

We consider a finite Ising chain in zero field and ask when the all-up configuration is as likely as zero magnetization (magnetization one for an odd number of spins). For both free and periodic ends, the crossing coupling of a long chain is half the logarithm of its length minus half the logarithm of that logarithm, up to a term that vanishes as the length grows. We compute further terms with explicit constants and, for free ends, bound the crossing at every length. The second term is missing from an earlier approximation and explains why an earlier numerical fit gives a slope below one half. To locate the crossing, we compare the known magnetization law with its Bessel approximation. The Bessel approximation is above the exact weight, and we bound its relative error for every length, coupling and magnetization. At the crossing this bound tends to zero. The central bin still has about as many domain walls as the logarithm of the length on average, so the crossing has a coupling width of order the inverse logarithm. In a fixed positive dimensionless field the last crossing comes from near the edge of the row, at a coupling of about a quarter of the logarithm of the length. For long chains it is the one-spin crossing when the field exceeds half the logarithm of two. Below that value another bin crosses later.

math.PR↗

Vertex crossings in a symmetric Markov multinomial model

We observe a ball bouncing down a Galton board with any number of directions. At each peg it either keeps its direction with some fixed probability or randomly turns to one of the other directions. Its bin measures how often it went each way, a point of a simplex. When the ball rarely turns, the most likely bins are the corners, which only a ball that never turns can reach. We ask when the best bin of each face of the simplex becomes as likely as a corner. To first order every face catches up at the same moment. We break this tie at second order, with an explicit constant for each face. Hence on a long board, as the expected number of turns grows to any fixed multiple of the length's logarithm, the most likely bin jumps once, from the corners straight to the center. A nonuniform start or a weak external field changes the constants, potentially allowing an intermediate face to win.

math.PR↗