Related papers: Two-sided infinite-bin models and analyticity for …
The problem of whether and how one can compute the twin-width of a graph -- along with an accompanying contraction sequence -- lies at the forefront of the area of algorithmic model theory. While significant effort has been aimed at…
In relational DBMS, window functions have been widely used to facilitate data analytics. Surprisingly, while similar concepts have been employed for graph analytics, there has been no explicit notions of graph window analytic functions. In…
We improve the running time of the general algorithmic technique known as Baker's approach (1994) on H-minor-free graphs from O(n^{f(|H|)}) to O(f(|H|) n^{O(1)}). The numerous applications include e.g. a 2-approximation for coloring and…
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with a random number of half-edges according to a…
We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers $k$ and $\ell$ with $k/2\le \ell < k$, we establish…
We suggest a generalization of the Feynman path integral to an integral over random surfaces. The proposed action is proportional to the linear size of the random surfaces and is called gonihedric. The convergence and the properties of the…
We propose a way of finding a Stein type characterization of a given absolutely continuous distribution $\mu$ on $\R$ which is motivated by a regression property satisfied by an exchangeable pair $(W,W')$ where $\calL(W)$ is supposed or…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
A vertex of a randomly growing graph is called a persistent hub if at all but finitely many moments of time it has the maximal degree in the graph. We establish the existence of a persistent hub in the Barab\'asi--Albert random graph model…
Graphs are widely used for describing systems made up of many interacting components and for understanding the structure of their interactions. Various statistical models exist, which describe this structure as the result of a combination…
Exponential random graph models are an important tool in the statistical analysis of data. However, Bayesian parameter estimation for these models is extremely challenging, since evaluation of the posterior distribution typically involves…
Stationary reciprocal processes defined on a finite interval of the integer line can be seen as a special class of Markov random fields restricted to one dimension. Non stationary reciprocal processes have been extensively studied in the…
We show that the interband dynamics in a tilted two-band Bose-Hubbard model can be reduced to an analytically accessible spin model in the case of resonant interband oscillations. This allows us to predict the revival time of these…
We introduce a class of (2+1)-dimensional stochastic growth processes, that can be seen as irreversible random dynamics of discrete interfaces. "Irreversible" means that the interface has an average non-zero drift. Interface configurations…
For the multi-mode Dicke model in a transport setting that exhibits collective boson transmissions, we construct the equation of motion for the cumulant generating function. Approximating the exact system of equations at the level of…
The purpose of the present effort is threefold. Firstly, it is shown that there exists a principle, that we call Kinetical Interaction Principle (KIP), underlying the non linear kinetics in particle systems, independently on the picture…
We introduce a method to prove metastability of the contact process on Erd\H{o}s-R\'enyi graphs and on configuration model graphs. The method relies on uniformly bounding the total infection rate from below, over all sets with a fixed…
In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…