arXiv research

Develops new classifiers using proximity catch digraphs for better class imbalance handling.

A new graph-based clustering method for moderate-dimensional data.

Parameter-free clustering method using cluster catch digraphs (CCDs).

In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi, who estab…

ParPIC clusters directed graphs using random walks and diffusion operators.

Study financial contagion and risk in sparse networks with directed edges.

Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory networks, not only the estimation of model parameters but the reconstruction of t…

CCCDs tackle class imbalance in classification.

Java implementation improves nearest neighbor algorithm complexity.

New spectral clustering for directed graphs reveals socio-economic patterns.

We give a geometric proof of the following result of Juhasz. \emph{Let $a_g$ be the leading coefficient of the Alexander polynomial of an alternating knot $K$. If $|a_g|<4$ then $K$ has a unique minimal genus Seifert surface.} In doing so, we are able to generalise the result, replacing `minimal genus' with `incompress…

Two new outlyingness scores improve outlier detection in high-dimensional data.

A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lovász showed that the maximum number of pairwise edge-disjoint $T$-paths in an inner Eulerian graph $G…

Directed graphs can contain arbitrarily complex knots and links.

In the present paper we find a bijection between the set of small covers over an $n$-cube and the set of acyclic digraphs with $n$ labeled nodes. Using this, we give a formula of the number of small covers over an $n$-cube (generally, a product of simplices) up to Davis-Januszkiewicz equivalence classes and $\mathbf{Z}…

New algorithms detect outliers in high-dimensional data with arbitrary shapes.

We represent an exchange economy in terms of statistical ensembles for complex networks by introducing the concept of market configuration. This is defined as a sequence of nonnegative discrete random variables $\{w_{ij}\}$ describing the flow of a given commodity from agent $i$ to agent $j$. This sequence can be arran…

We prove an explicit formula of the Berezin star product on Kaehler manifolds. The formula is expressed as a summation over certain strongly connected digraphs. The proof relies on a combinatorial interpretation of Englis' work on the asymptotic expansion of the Laplace integral.

Directed graphs can be intrinsically knotted and 4-linked.

Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative differential geometry. Despite of the non-commutativity between functions and (gen…

This paper develops graph theory for racks and quasigroups.

GNNRank uses neural networks to learn global rankings from competition match data.

New method clusters directed and undirected graphs without losing directional information.

Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a domain. Structure learning forms one of the inference challenges of statistical graphi…

It has been known since 1981 that if one fixes an orientable surface $S$ of genus $g$, then there is a real number $λ_{min,g} > 1$ that is the dilatation of a pA diffeomorphism of $S$, and every other pA diffeomorphism of $S$ has dilatation $\geq λ_{min,g}$. We will show how a little-known theorem about digraphs gives …

It has been known since 1981 that if one fixes an orientable surface $S$ of genus $g$, then there is a real number $λ_{min,g} > 1$ that is the dilatation of a pA diffeomorphism of $S$, and every other pA diffeomorphism of $S$ has dilatation $\geq λ_{min,g}$. We will show how a little-known theorem about digraphs gives …

New proof for knot state-sum formula using bijection between states.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a …

The paper proves properties for random graphs based on geometric submanifolds.

Study on random surfaces in hyperbolic 3-manifolds, focusing on geometric and topological properties.

Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph $L(D,C)$ whose construction involves very little geometric information about the way …

Uniform models for random 3-manifolds with controlled metrics.

Random branched covers of groups are homotopy equivalent to geometrically small cancellation complexes.

Let $φ\in \mbox{Out}(F_n)$ be a free group outer automorphism that can be represented by an expanding, irreducible train-track map. The automorphism $φ$ determines a free-by-cyclic group $Γ=F_n \rtimes_φ\mathbb Z,$ and a homomorphism $α\in H^1(Γ; \mathbb Z)$. By work of Neumann, Bieri-Neumann-Strebel and Dowdall-Kapovi…

Random veering triangulations are not geometric in most cases.

Randomized Geometric Algebra for Convex Neural Networks Optimizes Transfer Learning.

A new method for approximating softmax and Gaussian kernels with reduced error.

Geometric Block Model improves community detection in sparse graphs.

The ellipticity graph of a free group $F$ was defined by I. Kapovich and M. Lustig in order to study the outer automorphism group of $F$, which acts on this graph. The graph was constructed to be analogous to the curve complex of a surface. It is a bipartite graph, whose vertices are conjugacy classes of nontrivial ele…

Study investigates ruin probability with random premiums and risky investments.

In this paper we offer a novel type of network model which can capture the precise structure of a financial market based, for example, on empirical findings. With the attached stochastic framework it is further possible to study how an arbitrary network structure and its expected counterparty credit risk are analytical…

This paper proposes a new Monte Carlo sampler that balances geometric exploitation and computational cost.

Bayesian methods estimate regression functions on submanifolds using graph Laplacian eigenbasis.

Random hyperbolic surfaces are mostly tangle-free, with geometric implications.

The study of record statistics of correlated series is gaining momentum. In this work, we study the records statistics of the time series of select stock market data and the geometric random walk, primarily through simulations. We show that the distribution of the age of records is a power law with the exponent $α$ lyi…

The paper outlines future work in random sets theory.

Generalizes entropy-drift inequality for specific geometric spaces.