相关论文: Markov loops, coverings and fields

Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible…

We study local normal forms for completely integrable systems on Poisson manifolds in the presence of additional symmetries. The symmetries that we consider are encoded in actions of compact Lie groups. The existence of Weinstein's…

We construct \'etale generalized Heisenberg group covers of hyperelliptic curves over number fields. We use these to produce infinite families of quadratic extensions of cyclotomic fields that admit everywhere unramified generalized…

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…

We introduce a new family of networks, the Apollonian networks, that are simultaneously scale-free, small world, Euclidean, space-filling and matching graphs. These networks have a wide range of applications ranging from the description of…

Reversible part of evolution equations of physical systems is often generated by a Poisson bracket. We discuss geometric means of construction of Poisson brackets and their mutual coupling (direct, semidirect and matched-pair products) as…

In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…

First, we review the notion of a Poisson structure on a noncommutative algebra due to Block-Getzler and Xu and introduce a notion of a Hamiltonian vector field on a noncommutative Poisson algebra. Then we describe a Poisson structure on a…

We study large communication networks of the mean-field type. The input flows to the nodes of the network are supposed to be stationary and with low rate. We show that such a network is ergodic, i.e. it goes to the stationary state, which…

We consider triangulations of closed $2$-dimensional (not necessarily orientable) surfaces. Any minimal set of zigzags that double covers the set of edges provides a $z$-orientation of the triangulation. We introduce Markov chains of…

Exchangeable random graphs serve as an important probabilistic framework for the statistical analysis of network data. In this work we develop an alternative parameterization for a large class of exchangeable random graphs, where the nodes…

Exponential random graph models (ERGMs) are a widely used framework for network data, enabling hypothesis testing on the structural mechanisms underlying observed networks. Bayesian ERGMs provide principled uncertainty quantification and…

We study a connection between random tensors and random matrices through $U(\tau)$ matrix models which generate fully packed, oriented loops on random surfaces. The latter are found to be in bijection with a set of regular edge-colored…

Stochastic processes on manifolds over non-Archimedean fields and with transition measures having values in the field $\bf C$ of complex numbers are defined and investigated. The analogs of Markov, Poisson and Wiener processes are studied.…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

We investigate the first two Galois cohomology groups of $p$-extensions over a base field which does not necessarily contain a primitive $p$th root of unity. We use twisted coefficients in a systematic way. We describe field extensions…

We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…

This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…

The purpose of this note is to extend to Brownian loops some homology and holonomy results obtained in the case of discrete loops on a graph

Understanding and predicting how complex systems respond to external perturbations is a central challenge in nonequilibrium statistical physics. Here we consider continuous-time Markov networks, which we subject to perturbations along a…