Related papers: A counterexample to Thiagarajan's conjecture on re…
It has become obvious that certain singular phenomena cannot be explained by a mere investigation of the configuration space, defined as the solution set of the loop closure equations. For example, it was observed that a particular 6R…
Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interactions in complex systems. Despite their broad applicability,…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
Many social, biological, and technological systems are recorded as sequences of time-stamped interactions. In such systems, concurrency, i.e., the tendency for an individual to participate in multiple interactions approximately at the same…
Chaotic attractors in the two-dimensional border-collision normal form (a piecewise-linear map) can persist throughout open regions of parameter space. Such robust chaos has been established rigorously in some parameter regimes. Here we…
In the setting of the unbounded derived category D(R) of a ring R of weak global dimension at most one we consider t-structures with a definable coaisle. The t-structures among these which are stable (that is, the t-structures which consist…
In 2013 Andriy V. Bondarenko showed how to construct a two-distance counterexample to Borsuk's conjecture from any strongly regular graph whose vertex set is not the union of at most $f+1$ cliques (sets of pairwise adjacent vertices) where…
In this paper, we consider pursuit-evasion and probabilistic consequences of some geometric notions for bounded and suitably regular domains in Euclidean space that are CAT(kappa) for some kappa > 0. These geometric notions are useful for…
The notion of \emph{concurrence} was recently proposed as the natural compatibility relation between Dirac structures, generalizing the commutativity of two Poisson structures. We address the question of when a reduction scheme -- that is,…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
Patterns often appear in a variety of large, real-world networks, and interesting physical phenomena are often explained by network topology as in the case of the bow-tie structure of the World Wide Web, or the small world phenomenon in…
Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…
We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…
We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…
Let $G$ be a countable group that is the fundamental group of a graph of groups with finite edge groups and vertex groups that satisfy the strong Atiyah conjecture over $K \subseteq \mathbb{C}$ a field closed under complex conjugation.…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…