scholarly journals Phase transitions for spatially extended pinning

Author(s):  
Francesco Caravenna ◽  
Frank den Hollander

AbstractWe consider a directed polymer of length N interacting with a linear interface. The monomers carry i.i.d. random charges $$(\omega _i)_{i=1}^N$$ ( ω i ) i = 1 N taking values in $${\mathbb {R}}$$ R with mean zero and variance one. Each monomer i contributes an energy $$(\beta \omega _i-h)\varphi (S_i)$$ ( β ω i - h ) φ ( S i ) to the interaction Hamiltonian, where $$S_i \in {\mathbb {Z}}$$ S i ∈ Z is the height of monomer i with respect to the interface, $$\varphi :\,{\mathbb {Z}}\rightarrow [0,\infty )$$ φ : Z → [ 0 , ∞ ) is the interaction potential, $$\beta \in [0,\infty )$$ β ∈ [ 0 , ∞ ) is the inverse temperature, and $$h \in {\mathbb {R}}$$ h ∈ R is the charge bias parameter. The configurations of the polymer are weighted according to the Gibbs measure associated with the interaction Hamiltonian, where the reference measure is given by a Markov chain on $${\mathbb {Z}}$$ Z . We study both the quenched and the annealed free energy per monomer in the limit as $$N\rightarrow \infty $$ N → ∞ . We show that each exhibits a phase transition along a critical curve in the $$(\beta ,h)$$ ( β , h ) -plane, separating a localized phase (where the polymer stays close to the interface) from a delocalized phase (where the polymer wanders away from the interface). We derive variational formulas for the critical curves and we obtain upper and lower bounds on the quenched critical curve in terms of the annealed critical curve. In addition, for the special case where the reference measure is given by a Bessel random walk, we derive the scaling limit of the annealed free energy as $$\beta ,h \downarrow 0$$ β , h ↓ 0 in three different regimes for the tail exponent of $$\varphi $$ φ .

1993 ◽  
Vol 08 (06) ◽  
pp. 1139-1152
Author(s):  
M.A. MARTÍN-DELGADO

The discrete model of the real symmetric one-matrix ensemble is analyzed with a cubic interaction. The partition function is found to satisfy a recursion relation that solves the model. The double scaling-limit of the recursion relation leads to a Miura transformation relating the contributions to the free energy coming from oriented and unoriented random surfaces. This transformation is the same kind as found with a quartic interaction.


Author(s):  
Nikhil Karamchandani ◽  
Massimo Franceschetti

The throughput of delay-sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of the study is that of a pair of nodes establishing a data stream that has routing priority over all the remaining traffic in the network. For every delay constraint, upper and lower bounds on the achievable information rate between the two endpoints of the stream are obtained as the network size grows. The analysis concerns decentralized schemes , in the sense that all nodes make next-hop decisions based only on local information, namely their channel strength to other nodes in the network and the position of the destination node. This is particularly important in a fading scenario, where the channel strength varies with time and hence pre-computing routes can be of little help. Natural applications are remote surveillance using sensor networks and communication in emergency scenarios.


Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 315
Author(s):  
Najla M. Alarifi ◽  
Rabha W. Ibrahim

(1) Background: There is an increasing amount of information in complex domains, which necessitates the development of various kinds of operators, such as differential, integral, and linear convolution operators. Few investigations of the fractional differential and integral operators of a complex variable have been undertaken. (2) Methods: In this effort, we aim to present a generalization of a class of analytic functions based on a complex fractional differential operator. This class is defined by utilizing the subordination and superordination theory. (3) Results: We illustrate different fractional inequalities of starlike and convex formulas. Moreover, we discuss the main conditions to obtain sandwich inequalities involving the fractional operator. (4) Conclusion: We indicate that the suggested class is a generalization of recent works and can be applied to discuss the upper and lower bounds of a special case of fractional differential equations.


2020 ◽  
Vol 178 (3-4) ◽  
pp. 655-698
Author(s):  
Dmitry Beliaev ◽  
Michael McAuley ◽  
Stephen Muirhead

Abstract The Nazarov–Sodin constant describes the average number of nodal set components of smooth Gaussian fields on large scales. We generalise this to a functional describing the corresponding number of level set components for arbitrary levels. Using results from Morse theory, we express this functional as an integral over the level densities of different types of critical points, and as a result deduce the absolute continuity of the functional as the level varies. We further give upper and lower bounds showing that the functional is at least bimodal for certain isotropic fields, including the important special case of the random plane wave.


