相关论文: Adjacencies on random ordering polytopes and flow …

Over the last two decades, the Latent Position Model (LPM) has become a prominent tool to obtain model-based visualizations of networks. However, the geometric structure of the LPM is inherently symmetric, in the sense that outgoing and…

We present a new approach to metric Diophantine approximation on manifolds based on the correspondence between approximation properties of numbers and orbit properties of certain flows on homogeneous spaces. This approach yields a new proof…

Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…

In 1995 T. Matsui considered a special family 0/1-polytopes for which the problem of recognizing the non-adjacency of two arbitrary vertices is NP-complete. In 2012 the author of this paper established that all the polytopes of this family…

Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models, the predicted choice probabilities often form a bounded and…

The automated analysis of social networks has become an important problem due to the proliferation of social networks, such as LiveJournal, Flickr and Facebook. The scale of these social networks is massive and continues to grow rapidly. An…

Copi, Huterer, Starkman and Schwarz introduced multipole vectors in a tensor context and used them to demonstrate that the first-year WMAP quadrupole and octopole planes align at roughly the 99.9% confidence level. In the present article…

Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…

Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

A graph property is elusive (or evasive) if any algorithm testing it by asking questions of the form ''Is there an edge between vertices x and y?'' must, in the worst case, examine all pairs of vertices. Elusiveness for infinite vertex sets…

This article proves a conjecture by Zuber about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by $m$ nested arches is…

In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $\lambda \geq 0$ such that…

Conformal prediction provides distribution-free coverage guarantees, but in many-class classification it may still under-cover specific classes or subpopulations, preventing safe deployment in high-stakes applications. We propose Cluster…

It is known that the gradient descent algorithm converges linearly when applied to a strongly convex function with Lipschitz gradient. In this case the algorithm's rate of convergence is determined by the condition number of the function.…

The notion of a surface-order specific entropy h_c(P) of a two-dimensional discrete random field P along a curve c is introduced as the limit of rescaled entropies along lattice approximations of the blowups of c. Existence is shown by…

In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…

In this paper, we prove a conjecture by Aas and Linusson on the two-point correlations of adjacent particles in a continuous multispecies TASEP on a ring (AIHPD, 2018). We use the theory of multiline queues as devised by Ferrari and Martin…