相关论文: Markov loops, coverings and fields

Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…

We consider continuous-time random interlacements on a transient weighted graph. We prove an identity in law relating the field of occupation times of random interlacements at level u to the Gaussian free field on the weighted graph. This…

In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…

The Krakow-Orsay collaboration has applied methods borrowed from equilibrium statistical mechanics and analytic combinatorics to study the geometry of random networks. Results contained in a series of recent publications and concerning…

We begin with isotropic Gaussian random fields, and show how the Bochner-Godement theorem gives a natural way to describe their covariance structure. We continue with a study of Mat\'ern processes on Euclidean space, spheres, manifolds and…

Let $f:X\to Y$ be a finite ramified Galois covering of algebraic varieties defined over the complex numbers. In this paper, we prove some structure theorems for such coverings in the case that the non-abelian Galois group of the cover is…

Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings,…

We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Copula-based models provide a great deal of flexibility in modelling multivariate distributions, allowing for the specifications of models for the marginal distributions separately from the dependence structure (copula) that links them to…

The main purpose of this thesis is to study the interplay between geometric properties of infinite graphs and analytic and probabilistic objects such as transition operators, harmonic functions and random walks on these graphs. For a…

For continuous-time Markov chains and open unimolecular chemical reaction networks, we prove that any two stationary currents are linearly related upon perturbations of a single edge's transition rates, arbitrarily far from equilibrium. We…

There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a…

We consider the loop soup at intensity ${1\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned…

Motivated by the success of the non-commutative scalar Grosse-Wulkenhaar model, a non-commutative U(1) gauge field theory including an oscillator-like term in the action has been put forward in arXiv:0705.4205. The aim of the current work…

We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. In many practically important cases, the underlying networks are embedded into Euclidean spaces. Using the natural geometric structure,…

In this paper we investigate the connection between relations among various invariants of number field s $L^H$ coresponding to subgroups $H$ acting on $L$ and of linear relations among norm idempotents.

Lie conformal algebras are useful tools for studying vertex operator algebras and their representations. In this paper, we establish close relations between Poisson conformal algebras and representations of Lie conformal algebras. We also…

We consider pairwise Markov random fields which have a number of important applications in statistical physics, image processing and machine learning such as Ising model and labeling problem to name a couple. Our own motivation comes from…

The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…