Related papers: A model for random braiding in graph configuration…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
We study the dynamics of bond-disordered Ising spin systems on random graphs with finite connectivity, using generating functional analysis. Rather than disorder-averaged correlation and response functions (as for fully connected systems),…
We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…
The `winding state' behavior appears in the two-loop nonplanar contribution to the partition function in thermal noncommutative field theories. We derive this feature directly from the purely open string theory analysis in the presence of…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
Collective behavior of proteins on biomembranes is usually studied within the spontaneous curvature model. Here we consider an alternative phenomenological approach, which accounts consistently for partial ordering of proteins as well as…
We study a discrete-time asynchronous midpoint dynamics on the circle in which, at each step, a uniformly chosen neighboring pair moves to the midpoint along the shortest arc. Although the update rule is locally contractive, we show that…
We propose a novel architecture for Graph Neural Networks that is inspired by the idea behind Tree Kernels of measuring similarity between trees by taking into account their common substructures, named fragments. By imposing a series of…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
We propose a method for the classification of objects that are structured as random trees. Our aim is to model a distribution over the node label assignments in settings where the tree data structure is associated with node attributes…
For a random intersection graph with a power law degree sequence having a finite mean and an infinite variance we show that the global clustering coefficient admits a tunable asymptotic distribution.
Localization properties of particles in one-dimensional incommensurate lattices without interaction are investigated with models beyond the tight-binding Aubry-Andr\'e (AA) model. Based on a tight-binding t_1 - t_2 model with finite…
A simple two-species asymmetric exclusion model in one dimension with bulk and boundary exchanges of particles is investigated for the existence of spontaneous symmetry breaking. The model is a generalization of the bridge model for which…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
We demonstrate the semiclassical nature of symmetry twist defects that differ from quantum deconfined anyons in a true topological phase by examining non-abelian crystalline defects in an abelian lattice model. An underlying non-dynamical…
We develop general techniques for computing the fundamental group of the configuration space of $n$ identical particles, possessing a generic internal structure, moving on a manifold $M$. This group generalizes the $n$-string braid group of…
In probability theory and statistics, the IID model represents a single population, and a large, potentially infinite sample from this population. Main theorems, in particular the central limit theorem and laws of large number (LLN) assure…
We consider the problem of estimating the context tree of a stationary ergodic process with finite alphabet without imposing additional conditions on the process. As a starting point we introduce a Hamming metric in the space of irreducible…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…