相关论文: Ladder Sandpiles
We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
We study the structure of invariant measures for continuous automorphisms of compact metrizable abelian groups satisfying the descending chain condition. We show that the finitely supported invariant measures are weak-* dense in the space…
The algebraic connectivity $a(G)$, defined as the second smallest eigenvalue of the Laplacian matrix $L(G)$, admits a well-known variational characterization involving the minimization of a quadratic form subject to an $\ell_{2}$-norm…
Let $\bS=\{S_1,...,S_K\}$ be a finite set of complex $d\times d$ matrices and $\varSigma_{K}^+$ the compact space of all one-sided infinite sequences $i_{\bcdot}\colon\mathbb{N}\rightarrow\{1,...,K\}$. An ergodic probability $\mu_*$ of the…
We present some analytical results for the stochastic sandpile model, studied earlier by Manna. In this model, the operators corresponding to particle addition at different sites commute. The eigenvalues of operators satisfy a system of…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We prove that, for a $C^2$ partially hyperbolic endomorphism of the 2-torus which is strongly transitive, given an ergodic $u$-Gibbs measure that has positive center Lyapunov exponent and has full support, then either the map is special…
We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…
For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…
The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for…
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is beyond a computable bound, the Markov bases consist…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…
A complex unit gain graph ($\mathbb{T}$-gain graph), $\Phi = (G, \varphi)$ is a graph where the function $\varphi$ assigns a unit complex number to each orientation of an edge of $G$, and its inverse is assigned to the opposite orientation.…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
We study ergodic finite and infinite measures defined on the path space $X_B$ of a Bratteli diagram $B$ which are invariant with respect to the tail equivalence relation on $X_B$. Our interest is focused on measures supported by vertex and…
In this paper, we study the weak compactness of the set of conformal metrics in any Riemann surface without boundary whose Calabi energy and area are uniformly bounded. We prove that for any sequence of such metrics, there alwasy exists a…
We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
We prove that all star vector fields, including Lorenz attractors and multisingular hyperbolic vector fields, admit the intermediate entropy property. To be precise, if $X$ is a star vector field with $h_{top}(X)>0$, then for any $h\in…