Related papers: de Finetti Style Theorems With Applications to Net…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

This document is a contribution to the proceedings of the MathemAmplitudes 2019 conference held in December 2019 in Padova, Italy. A key step in modern high energy physics scattering amplitudes computation is to express the latter in terms…

We argue that the existing knowledge about modular decomposition of graphs and clan decomposition of 2-structures can be put to use advantageously in a context of data analysis. We show how to obtain visual descriptions of co-occurrence…

We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of…

We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Networks are a useful representation for data on connections between units of interests, but the observed connections are often noisy and/or include missing values. One common approach to network analysis is to treat the network as a…

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

Deep convolutional neural networks have led to breakthrough results in numerous practical machine learning tasks such as classification of images in the ImageNet data set, control-policy-learning to play Atari games or the board game Go,…

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

A major problem in the study of complex socioeconomic systems is represented by privacy issues$-$that can put severe limitations on the amount of accessible information, forcing to build models on the basis of incomplete knowledge. In this…

An artificial neural network is usually treated as a whole system, being characterized by its ground state (the global minimum of the energy functional), the set of fixed points, their basins of attraction, etc. However, it is quite natural…

The last decade has witnessed the success of the traditional feature-based method on exploiting the discrete structures such as words or lexical patterns to extract relations from text. Recently, convolutional and recurrent neural networks…

The classical problem in network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers which decode the same set of messages. In this work, computation over…

Professional networks provide invaluable entree to opportunity through referrals and introductions. A rich literature shows they also serve to entrench and even exacerbate a status quo of privilege and disadvantage. Hiring platforms,…

The Onion Decomposition has recently been shown to provide principled models of complex graphs that better reproduce the sparse networks found in nature, but at the cost of complicated connection rules. We propose a k-edge swapping MCMC…

We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…