Related papers: Sharp phase transition for random loop models on t…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
We study the continuity of magnetization at the phase transition of the ferromagnetic XY model in the three-dimensional square lattice with the nearest neighborhood interaction. We assume that, at the critical temperature, with probability…
We establish sharp large deviation asymptotics for the maximum order statistic of independent and identically distributed heavy-tailed random variables, valid for all Borel subsets of the right tail. This result yields exact decay rates for…
This study investigates how visibility graphs constructed from Monte Carlo Markov Chain time series of spin models capture the critical behavior of the system. More precisely, we show that this approach identifies continuous phase…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
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…
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 consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…
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…
We propose a random forest estimator for the intensity of spatial point processes, applicable with or without covariates. It retains the well-known advantages of a random forest approach, including the ability to handle a large number of…
The high temperature expansion is an analytical tool to study critical phenomena in statistical mechanics. We apply this method to 3d effective theories of Polyakov loops, which have been derived from 4d lattice Yang-Mills by means of…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We consider a semi-classical nonlinear Schrodinger equation. For initial data causing focusing at one point in the linear case, we study a nonlinearity which is super-critical in terms of asymptotic effects near the caustic. We prove the…
New method of calculation of master integrals using differential equations and asymptotical expansion is presented. This method leads to the results exact in space-time dimension $D$ having the form of the convergent power series. As an…
Motivated by the dissipative abelian sandpile model, we analyze the trajectories of a one-dimensional random walk in a landscape of soft traps. These traps, placed at increasing distances from each other, correspond to dissipative sites in…
We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…
We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…
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…
We examine an interacting particle system on trees commonly referred to as the frog model. For its initial state, it begins with a single active particle at the root and i.i.d. $\mathrm{Poiss}(\lambda)$ many inactive particles at each…
We consider the complex branching random walk on a dyadic tree with Gaussian weights on the boundary between the diffuse phase and the glassy phase. We study the branching random walk in the space of continuous functions and establish…