Related papers: Path-Connectedness in Global Bifurcation Theory
Real-world networks are neither regular nor random, a fact elegantly explained by mechanisms such as the Watts-Strogatz or the Barabasi-Albert models, among others. Both mechanisms naturally create shortcuts and hubs, which while enhancing…
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…
We show that the variation of the topology at infinity of a two-variable polynomial function is localisable at a finite number of "atypical points" at infinity. We construct an effective algorithm with low complexity in order to detect…
Systems that are not smooth can undergo bifurcations that are forbidden in smooth systems. We review some of the phenomena that can occur for piecewise-smooth, continuous maps and flows when a fixed point or an equilibrium collides with a…
In the context of two illustrative examples from supersymmetric quantum mechanics we show that the semi-classical analysis of the path integral requires complexification of the configuration space and action, and the inclusion of complex…
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies…
The purpose of this paper is twofold. First we study bifurcations of connected sets of critical orbits of some invariant functional from a given family of critical orbits. We use techniques of equivariant bifurcation theory to obtain a…
We develop a global bifurcation theory for two classes of nonlinear elastic materials. It is supposed that they are subjected to anti-plane shear deformation and occupy an infinite cylinder in the reference configuration. Curves of…
A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…
Electronic transport through chaotic quantum dots exhibits universal, system independent, properties, consistent with random matrix theory. The quantum transport can also be rooted, via the semiclassical approximation, in sums over the…
We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…
Using continuation methods and bifurcation theory, we study the exact multiplicity of periodic solutions, and the global solution structure, for periodic problems of first order. The results are applied to a population model with fishing,…
In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines is purely quantum in nature,…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
We study rigidity/flexibility properties of global solutions to the thin obstacle problem. For solutions with bounded positive sets, we give a classification in terms of their expansions at infinity. For solutions with bounded contact sets,…
In the analysis of parametrized nonautonomous evolutionary equations, bounded entire solutions are natural candidates for bifurcating objects. Appropriate explicit and sufficient conditions for such branchings, however, require to combine…