Related papers: On the Counting of Fully Packed Loop Configuration…
We propose to study the restriction conjecture using decoupling theorems and two-ends Furstenberg inequalities. Specifically, we pose a two-ends Furstenberg conjecture, which implies the restriction conjecture. As evidence, we prove this…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
In this paper, we consider convergence properties of a second order Markov chain. Similar to a column stochastic matrix is associated to a Markov chain, a so called {\em transition probability tensor} $P$ of order 3 and dimension $n$ is…
We present a theoretical study of classical Wigner crystals in two- and three-dimensional isotropic parabolic traps aiming at understanding and quantifying the configurational uncertainty due to the presence of multiple stable…
We prove a conjecture of V. V. Shokurov which in particular implies that the fibers of a resolution of a variety with divisorial log terminal singularities are rationally chain connected.
We set up a strategy for studying large families of logarithmic conformal field theories by using the enlarged symmetries and non--semi-simple associative algebras appearing in their lattice regularizations (as discussed in a companion…
We study the problem of learning clusters of partially observed linear dynamical systems from multiple input-output trajectories. This setting is particularly relevant when there are limited observations (e.g., short trajectories) from…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
We introduce PHFL, a probabilistic extension of higher-order fixpoint logic, which can also be regarded as a higher-order extension of probabilistic temporal logics such as PCTL and the $\mu^p$-calculus. We show that PHFL is strictly more…
Motivated by the observation of the storage of excess elastic free energy - (prestress) -- in cross linked semiflexible networks, we consider the problem of the conformational statistics of a single semiflexible polymer in a quenched random…
We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the p-th power of the in-degree of b. We restrict to the…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
Random network models, constrained to reproduce specific statistical features, are often used to represent and analyze network data and their mathematical descriptions. Chief among them, the configuration model constrains random networks by…
A special feature of the ground state in a topologically ordered phase is the existence of large scale correlations depending only on the topology of the regions. These correlations can be detected by the topological entanglement entropy or…
We determine the spectra of a class of quantum spin chains of Temperley-Lieb type by utilizing the concept of Temperley-Lieb equivalence with the S=1/2 XXZ chain as a reference system. We consider open boundary conditions and in particular…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A.…
The shrunk loop theorem presented here is an integral identity which facilitates the calculation of the relative probability (or probability amplitude) of any given topology that a free, closed Brownian or Feynman path of a given 'duration'…