English
Related papers

Related papers: Transitive bounded-degree 2-expanders from regular…

200 papers

The border-collision normal form is a piecewise-linear family of continuous maps that describe the dynamics near border-collision bifurcations. Most prior studies assume each piece of the normal form is invertible, as is generic from an…

Dynamical Systems · Mathematics 2024-08-12 David J. W. Simpson

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

Combinatorics · Mathematics 2018-06-07 Demet Taylan

We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…

Discrete Mathematics · Computer Science 2014-02-11 Amin Coja-Oghlan , Uriel Feige , Michael Krivelevich , Daniel Reichman

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

Dynamical Systems · Mathematics 2015-09-30 Van Cyr , Bryna Kra

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

Combinatorics · Mathematics 2021-03-30 Jiangmin Pan , Binzhou Xia , Fugang Yin

Parabolic bifurcations in one complex dimension demonstrate a wide variety of interesting dynamical phenomena. In this paper we consider parabolic bifurcations of families of diffeomorphisms in two complex dimensions. Specifically we…

Dynamical Systems · Mathematics 2012-08-14 Eric Bedford , John Smillie , Tetsuo Ueda

Using the random complexes of Linial and Meshulam, we exhibit a large family of simplicial complexes for which, whenever affinely embedded into Euclidean space, the filling areas of simplicial cycles is greatly distorted. This phenomenon…

Metric Geometry · Mathematics 2014-10-29 Dominic Dotterrer

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…

Combinatorics · Mathematics 2015-05-11 Marston Conder , Tomaž Pisanski , Arjana Žitnik

Dimensional evolution between one- ($1D$) and two-dimensional ($2D$) topological phases is investigated systematically. The crossover from a $2D$ topological insulator to its $1D$ limit shows oscillating behavior between a $1D$ ordinary…

Mesoscale and Nanoscale Physics · Physics 2015-06-19 Huaiming Guo , Lin Yang , Shun-Qing Shen

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

Combinatorics · Mathematics 2024-11-04 Peter J. Cameron

In this paper we study the structure of cellular pseudomanifolds (aka abstract polytopes). These are natural combinatorial generalisations of polytopal spheres (i.e., boundary complexes of convex polytopes). This class is closed under…

Combinatorics · Mathematics 2023-07-06 Bhaskar Bagchi , Basudeb Datta

We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…

Probability · Mathematics 2008-04-02 Oskar Sandberg

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

Mathematical Physics · Physics 2015-06-11 Mei Yin

We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…

Probability · Mathematics 2019-10-23 Nikolaos Fountoulakis , Michał Przykucki

Complex systems have motivated continuing interest from the scientific community, leading to new concepts and methods. Growing systems represent a case of particular interest, as their topological, geometrical, and also dynamical properties…

Social and Information Networks · Computer Science 2024-05-27 Alexandre Benatti , Roberto M. Cesar , Luciano da F. Costa

A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…

Dynamical Systems · Mathematics 2013-05-21 Leon Chang , Jeffrey Cochran , Henning S. Mortveit , Siddharth Raval , Matthew Schroeder

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…

Probability · Mathematics 2010-08-31 Laurent Decreusefond , Eduardo Ferraz

We describe all groups that can be generated by two twists along spherical sequences in an enhanced triangulated category. It will be shown that with one exception such a group is isomorphic to an abelian group generated by not more than…

Representation Theory · Mathematics 2019-11-28 Yury Volkov

One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet $\Sigma$, and study the mean of functions over $\Sigma^n$. We say expander walks…

Computational Complexity · Computer Science 2025-07-22 Fernando Granha Jeronimo , Tushant Mittal , Sourya Roy