Related papers: Monotone parameters on Cayley graphs of finitely g…
For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…
The generalized Marcum functions $Q_{\mu}(x,y)$ and $P_{\mu}(x,y)$ have as particular cases the non-central $\chi^2$ and gamma cumulative distributions, which become central distributions (incomplete gamma function ratios) when the…
This is an outline of work in progress. We study the conjecture that the topological entropy of a real cubic map depends ``monotonely'' on its parameters, in the sense that each locus of constant entropy in parameter space is a connected…
For certain groups, parabolic subgroups appear as stabilizers of flags of sets or vector spaces. Quotients by these parabolic subgroups represent orbits of flags, and their cardinalities asymptotically reveal entropies (as rates of…
Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…
The directed Cayley diameter of a finite group is investigated in terms of the monoid of product-one sequences over the group, via the new notion of directed geodesic atoms. Two quantities associated to the set of directed geodesic atoms…
In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
Using monotonicity theory we investigate the continuous dependence on parameters for the discrete BVPs which can be written in a form of a nonlinear system.
We introduce and discuss the notion of monotonicity for the complexity measures of general probability distributions, patterned after the resource theory of quantum entanglement. Then, we explore whether this property is satisfied by the…
We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…
We show that whether loops can be shortcut in a group's Cayley graph depends on the choice of finite generating set. Our example is the direct product of two rank-2 free groups and a consequence is that this group has asymptotic cones with…
This survey paper concerns mainly with some asymptotic topological properties of finitely presented discrete groups: quasi-simple filtration (QSF), geometric simple connectivity (GSC), topological inverse-representations, and the notion of…
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is…
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…
In this work we establish several monotonicity and decomposition results in the framework of random regular graphs. Among other results, we show that, for a wide range of parameters $d_1 \leq d_2$, there exists a coupling of $G(n,d_1)$ and…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together…
We conduct a quantitative analysis of how many random edges need to be added to a base graph $H$ in order to significantly increase natural minor-monotone graph parameters of the resulting graph $R$. Specifically, we show that if $R$ is…
We study some new isoperimetric inequalities on graphs. We etablish a relation between the volume entropy (or asymptotic volume), the systole and the first Betti number of weighted graphs. We also find bounds for the volume, associated to…