Related papers: Some new classes of directed graph IFSs
A roundtrip spanner of a directed graph $G$ is a subgraph of $G$ preserving roundtrip distances approximately for all pairs of vertices. Despite extensive research, there is still a small stretch gap between roundtrip spanners in directed…
A classical result by Erdos and Posa states that there is a function $f: {\mathbb N} \rightarrow {\mathbb N}$ such that for every $k$, every graph $G$ contains $k$ pairwise vertex disjoint cycles or a set $T$ of at most $f(k)$ vertices such…
Many complex systems show non-pairwise interactions, which can be captured by hypergraphs. In this work, we propose an edge-swapping method to sample random directed hypergraphs with fixed vertex and hyperarc degrees, which can be applied…
Let $\{S_i\}_{i\in \Lambda}$ be a finite contracting affine iterated function system (IFS) on ${\Bbb R}^d$. Let $(\Sigma,\sigma)$ denote the two-sided full shift over the alphabet $\Lambda$, and $\pi:\Sigma\to {\Bbb R}^d$ be the coding map…
Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for…
A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
We relate the nontrivial singular values $\sigma_2,\ldots,\sigma_n$ of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We introduce a new directed analogue of conductance…
For some fractal measures it is a very difficult problem in general to prove the existence of spectrum (respectively, frame, Riesz and Bessel spectrum). In fact there are examples of extremely sparse sets that are not even Bessel spectra.…
The sub-additive pressure function $P(s)$ for an affine iterated function system (IFS) and the affinity dimension, defined as the unique solution $s_0$ to $P(s_0)=1$, were introduced by K. Falconer in his seminal 1988 paper on self-affine…
We study $2$-dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in $\mathbb R^{3}$. We give a new geometric characterization of $\mathbb S^{2}$-flows on cubic graphs. We also…
Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we…
A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…
We investigate Tree Iterated Function Systems (TIFSs), which we introduce in this paper. TIFSs are the generalizations of Iterated Function Systems in which we take the maps independently at each step and each block. In this paper, we give…
In this article, an iterated function system (IFS) is considered on the real projective line $\mathbb{RP}^1$ so that the attractor is a Cantor-like set. Hausdorff dimension of this attractor is estimated. The existence of a probability…
We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph…
This paper investigates the dimension theory of some families of continuous piecewise linear iterated function systems. For one family, we show that the Hausdorff dimension of the attractor is equal to the exponential growth rate obtained…
For a directed graph $G$, a $t$-identifying code is a subset $S\subseteq V(G)$ with the property that for each vertex $v\in V(G)$ the set of vertices of $S$ reachable from $v$ by a directed path of length at most $t$ is both non-empty and…
Recent work studying triadic closure in undirected graphs has drawn attention to the distinction between measures that focus on the "center" node of a wedge (i.e., length-2 path) vs. measures that focus on the "initiator," a distinction…