Related papers: Sharp phase transition in the random stirring mode…

We investigate the mixed spin-$(s,\tfrac12)$ Ising model on a Cayley tree of order three ($k=3$), extending the approach of \cite{Akin2024}. For the representative case $s=5$, the associated recursion leads to an 11-dimensional dynamical…

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

We provide sharp Large Deviation estimates for the probability of exit from a domain for the bridge of a $d$-dimensional general diffusion process $X$, as the conditioning time tends to $0$. This kind of results is motivated by applications…

We study the surface scaling behavior of a semi-infinite $d$-dimensional O(N) spin system in the presence of quenched random field and random anisotropy disorders. It is known that above the lower critical dimension $d_{\mathrm{lc}}=4$ the…

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

In the Gaussian sequence model $Y= \theta_0 + \varepsilon$ in $\mathbb{R}^n$, we study the fundamental limit of approximating the signal $\theta_0$ by a class $\Theta(d,d_0,k)$ of (generalized) splines with free knots. Here $d$ is the…

In this paper, we study the evolution of a Finitary Random Interlacement (FRI) with respect to the expected length of each fiber. In contrast to the previously proved phase transition between sufficiently large and small fiber length, we…

We perform simulations of random Ising models defined over small-world networks and we check the validity and the level of approximation of a recently proposed effective field theory. Simulations confirm a rich scenario with the presence of…

We study the thick points of branching Brownian motion and branching random walk with a critical branching mechanism, focusing on the critical dimension $d = 4$. We determine the exponent governing the probability to hit a small ball with…

The present paper addresses the following question: for a geometric random tree in $\R^{2}$, how many semi-infinite branches cross the circle $\CC_{r}$ centered at the origin and with a large radius $r$? We develop a method ensuring that…

In this paper we analyze a quartic tensor model with one interaction for a tensor of arbitrary rank. This model has a critical point where a continuous limit of infinitely refined random geometries is reached. We show that the critical…

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…

A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to…

We generalize the simplest kinetically constrained model of a glass-forming liquid by softening kinetic constraints, allowing them to be violated with a small finite rate. We demonstrate that this model supports a first-order dynamical…

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the…

In this paper we study the existence phase transition of scale invariant random fractal models. We determine the exact value of the critical point of this phase transition for all models satisfying some weak assumptions. In addition, we…

It is well-known that the $G(n,p)$ model of random graphs undergoes a dramatic change around $p=\frac 1n$. It is here that the random graph is, almost surely, no longer a forest, and here it first acquires a giant (i.e., order $\Omega(n)$)…

We prove that random-cluster models with q larger than 1 on a variety of planar lattices have a sharp phase transition, that is that there exists some parameter p_c below which the model exhibits exponential decay and above which there…

We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…