Related papers: An exactly solvable continuous-time Derrida--Retau…
In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features.…
We study the full unitary matrix models. Introducing a new term $l log U$, l plays the role of the discrete time. On the other hand, the full unitary matrix model contains a topological term. In the continuous limit it gives rise to a phase…
Neural Differential Equations (NDEs) excel at modeling continuous-time dynamics, effectively handling challenges such as irregular observations, missing values, and noise. Despite their advantages, NDEs face a fundamental challenge in…
The article considers the Derrida-Retaux model with a random number of terms, i.e. a sequence of integer random variables defined by the relations $ X_{n + 1} = (X_n^{(1)} + X_n^{(2)} + ... + X_n^{(N_n)} - a)^{+}$, $n\ge 0$, where $X_n^{j}$…
Establishing the nature of a quantum phase transition in finite-size simulations -- whether continuous, first-order, or weak first-order -- is a fundamental challenge in quantum many-body computation. Especially, the weak first-order phase…
We study delay-independent stability in nonlinear models with a distributed delay which have a positive equilibrium. Such models frequently occur in population dynamics and other applications. In particular, we construct a relevant…
The Regge Calculus approximates a continuous manifold by a simplicial lattice, keeping the connectivities of the underlying lattice fixed and taking the edge lengths as degrees of freedom. The Discrete Regge model employed in this work…
We present high statistics simulations of weighted lattice bond animals and lattice trees on the square lattice, with fugacities for each non-bonded contact and for each bond between two neighbouring monomers. The simulations are performed…
Continuous-time neural processes are performant sequential decision-makers that are built by differential equations (DE). However, their expressive power when they are deployed on computers is bottlenecked by numerical DE solvers. This…
As one of the most significant models, the uniform recursive tree (URT) has found many applications in a variety of fields. In this paper, we study rigorously the structural features and spectral properties of the adjacency matrix for a…
A generalization of the Drude model is studied. On the one hand, the free motion of the particles is allowed to be sub- or superdiffusive; on the other hand, the distribution of the time delay between collisions is allowed to have a long…
We provide a new characterisation of Duquesne and Le Gall's $\alpha$-stable tree, $\alpha\in(1,2]$, as the solution of a recursive distribution equation (RDE) of the form $\mathcal{T}\overset{d}{=}g(\xi,\mathcal{T}_i, i\geq0)$, where $g$ is…
Automated mathematical reasoning is a challenging problem that requires an agent to learn algebraic patterns that contain long-range dependencies. Two particular tasks that test this type of reasoning are (1) mathematical equation…
Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…
The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…
We show the theory of pointed $\R$-trees with radius at most $r$ is axiomatizable in a suitable continuous signature. We identify the model companion $\rbRT_r$ of this theory and study its properties. In particular, the model companion is…
We study transitions between phases of matter with topological order. By studying these transitions in exactly solvable lattice models we show how universality classes may be identified and critical properties described. As a familiar…
We explore the supercritical phase of the vertex-reinforced jump process (VRJP) and the $\mathbb{H}^{2|2}$-model on rooted regular trees. The VRJP is a random walk, which is more likely to jump to vertices on which it has previously spent a…
Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition relation can be effectively encoded as regular languages. In…
We study the finite-temperature phase transition of the generalized Gross-Neveu model with continous chiral symmetry in $2 < d \leq 4$ euclidean dimensions. The critical exponents are computed to the leading order in the $1/N$ expansion at…