Related papers: Inverting Ray-Knight identities on trees
Infinite-range spin-glass models with Levy-distributed interactions show a freezing transition similar to disordered spin systems on finite connectivity random graphs. It is shown that despite diverging moments of the local field…
While looped transformers (termed as Looped-Attn) often outperform standard transformers (termed as Single-Attn) on complex reasoning tasks, the mechanism for this advantage remains underexplored. In this paper, we explain this phenomenon…
We present new combinatorial and probabilistic identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…
In recent years, much attention has been paid to the study of forward and inverse problems for the Rayleigh-Stokes equation in connection with the importance of this equation for applications. This equation plays an important role, in…
We provide conditions that classify cover times for sequences of random walks on random graphs into two types: One type (Type 1) is the class of cover times that are of the order of the maximal hitting times scaled by the logarithm of the…
We study a random walk (Markov chain) in an unbounded planar domain whose boundary is described by two curves of the form $x_2 = a^+ x_1^{\beta^+}$ and $x_2 = -a^- x_1^{\beta^-}$, with $x_1 \geq 0$. In the interior of the domain, the random…
Vision Transformers (ViTs) have computational costs scaling quadratically with the number of tokens, calling for effective token pruning policies. Most existing policies are handcrafted, lacking adaptivity to varying inputs. Moreover, they…
This paper derives an identity connecting the square loss of ridge regression in on-line mode with the loss of the retrospectively best regressor. Some corollaries about the properties of the cumulative loss of on-line ridge regression are…
This paper studies model-inversion attacks, in which the access to a model is abused to infer information about the training data. Since its first introduction, such attacks have raised serious concerns given that training data usually…
We introduce a neural network architecture to solve inverse problems linked to a one-dimensional integral operator. This architecture is built by unfolding a forward-backward algorithm derived from the minimization of an objective function…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…
In this paper, we obtain a $p$-th moment bound for the suprema of a log-concave-tailed nonhomogeneous chaos process, which is optimal in some special cases. A crucial ingredient of the proof is a novel decoupling inequality, which may be of…
We analyse the cluster discovered by invasion percolation on a branching process with a power-law offspring distribution. Invasion percolation is a paradigm model of self-organised criticality, where criticality is approached without tuning…
Person re-identification (re-ID) solves the task of matching images across cameras and is among the research topics in vision community. Since query images in real-world scenarios might suffer from resolution loss, how to solve the…
Motivated by entropic optimal transport, time reversal of Markov jump processes in $\mathbb{R}^n$ is investigated. Relying on an abstract integration by parts formula for the carr\'e du champ of a Markov process recently obtained by…
We derive characteristic function identities for conditional distributions of an r-trimmed Levy process given its r largest jumps up to a designated time t. Assuming the underlying Levy process is in the domain of attraction of a stable…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
For a (killed) spectrally negative L\'evy process we provide an analytic expression for the distribution of its overshoot over a fixed level in terms of the infinitesimal generator and the scale function of the process. Our identity…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…
In this work, we study the inverse problem of analog gravity systems which admit rotation and energy-dependent boundary conditions. By extending two recent results, we provide a recipe that allows one to relate resonant transmission spectra…