相关论文: Rises for Measuring Local Distributivity in Lattic…

Despite the common misconception of nearly static organisms, plants do interact continuously with the environment and with each other. It is fair to assume that during their evolution they developed particular features to overcome problems…

Prediction markets are starting to look less like crowd polls and more like electronic markets. The central question is therefore no longer only whether these markets forecast well, but what happens when institutional liquidity enters: do…

Glass-forming liquids have been extensively studied in recent decades, but there is still no theory that fully describes these systems, and the diversity of treatments is in itself a barrier to understanding. Here we introduce a new simple…

While previous distribution shift detection approaches can identify if a shift has occurred, these approaches cannot localize which specific features have caused a distribution shift -- a critical step in diagnosing or fixing any underlying…

Nestedness is a property of interaction networks widely observed in natural mutualistic communities. Despite a widespread interest on this pattern, no general consensus exists on how to measure it. Instead, several metrics aiming at…

A model for diffusion on a cubic lattice with a random distribution of traps is developed. The traps are redistributed at certain time intervals. Such models are useful for describing systems showing dynamic disorder, such as ion-conducting…

A strong tool for the selection of items that share a common trait from a set of given items is proposed. The selection method is based on marginal estimates and exploits that the estimates of the standard deviation of the mixing…

Bacterial colonies can form a wide variety of shapes and structures based on ambient and internal conditions. To help understand the mechanisms that determine the structure of and the diversity within these colonies, various numerical…

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…

Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…

Cities are some of the most intricate and advanced creations of humanity. Most objects in cities are perfectly synchronised to coordinate activities such as jobs, education, transportation, entertainment, and waste management. Although each…

In this article, we study the relation between lattice basis and successive minima and give an estimate for the measure-theoretical distribution of successive minima. As consequences, we also discuss some logarithm laws associated to higher…

We present a method for hierarchic categorization and taxonomy evolution description. We focus on the structure of epistemic communities (ECs), or groups of agents sharing common knowledge concerns. Introducing a formal framework based on…

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

The idea behind object-centric representation learning is that natural scenes can better be modeled as compositions of objects and their relations as opposed to distributed representations. This inductive bias can be injected into neural…

The modeling and control of networks over finite lattices are studied via the algebraic state space approach. Using the semi-tensor product of matrices, we obtain the algebraic state space representation of the dynamics of (control)…

For the distributions of finitely many binary random variables, we study the interaction of restrictions of the supports with conditional independence constraints. We prove a generalization of the Hammersley-Clifford theorem for…

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

The determination of node centrality is a fundamental topic in social network studies. As an addition to established metrics, which identify central nodes based on their brokerage power, the number and weight of their connections, and the…

Moving deep learning models from the laboratory setting to the open world entails preparing them to handle unforeseen conditions. In several applications the occurrence of novel classes during deployment poses a significant threat, thus it…