arXiv research

New test detects differences in heterogeneous datasets.

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

Spectral clustering with edge counting detects communities in sparse models.

Graphical estimation of count time series dependencies.

Algorithm matches vertices of correlated Erdős-Rényi graphs efficiently.

odeN efficiently approximates multiple temporal motifs in large networks.

From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and …

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to triangulations.

Maximal knotless graphs have at least 74% of their vertices' edges.

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and reversing colors around a vertex. In the case of the plane, this is well studied…

In this article we give an explicit description of the representation matrix of a Heisenberg type action constructed by Blanchet, Habegger, Masbaum and Vogel. We give the matrix in terms of a ribbon graph and its admissible colorings. We show that components of the representation matrix satisfies the {\it external edge…

Study reveals limits of detecting local geometry in random graphs.

Networks are a fundamental tool for modeling complex systems in a variety of domains including social and communication networks as well as biology and neuroscience. Small subgraph patterns in networks, called network motifs, are crucial to understanding the structure and function of these systems. However, the role of…

We construct a small regular cellular decomposition of the Fulton MacPherson operad $FM_2$ that is compatible with the operad composition. The cells are indexed by trees with edges of two colors and vertices labelled by cells of the cacti operad. We compute the generating functions counting the cells, that are algebrai…

SU(3) instanton homology counts Tait colorings for webs and foams.

Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is ofte…

When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of dif…

Geodesics count exponentially between triangulations of surfaces with enough topology.

The paper introduces a quantum state system to count perfect matchings in graphs.

The study finds an upper limit for the number of minimal origami pairs on a surface.

Let $K$ be a polygonal knot in general position with vertex set $V$. A \emph{generic quadrisecant} of $K$ is a line that is disjoint from the set $V$ and intersects $K$ in exactly four distinct points. We give an upper bound for the number of generic quadrisecants of a polygonal knot $K$ in general position. This upper…

Paper describes a state sum formula for a graph coloring polynomial.

Alexander polynomial equals spanning tree count at t=1.

New exact tests detect changepoints in binary and count data, especially when normal approximations fail.

CAWs learn temporal network dynamics without node identities or edge attributes.

Solves weighted bi-colored plane tree enumeration and applies to geometric problems.

A new method finds DAG models without ground truth.

Gerbes encode spectral gaps in topological insulators.

Let $X$ be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume $X$ is not homothetic to a metric graph with integer edge lengths. Let $P_t$ be the number of parallel classes of oriented closed geodesics of length $\le t$; then $\lim\limits_{t \to \infty} P…

New KWS neural networks improve accuracy and power efficiency.

Proves bounds on spanning two-forests and random cut sizes.

We present a probabilistic framework for overlapping community discovery and link prediction for relational data, given as a graph. The proposed framework has: (1) a deep architecture which enables us to infer multiple layers of latent features/communities for each node, providing superior link prediction performance o…

We study the spectral geometric properties of the scalar Laplace-Beltrami operator associated to the Weil-Petersson metric $g_{\mathrm{WP}}$ on $\mathcal M_γ$, the Riemann moduli space of surfaces of genus $γ> 1$. This space has a singular compactification with respect to $g_{\mathrm{WP}}$, and this metric has crossing…

Understanding how users navigate in a network is of high interest in many applications. We consider a setting where only aggregate node-level traffic is observed and tackle the task of learning edge transition probabilities. We cast it as a preference learning problem, and we study a model where choices follow Luce's a…

The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…

Efficient algorithm for graph matching in correlated stochastic block models.

PathBoost boosts graph-level predictions using path-based features.

This article introduces planar ribbons, Vergili ribbon complexes and ribbon nerves in Alexandroff-Hopf-Whitehead CW (Closure finite Weak) topological spaces. A {\em planar ribbon} (briefly, {ribbon}) in a CW space is the closure of a pair of nesting, non-concentric filled cycles that includes the boundary but does not …

Counting tripods on a flat torus using lattice point counting.

Positive-curvature metrics on trees identified for specific configurations.

For a 3-manifold $M$ with $b_1(M)=1$ fibered over $S^1$ and the fiberwise gradient $ξ$ of a fiberwise Morse function on $M$, we introduce the notion of amidakuji-like path (AL-path) on $M$. An AL-path is a piecewise smooth path on $M$ consisting of edges each of which is either a part of a critical locus of $ξ$ or a fl…

GATs improve node regression on noisy graphs with provable advantage.

Flow Matching for count data improves sample quality and efficiency.

Develops new oracle inequalities for Gaussian ranking estimators.

A fast algorithm for counting Markov equivalent DAGs and designing experiments.

The purpose of this paper is to study harmonic spinors defined on a 1-parameter family of Einstein manifolds which includes Taub-NUT, Eguchi-Hanson and $P^2(C)$ with the Fubini-Study metric as particular cases. We discuss the existence of and explicitly solve for spinors harmonic with respect to the Dirac operator twis…

New theorem counts curves on orbifolds.