2014 ◽  
Vol 25 (07) ◽  
pp. 877-896 ◽  
Author(s):  
MARTIN KUTRIB ◽  
ANDREAS MALCHER ◽  
MATTHIAS WENDLANDT

We investigate the descriptional complexity of deterministic one-way multi-head finite automata accepting unary languages. It is known that in this case the languages accepted are regular. Thus, we study the increase of the number of states when an n-state k-head finite automaton is simulated by a classical (one-head) deterministic or nondeterministic finite automaton. In the former case upper and lower bounds that are tight in the order of magnitude are shown. For the latter case we obtain an upper bound of O(n2k) and a lower bound of Ω(nk) states. We investigate also the costs for the conversion of one-head nondeterministic finite automata to deterministic k-head finite automata, that is, we trade nondeterminism for heads. In addition, we study how the conversion costs vary in the special case of finite and, in particular, of singleton unary lanuages. Finally, as an application of the simulation results, we show that decidability problems for unary deterministic k-head finite automata such as emptiness or equivalence are LOGSPACE-complete.


1892 ◽  
Vol 50 (302-307) ◽  
pp. 372-395 ◽  

The triangular method of graphical representation suggested by Sir G. G. Stokes, and described in Part IV (‘Roy. Soc. Proc.,’ vol. 49, p. 174), substantially amounts to the tracing out of a curve (“ critical curve”) which shall express the saturation of the solvent C with a mixture in given variable proportions of the other two constituents, A, B ; the variation being such that any given point on the curve is related to some other point (“ conjugate point ”) in a way given by the consideration that all mixtures of the three constituents, A, B, C, represented by points lying on the line (“ tie-line ”) joining these two conjugate points (“ ideal ” alloys, or mixtures), will separate into two different ternary mixtures corresponding with the two points respectively ; whereas any mixture of the same constituents, repre­sented by a point lying outside the critical curve, will form a “ real ” alloy, or mixture, not separating spontaneously into two different fluids but existing as a stable homogeneous whole.


2009 ◽  
Vol 20 (02) ◽  
pp. 313-329
Author(s):  
CHING-LUEH CHANG ◽  
YUH-DAUH LYUU ◽  
YEN-WU TI

Let L ≥ 1, ε > 0 be real numbers, (M, d) be a finite metric space and (N, ρ) be a metric space. A query to a metric space consists of a pair of points and asks for the distance between these points. We study the number of queries to metric spaces (M, d) and (N, ρ) needed to decide whether (M, d) is L-bilipschitz embeddable into (N, ρ) or ∊-far from being L-bilipschitz embeddable into N, ρ). When (M, d) is ∊-far from being L-bilipschitz embeddable into (N, ρ), we allow an o(1) probability of error (i.e., returning the wrong answer "L-bilipschitz embeddable"). However, no error is allowed when (M, d) is L-bilipschitz embeddable into (N, ρ). That is, algorithms with only one-sided errors are studied in this paper. When |M| ≤ |N| are both finite, we give an upper bound of [Formula: see text] on the number of queries for determining with one-sided error whether (M, d) is L-bilipschitz embeddable into (N, ρ) or ∊-far from being L-bilipschitz embeddable into (N, ρ). For the special case of finite |M| = |N|, the above upper bound evaluates to [Formula: see text]. We also prove a lower bound of Ω(|N|3/2) for the special case when |M| = |N| are finite and L = 1, which coincides with testing isometry between finite metric spaces. For finite |M| = |N|, the upper and lower bounds thus match up to a multiplicative factor of at most [Formula: see text], which depends only sublogarithmically in |N|. We also investigate the case when (N, ρ) is not necessarily finite. Our results are based on techniques developed in an earlier work on testing graph isomorphism.


VLSI Design ◽  
1998 ◽  
Vol 6 (1-4) ◽  
pp. 345-349 ◽  
Author(s):  
M. Macucci ◽  
K. Hess

We have studied the capacitance between two parallel plates enclosing a quantum confined system and its dependence on the applied voltage. The concepts of capacitance and differential capacitance are discussed together with their applicability to systems characterized by single.electron tunneling. We determine the tunneling thresholds by means of a formalism based on the minimization of the system free energy and we retrieve, as a special case, Luryi's quantum capacitance formula. We apply our method to the study of an idealized system made up of a number of quantum dots with random size distributed according to a gaussian. Results are shown for different choices of the position of the dots between the plates and of the voltage span applied to perform the measurement of the differential capacitance.


Sign in / Sign up

Export Citation Format

Share Document