相关论文: Local Characteristics, Entropy and Limit Theorems …

We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…

We give an application of a topological dynamics version of multidimensional Brown's lemma to tiling theory: given a tiling of an Euclidean space and a finite geometric pattern of points $F$, one can find a patch such that, for each scale…

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree…

Inspired by the study of edge statistics of random band matrices, we investigate random walks on large $d$-dimensional periodic lattices, whose transition matrices are determined by discretized density functions. Under certain moment…

Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…

Random matrix models provide a phenomenological description of a vast variety of physical phenomena. Prominent examples include the eigenvalue statistics of quantum (chaotic) systems, which are conveniently characterized using the spectral…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

We give a new simple construction of the sandpile measure on an infinite graph G, under the sole assumption that each tree in the Wired Uniform Spanning Forest on G has one end almost surely. For, the so called, generalized minimal…

Amplitudes in open topological string theory may be described completely by certain A-infinity-categories. We detail a general construction of all cyclic minimal models for a given A-infinity-algebra and apply this result to the case of N=2…

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…

We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…

We present a simple method to efficiently compute a lower limit of the topological entropy and its spatial distribution for two-dimensional mappings. These mappings could represent either two-dimensional time-periodic fluid flows or…

For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…

A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G such that T and T* do not intersect. We show that it is not always possible to find T in G, such that the diameters of T and T*…

We study the problem of low-stretch spanning trees in graphs of bounded width: bandwidth, cutwidth, and treewidth. We show that any simple connected graph $G$ with a linear arrangement of bandwidth $b$ can be embedded into a distribution…

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by…