Related papers: From dimers to webs

We develop and test a rewiring method (originally proposed by Newman) which allows to build random networks having pre-assigned degree distribution and two-point correlations. For the case of scale-free degree distributions, we discretize…

Partially-observed network data collected by link-tracing based sampling methods is often being studied to obtain the characteristics of a large complex network. However, little attention has been paid to sampling from directed networks…

This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…

A two-dimensional spin-directed $\mathbb{Z}^{\,}_{2}$ network model is constructed that describes the combined effects of dimerization and disorder for the surface states of a weak three-dimensional $\mathbb{Z}^{\,}_{2}$ topological…

We consider a binary supervised learning classification problem where instead of having data in a finite-dimensional Euclidean space, we observe measures on a compact space $\mathcal{X}$. Formally, we observe data $D_N = (\mu_1, Y_1),…

We study the implicit bias of gradient flow on linear equivariant steerable networks in group-invariant binary classification. Our findings reveal that the parameterized predictor converges in direction to the unique group-invariant…

In this paper,we develop a local-to-global and measure-theoretical approach to understand datasets. The idea is to take network models with restricted domains as local charts of datasets. We develop the mathematical foundations for these…

In this paper, we study two problems related to planar matchings in random bipartite graphs. First, we colour each edge of the complete bipartite graph $K_{n,n}$ uniformly randomly from amongst ${r}$ colours and show that if ${r}$ grows…

A new approach for the classification of the cosmic web is presented. In extension of the previous work of Hahn et al. (2007) and Forero-Romero et al. (2009) the new algorithm is based on the analysis of the velocity shear tensor rather…

Many real-world networks are embedded in space, and their resilience in the presence of reinforced nodes has not been studied. Here we model such networks using a spatial network model that have an exponential distribution of link length…

We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…

A biperiodic planar network is a pair $(G,c)$ where $G$ is a graph embedded on the torus and $c$ is a function from the edges of $G$ to non-zero complex numbers. Associated to the discrete Laplacian on a biperiodic planar network is its…

We study the solutions of the T-system for type A, also known as the octahedron equation, viewed as a 2+1-dimensional discrete evolution equation. These may be expressed entirely in terms of the stepped surface over which the initial data…

Combinatorial methods are developed to find the cluster coordinates for moduli space of flat connections which is describing the Coulomb branch of higher rank N=2 theories derived by compactifying six dimensional (2,0) theory on a punctured…

The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An…

We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdiere, Gitler, and Vertigan, we characterize…

We consider the problem of reconstruction of planar domains from their moments. Specifically, we consider domains with boundary which can be represented by a union of a finite number of pieces whose graphs are solutions of a linear…

We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail…

Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by…

This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on $k$-partitions of a graph weights $k$-partitions proportional to the product of the number…