Related papers: Blurred constitutive laws and bipotential convex c…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We assess the performance of EUCLID, Efficient Unsupervised Constitutive Law Identification and Discovery, a recently proposed framework for automated discovery of constitutive laws, on experimental data. Mechanical tests are performed on…
We present new message passing algorithms for performing inference with graphical models. Our methods are designed for the most difficult inference problems where loopy belief propagation and other heuristics fail to converge. Belief…
Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We…
We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching…
Arguments are proposed which show how images hardly perceptible as hided in a clouding backgound can be revealed utilizing special patterns drawn by means of a simple mathematical procedure. Possible applications might be found in medical…
Graph representation learning is a ubiquitous task in machine learning where the goal is to embed each vertex into a low-dimensional vector space. We consider the bipartite graph and formalize its representation learning problem as a…
An eigenfunction method is applied to reduce the regular projective representations (Reps) of finite groups to obtain their irreducible projective Reps. Anti-unitary groups are treated specially, where the decoupled factor systems and…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
This paper presents a probabilistic approach to represent and quantify model-form uncertainties in the reduced-order modeling of complex systems using operator inference techniques. Such uncertainties can arise in the selection of an…
The generic chaining method provides a sharp description of the suprema of many random processes in terms of the geometry of their index sets. The chaining functionals that arise in this theory are however notoriously difficult to control…
We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities…
We study the problem of impurities and mid-gap states in a biased graphene bilayer. We show that the properties of the bound states, such as localization lengths and binding energies, can be controlled externally by an electric field…
The framework used to prove the multiplicative law deformation of the algebra of Feynman-Bender diagrams is a \textit{twisted shifted dual law} (in fact, twice). We give here a clear interpretation of its two parameters. The crossing…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…
There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…