相关论文: The interchange process with reversals on the comp…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
The presented material continues the previous article (arxiv:1007.1059) and also is devoted to the equivalent conversion between the graphs. The examining of the transformation of the vertex graphs into the edge graphs (together with the…
Cross phenomena, representing responses of a system to external stimuli, are ubiquitous from quantum to macro scale. The Onsager theorem is often used to describe them, stating that the coefficient matrix of cross phenomena connecting the…
Reciprocal processes are acausal generalizations of Markov processes introduced by Bernstein in 1932. In the literature, a significant amount of attention has been focused on developing dynamical models for reciprocal processes. In this…
The empirical scaling law, wherein the total photoabsorption cross section depends on the single variable eta=(Q^2+m_0^2)/Lambda^2(W^2), provides empirical evidence for saturation in the sense of sigma_{gamma* p}(W^2,Q^2)/sigma_{gamma…
We prove that any over-twist pattern is conjugate to an interval exchange transformation with bounded number of segments of isometry, restricted on one of its cycles. The bound is independent of the period and over-rotation number of the…
Simple models of irreversible dynamical processes such as Bootstrap Percolation have been successfully applied to describe cascade processes in a large variety of different contexts. However, the problem of analyzing non-typical…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
The maxima and the minima of a randomly stopped sample of a random variable, $X$, together with two newly defined random variables that make $X$ into the maxima or minima of a randomly stopped sample of them, can be used to define…
A method for data-driven interpolatory model reduction is presented in this extended abstract. This framework enables the computation of the transfer function values at given interpolation points based on time-domain input-output data only,…
We study a class of quantum spin systems in the mean-field setting of the complete graph. For spin $S=\tfrac12$ the model is the Heisenberg ferromagnet, for general spin $S\in\tfrac12\mathbb{N}$ it has a probabilistic representation as a…
The mechanism of synchronization in the random Zaslavsky map is investigated. From the error dynamics of two particles, the structure of phase space was analyzed, and a transcritical bifurcation between a saddle and a stable fixed point was…
The random antiferromagnetic spin-1/2 XX and XXZ chain is studied numerically for varying strength of the disorder, using exact diagonalization and stochastic series expansion methods. The spin-spin correlation function as well as the…
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect…
A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The…
Probabilistic inferences distill knowledge from graphs to aid human make important decisions. Due to the inherent uncertainty in the model and the complexity of the knowledge, it is desirable to help the end-users understand the inference…