Related papers: A switching identity for cable-graph loop soups an…
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
We show that the problem of identifying different signal components from a time-frequency representation can be equivalently phrased as a graph clustering problem: given a graph $G=(V,E)$ one aims to identify `clusters', subgraphs that are…
We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.
Several classical results on boundary crossing probabilities of Brownian motion and random walks are extended to asymptotically Gaussian random fields, which include sums of i.i.d. random variables with multidimensional indices,…
The topological degeneracy is a characteristic of quantum phase diagram in an Ising chain with transverse field. We revisit the phase diagram at nonzero temperature of an Ising chain with two types of open boundary conditions. In this work,…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
Under certain mild conditions, some limit theorems for functionals of two independent Gaussian processes are obtained. The results apply to general Gaussian processes including fractional Brownian motion, sub-fractional Brownian motion and…
It was shown by Le Jan that the occupation field of a Poisson ensemble of Markov loops ("loop soup") of parameter one-half associated to a transient symmetric Markov jump process on a network is half the square of the Gaussian free field on…
The Ward identity in gauge theory constrains the behavior of the amplitudes. We discuss the Ward identity for amplitudes with a pair of shifted lines with complex momenta. This will induce a recursion relation identical to BCFW recursion…
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
In this paper we lay special stress on analyzing the topological properties of the lattice systems and try to ovoid the conventional ways to calculate the critical points. Only those clusters with finite sizes can execute the self similar…
We generalize the notion of Gaussian bridges by conditioning Gaussian processes given that certain linear functionals of the sample paths vanish. We show the equivalence of the laws of the unconditioned and the conditioned process and by an…
We study the problem of recovering a known cluster structure in a sparse network, also known as the planted partitioning problem, by means of statistical mechanics. We find a sharp transition from un-recoverable to recoverable structure as…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
We investigate absorption, i.e., almost sure convergence to an absorbing state, in time-varying (non-homogeneous) discrete-time Markov chains with finite state space. We consider systems that can switch among a finite set of transition…
The dependence of the effective action for gauge theories on the background field obeys an exact identity. We argue that for Abelian theories the Ward identity follows from the more general background field identity. This observation is…
This paper deals with problem of blind identification of a graph filter and its sparse input signal, thus broadening the scope of classical blind deconvolution of temporal and spatial signals to irregular graph domains. While the…
Identifiability conditions for single or multiple modules in a dynamic network specify under which conditions the considered modules can be uniquely recovered from the second-order statistical properties of the measured signals. Conditions…
Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $\Gamma_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded…