arXiv research

Paper proves edge-connectivity equals minimum degree for graphs with non-negative curvature.

We investigate the time series of the degree of minimum spanning trees obtained by using a correlation based clustering procedure which is starting from (i) asset return and (ii) volatility time series. The minimum spanning tree is obtained at different times by computing correlation among time series over a time windo…

We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.

Lower bound on minimum vertex degree for non-negative Lin-Lu-Yau curvature on graphs.

A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.

New bounds on HOMFLY polynomial for homogeneous links.

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $Σ$, including the minimum number of self-intersections, the minimum length of the words representing them in a geometric presentation of $π_1(Σ)$, and the minimum degree of the coverings of $Σ$ to which …

The performance of spectral clustering can be considerably improved via regularization, as demonstrated empirically in Amini et. al (2012). Here, we provide an attempt at quantifying this improvement through theoretical analysis. Under the stochastic block model (SBM), and its extensions, previous results on spectral c…

Margalit and Schleimer constructed nontrivial roots of the Dehn twist about a nonseparating curve. We prove that the conjugacy classes of roots of the Dehn twist about a nonseparating curve correspond to the conjugacy classes of periodic maps with certain conditions. Futhermore, we give data set which determine the con…

Mutual information minimum spanning trees are used to explore nonlinear dependencies on Brazilian equity network in the periods from June/01/2015 to January/26/2016, in which Brazil was under the government of President Dilma Rousseff, and from January/27/2016 to September/08/2016 which includes the government transiti…

We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is given by the signature plus twice the maximum degree of the Jones polynomial. For…

We find the minimum dilatation of pseudo-Anosov homeomorphisms that stabilize an orientable foliation on surfaces of genus three, four, or five, and provide a lower bound for genus six to eight. Our technique also simplifies Cho and Ham's proof of the least dilatation of pseudo-Anosov homeomorphisms on a genus two surf…

We study the misclassification error for community detection in general heterogeneous stochastic block models (SBM) with noisy or partial label information. We establish a connection between the misclassification rate and the notion of minimum energy on the local neighborhood of the SBM. We develop an optimally weighte…

We address a conjecture that $π_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $π_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first known example of minimum Haken manifold. Another motivation is to study epimorphisms …

A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph representation of the optimization problem. The definitive relation between chordal extension and the performance of the optimization algorithm that uses the extension …

Spectral clustering is a fast and popular algorithm for finding clusters in networks. Recently, Chaudhuri et al. (2012) and Amini et al.(2012) proposed inspired variations on the algorithm that artificially inflate the node degrees for improved statistical performance. The current paper extends the previous statistical…

Survey on using low-degree polynomials to assess statistical tasks complexity.

New upper bound on Jones polynomial for fibered positive links.

Random curves on surfaces have predictable properties as they grow.

New findings on computational limits for estimating hidden structures.

The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of S…

Motivated by Bonahon's result for hyperbolic surfaces, we construct an analogue of the Patterson-Sullivan-Bowen-Margulis map from the Culler-Vogtmann outer space $CV(F_k)$ into the space of projectivized geodesic currents on a free group. We prove that this map is a topological embedding. We also prove that for every $…

The calculation of minimum energy paths for transitions such as atomic and/or spin re-arrangements is an important task in many contexts and can often be used to determine the mechanism and rate of transitions. An important challenge is to reduce the computational effort in such calculations, especially when ab initio …

The paper constructs simplicial maps of any degree on spheres, solving a long-standing problem.

In this paper we use wavelet concepts to show that correlation coefficient between two financial data's is not constant but varies with scale from high correlation value to strongly anti-correlation value This studies is important because correlation coefficient is used to quantify degree of independence between two va…

Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdős-Rényi graphs. However, very little is known about the existence of e…

Spectral clustering is sensitive to how graphs are constructed from data particularly when proximal and imbalanced clusters are present. We show that Ratio-Cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced data since they tend to emphasize cut sizes over cut values. We propose a graph partit…

Improved lower bound for knot coloring using quandles.

Spectral clustering methods which are frequently used in clustering and community detection applications are sensitive to the specific graph constructions particularly when imbalanced clusters are present. We show that ratio cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced cluster sizes sin…

The adjusted Rand index (ARI) is commonly used in cluster analysis to measure the degree of agreement between two data partitions. Since its introduction, exploring the situations of extreme agreement and disagreement under different circumstances has been a subject of interest, in order to achieve a better understandi…

New K3 surfaces with two involutions and low Picard number constructed.

We solve an optimal consumption problem with habit formation constraints.

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

A new method calculates the minimum volume swept by a sphere's homotopy in 3D space.

Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram …

Let $γ$ be an essential closed curve with at most $k$ self-intersections on a surface $\mathcal{S}$ with negative Euler characteristic. In this paper, we construct a hyperbolic metric $ρ$ for which $γ$ has length at most $M \cdot \sqrt{k}$, where $M$ is a constant depending only on the topology of $\mathcal{S}$. Moreov…

This paper is concerned with jointly recovering $n$ node-variables $\left\{ x_{i}\right\}_{1\leq i\leq n}$ from a collection of pairwise difference measurements. Imagine we acquire a few observations taking the form of $x_{i}-x_{j}$; the observation pattern is represented by a measurement graph $\mathcal{G}$ with an ed…

Neural networks with DAGs show linearity as width increases.

\noindent Given a Riemann surface $M$, the \emph{complexity} of a branched cover of $M$ to the Riemann sphere $S^2$, of degree $d$ and with branching set of cardinality $n \geq 3$, is defined as $d$ times the hyperbolic area of the complement of its branching set in $S^2$. A branched cover $p \colon M \to S^2$ of degre…

A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links. Despite its flexibility and popularity, there has been a lack of principled statist…

Many models of market dynamics make use of the idea of conservative wealth exchanges among economic agents. A few years ago an exchange model using extremal dynamics was developed and a very interesting result was obtained: a self-generated minimum wealth or poverty line. On the other hand, the wealth distribution exhi…

Sharp bounds on K-semistable Fano varieties for low dimensions.

Bayesian optimization (BO) is a global optimization strategy designed to find the minimum of an expensive black-box function, typically defined on a compact subset of $\mathcal{R}^d$, by using a Gaussian process (GP) as a surrogate model for the objective. Although currently available acquisition functions address this…

Real world experiments are expensive, and thus it is important to reach a target in minimum number of experiments. Experimental processes often involve control variables that changes over time. Such problems can be formulated as a functional optimisation problem. We develop a novel Bayesian optimisation framework for s…

The paper estimates Betti numbers for graphs with specific curvatures, proving bounds and characterizing rigidity.

Entropy minimization has been widely used in unsupervised domain adaptation (UDA). However, existing works reveal that entropy minimization only may result into collapsed trivial solutions. In this paper, we propose to avoid trivial solutions by further introducing diversity maximization. In order to achieve the possib…

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two en…

General Motors or a local business, which one is better to be stimulated in post-crisis recessions, where government stimulation is meant to overcome recessions? Due to the budget constraints, it is quite relevant to ask how one can increase the chance of economic recovery. One of the key elements to answer this questi…