Related papers: Concentration estimates for algebraic intersection…

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…

In this note, we investigate the maximal number of intersection points of a line with the contour of hypersurface amoebas in $\mathbb{R}^n$. We define the latter number to be the $\mathbb{R}$-degree of the contour. We also investigate the…

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of…

Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…

We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…

We solve a problem conjectured by Cheriyan, giving sharp bounds for incidence of certain edge partitions of the connected graph on $n$-vertices. We briefly discuss the history of the problem and relation to node connectivity of strongly…

We study the "generic" degenerations of curves with two singular points when the points merge. First, the notion of generic degeneration is defined precisely. Then a method to classify the possible results of generic degenerations is…

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

We approximately compute the correspondence degree (as defined by Lazarsfeld and Martin) between two unbalanced complete intersections. This is accomplished by showing that the procedure of taking a subvariety of a product $Y \times Y'$ and…

We suggest simple implementable modifications of conditional gradient and gradient projection methods for smooth convex optimization problems in Hilbert spaces. Usually, the custom methods attain only weak convergence. We prove strong…

This paper contains two parts toward studying abelian varieties from the classification point of view. In a series of papers, the current authors and T.-C. Yang obtain explicit formulas for the numbers of superspecial abelian surfaces over…

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…

We study families of rational curves on an algebraic variety satisfying incidence conditions. We prove an analogue of bend-and-break: that is, we show that under suitable conditions, such a family must contain reducibles. In the case of…

A tight alignment between the degree vector and the leading eigenvector arises naturally in networks with neutral degree mixing and the absence of local structures. Many real-world networks, however, violate both conditions. We derive…

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some…

This paper establishes an analog of the Erd\H{o}s-Ko-Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins. A $k$-uniform family of subsets of a set of finite size $n$ is $l$-intersecting…

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

We present a lightweight network that infers grouping and boundaries, including curves, corners and junctions. It operates in a bottom-up fashion, analogous to classical methods for sub-pixel edge localization and edge-linking, but with a…