Related papers: Long cycles in locally expanding graphs, with appl…

We use Levy processes to generate joint prior distributions, and therefore penalty functions, for a location parameter as p grows large. This generalizes the class of local-global shrinkage rules based on scale mixtures of normals,…

We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: - We first ask the question of how much randomness is needed to obtain efficient…

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…

We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of each cycle is at most the size of the smallest part, and the…

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…

Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…

We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…

We consider models of open quantum spin systems with irreversible dynamics and show that general quasi-locality results for long-range models, e.g. as proven for the Heisenberg dynamics associated to quantum systems in [27], naturally…

We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

Large real-world graphs tend to be sparse, but they often contain many densely connected subgraphs and exhibit high clustering coefficients. While recent random graph models can capture this sparsity, they ignore the local density, or vice…

We face the problem of characterizing the periodic cases in parametric families of (real or complex) rational diffeomorphisms having a fixed point. Our approach relies on the Normal Form Theory, to obtain necessary conditions for the…

We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

We develop local forms of Ramsey-theoretic dichotomies for block sequences in infinite-dimensional vector spaces, analogous to Mathias' selective coideal form of Silver's theorem for analytic partitions of $[\mathbb{N}]^\infty$. Under large…

Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…

We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…

We describe several applications of the theory of cycles to questions in Commutative Algebra. The main topic is the use of the theory of local Chern characters to answer some questions on modules of finite homological dimension. This paper…

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…