相关论文: Graphical constructions of simple exclusion proces…

We introduce probabilistic embeddings using Laplacian priors (PELP). The proposed model enables incorporating graph side-information into static word embeddings. We theoretically show that the model unifies several previously proposed…

We use the macroscopic fluctuation theory (MFT) to evaluate the probability distribution P of extreme values of integrated current J at a specified time t=T in the symmetric simple exclusion process (SSEP) on an infinite line. As shown…

Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…

We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…

The Type D asymmetric simple exclusion process (Type D ASEP) is a two-species interacting particle system exhibiting a drift, where two particles may occupy the same site only if they belong to different species. In previous research…

The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…

It has been shown that approximate message passing algorithm is effective in reconstruction problems for compressed sensing. To evaluate dynamics of such an algorithm, the state evolution (SE) has been proposed. If an algorithm can cancel…

We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…

Simplicial complexes are now a popular alternative to networks when it comes to describing the structure of complex systems, primarily because they encode multi-node interactions explicitly. With this new description comes the need for…

We consider the symmetric simple exclusion process in $\mathbb Z^d$ with quenched bounded dynamic random conductances and prove its hydrodynamic limit in path space. The main tool is the connection, due to the self-duality of the process,…

For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…

Recently, there has been a surge of interest in employing neural networks for graph generation, a fundamental statistical learning problem with critical applications like molecule design and community analysis. However, most approaches…

We introduce a new method, which we call stochastic fusion, which takes an exclusion process and constructs an interacting particle systems in which more than one particle may occupy a lattice site. The construction only requires the…

We study the symmetric facilitated exclusion process (FEP) on the finite one-dimensional lattice $\lbrace 1,\dots ,N-1\rbrace$ when put in contact with boundary reservoirs, whose action is subject to an additional kinetic constraint in…

When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the variable is fixed to the value satisfying the equation. The…

Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…

We propose a Bayesian approximate inference method for learning the dependence structure of a Gaussian graphical model. Using pseudo-likelihood, we derive an analytical expression to approximate the marginal likelihood for an arbitrary…

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…

The asymmetric simple exclusion process (ASEP) is a model of particle transport used in the study of biological processes such as mRNA translation. In 2014, Zhao and Krishnan introduced a new approach for analyzing the ASEP using…

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…