Related papers: Expanding Maps on Flowers, Interval Exchange Trans…
A set of vertices in a graph forms a potential maximal clique if there exists a minimal chordal completion in which it is a maximal clique. Potential maximal cliques were first introduced as a key tool to obtain an efficient, though…
Symbolic dynamics, which partitions an infinite number of finite-length trajectories into a finite number of trajectory sets, describes the dynamics of a system in a simplified and coarse-grained way with a limited number of symbols. The…
Nilsystems are a natural generalization of rotations and arise in various contexts, including in the study of multiple ergodic averages in ergodic theory, in the structural analysis of topological dynamical systems, and in asymptotics for…
We prove that embedded infinite planar maps in ergodic scale-free environments are close to their circle packing and Riemann uniformization embedding on a large scale, as long as suitable moment and connectivity conditions are satisfied.…
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…
This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed…
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space making statistical…
We study the ergodic optimization problem over a real analytic expanding circle map. We show that in both the topological and the measure-theoretical senses, a typical $C^r$ performance function has a unique maximizing measure and the…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although…
We study the $r$-complex contagion influence maximization problem. In the influence maximization problem, one chooses a fixed number of initial seeds in a social network to maximize the spread of their influence. In the $r$-complex…
Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The…
Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
We introduce \emph{moonflowers}, a weaker analogue of sunflowers. A family of sets $S_1,\ldots,S_k$ is a $k$-moonflower if each set $S_i$ contains at least one element that is absent from all the others. We study the extremal problem of…
This paper explores the enhancement of solution diversity in evolutionary algorithms (EAs) for the maximum matching problem, concentrating on complete bipartite graphs and paths. We adopt binary string encoding for matchings and use Hamming…
Graph-structured data are widespread in real-world applications, such as social networks, recommender systems, knowledge graphs, chemical molecules etc. Despite the success of Euclidean space for graph-related learning tasks, its ability to…
For an expanding (unstable) foliation of a diffeomorphism, we use a natural dynamical averaging to construct transverse measures, which we call \emph{maximal}, describing the statistics of how the iterates of a given leaf intersect the…
A model for a lattice of coupled cat maps has been recently introduced. This new and specific choice of the coupling makes the description especially easy and nontrivial quantities as Lyapunov exponents determined exactly. We studied the…
This paper gives a complete classification of the possible ergodic decompositions for certain open families of volume-preserving partially hyperbolic diffeomorphisms. These families include systems with compact center leaves and…